Professional Documents
Culture Documents
Optimality Criteria
f(x)
gj(x) 0 for j = 1, 2, ..., J
hk(x) = 0 for k = 1, 2, ..., K
x = (x1, x2, ..., xN)
Mathematical Form
A vector d that is both descending and feasible cannot exist if
-f = mi (gi) (with mi 0) for all active constraints iI.
10
Limitations
Necessity theorem helps identify points that are not
optimal. A point is not optimal if it does not satisfy the
KuhnTucker conditions.
On the other hand, not all points that satisfy the KuhnTucker conditions are optimal points.
The KuhnTucker sufficiency theorem gives conditions
under which a point becomes an optimal solution to a
single-objective NLP.
11
Sufficiency Condition
12
f(x)
gj(x) 0 for j = 1, 2, ..., J
hk(x) = 0 for k = 1, 2, ..., K
x = (x1, x2, ..., xN)
13
Limitations
.
14
Closing Remarks
15