MTCS Opt KKT
MTCS Opt KKT
Use the KKT theorem to show that (x1 = 2, x2 = 2) can not be an optimal
solution of the given LPP.
3. Consider the optimization problem
Max Z = x2
subject to
|x1 | + |x2 | ≤ 2
x21 − x2 ≥ 0 .
1
4. Consider the NLP
Max Z = ln(1 + x1 ) + x2
subject to
2x1 + x2 ≤ 3
x1 , x2 ≥ 0.
Min Z = x1 + x2
subject to
−x1 x2 + 1 ≤ 0
x1 , x2 ≥ 0.