In this chapter, we (a) introduce the Lagrange function of an inequality-constrained mathematical programming problem, (b) formulate and prove convex programming Lagrange Duality Theorem, and (c) establish the connection between Lagrange duality and saddle points of the Lagrange function.
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.