FE501 – Questions for NLP
Convex and Concave Functions
1. 635
2
3. 634
4.
5. 636
6.
7.
8.
9.
Solving NLPs with One Variable
1. 641
2. 648
3.
4.
Unconstrained Maximization and Minimization with Several Variables
1. 659
2.
3. 660
4.
5.
6.
7. 658
8. 656
Lagrange Multipliers
1. E34 - 667
(NOTE:669-A-1)
2.
3.
The KKT Conditions - 679
1 - 679
2.
3.
4.
5.
6.
7.
8. E33 676
Quadratic Programming - 680
1 - 687
Summary
1 - 705
2
3
4
5
6
7
8 - 706
9
