Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

For the Karush-Kuhn Tucker optimsation problem, Wikipedia notes that:

"The necessary conditions are sufficient for optimality if the objective function f and the inequality constraints g_j are continuously differentiable convex functions and the equality constraints h_i are affine functions." link

Could someone please show me how this result is derived? That is, given a convex objective function, convex inequality constraints and affine equality constraints, how can we show that any point in the feasible set that satisfies the KKT conditions must be a minimizer of the function over the feasible set?

share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.