Karush–Kuhn–Tucker conditions explained

In mathematical optimization, the Karush–Kuhn–Tucker (KKT) conditions, also known as the Kuhn–Tucker conditions, are first derivative tests (sometimes called first-order necessary conditions) for a solution in nonlinear programming to be optimal, provided that some regularity conditions are satisfied.

Allowing inequality constraints, the KKT approach to nonlinear programming generalizes the method of Lagrange multipliers, which allows only equality constraints. Similar to the Lagrange approach, the constrained maximization (minimization) problem is rewritten as a Lagrange function whose optimal point is a global maximum or minimum over the domain of the choice variables and a global minimum (maximum) over the multipliers. The Karush–Kuhn–Tucker theorem is sometimes referred to as the saddle-point theorem.^[1]

The KKT conditions were originally named after Harold W. Kuhn and Albert W. Tucker, who first published the conditions in 1951.^[2] Later scholars discovered that the necessary conditions for this problem had been stated by William Karush in his master's thesis in 1939.^{[3] [4]}

Nonlinear optimization problem

Consider the following nonlinear optimization problem in standard form:

minimize

f( x )

subject to

g _{i(x)} \leq 0 , h _{j(x)} =0 .

where

x \in X is the optimization variable chosen from a convex subset of R ^{n} , f is the objective or utility function, g _{i} (i = 1 , \ldots, m) are the inequality constraint functions and h _{j} (j = 1 , \ldots, \ell) are the equality constraint functions. The numbers of inequalities and equalities are denoted by m and \ell respectively. Corresponding to the constrained optimization problem one can form the Lagrangian function

$$\backslash mathcal(\backslash mathbf,\backslash mathbf,\backslash mathbf)\; =\; f(\backslash mathbf)\; +\; \backslash mathbf^\backslash top\; \backslash mathbf(\backslash mathbf)\; +\; \backslash mathbf^\backslash top\; \backslash mathbf(\backslash mathbf)=L(\backslash mathbf,\; \backslash mathbf)=f(\backslash mathbf)+\backslash mathbf^\backslash top\; \backslash begin\backslash mathbf(\backslash mathbf)\; \backslash \backslash \backslash mathbf(\backslash mathbf)\; \backslash end$$

where

$$\backslash mathbf\backslash left(\backslash mathbf\backslash right)\; =\; \backslash begin\; g\_\backslash left(\backslash mathbf\backslash right)\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; g\_\backslash left(\backslash mathbf\backslash right)\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; g\_\backslash left(\backslash mathbf\backslash right)\; \backslash end,\; \backslash quad\; \backslash mathbf\backslash left(\backslash mathbf\backslash right)\; =\; \backslash begin\; h\_\backslash left(\backslash mathbf\backslash right)\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; h\_\backslash left(\backslash mathbf\backslash right)\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; h\_\backslash left(\backslash mathbf\backslash right)\; \backslash end,\; \backslash quad\; \backslash mathbf\; =\; \backslash begin\; \backslash mu\_\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; \backslash mu\_\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; \backslash mu\_\; \backslash \backslash \; \backslash end,\; \backslash quad\; \backslash mathbf\; =\; \backslash begin\; \backslash lambda\_\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; \backslash lambda\_\; \backslash \backslash \; \backslash vdots\; \backslash \backslash \; \backslash lambda\_\; \backslash end\; \backslash quad\; \backslash text\; \backslash quad\; \backslash mathbf\; =\; \backslash begin\; \backslash mu\; \backslash \backslash \; \backslash lambda\; \backslash end.$$ The Karush–Kuhn–Tucker theorem then states the following.

Since the idea of this approach is to find a supporting hyperplane on the feasible set

\Gamma = \left\{ x \in X : g _{i(x)} \leq 0 , i = 1 , \ldots, m \right\} , the proof of the Karush–Kuhn–Tucker theorem makes use of the hyperplane separation theorem.^[5]

The system of equations and inequalities corresponding to the KKT conditions is usually not solved directly, except in the few special cases where a closed-form solution can be derived analytically. In general, many optimization algorithms can be interpreted as methods for numerically solving the KKT system of equations and inequalities.^[6]

Necessary conditions

f\colon R ^{n} → R and the constraint functions g ^{n} _{i\colon R} → R and h ^{n} _{j\colon R} → R have subderivatives at a point x ^{*} \in R ^{n} . If x ^{*} is a local optimum and the optimization problem satisfies some regularity conditions (see below), then there exist constants \mu _{i (i} = 1 ,\ldots,m) and λ _{j (j} = 1 ,\ldots,\ell) , called KKT multipliers, such that the following four groups of conditions hold:^[7]

Stationarity

For minimizing f(x) : \partial f(x ^{*)} + \sum ^{\ell} _{j =1} λ _{j} \partial h ^{*)} _{j(x} + \sum ^{m} _{i =1} \mu _{i} \partial g ^{*)} _{i(x} \ni 0

For maximizing

f(x) : - \partial f(x ^{*)} + \sum ^{\ell} _{j =1} λ _{j} \partial h ^{*)} _{j(x} + \sum ^{m} _{i =1} \mu _{i} \partial g ^{*)} _{i(x} \ni 0

Primal feasibility

h ^{*)} _{j(x} = 0 , for j = 1 , \ldots, \ell g ^{*)} _{i(x} \le 0 , for i = 1 , \ldots, m

Dual feasibility

\mu _{i} \ge 0 , for i = 1 , \ldots, m

Complementary slackness

\sum ^{m} _{i =1} \mu _{i} g _{i} (x ^{*)} = 0 .

The last condition is sometimes written in the equivalent form:

\mu _{i} g _{i} (x ^{*)} = 0 , for i = 1 , \ldots, m.

In the particular case

m =0 , i.e., when there are no inequality constraints, the KKT conditions turn into the Lagrange conditions, and the KKT multipliers are called Lagrange multipliers.

Interpretation: KKT conditions as balancing constraint-forces in state space

The primal problem can be interpreted as moving a particle in the space of

x , and subjecting it to three kinds of force fields:f is a potential field that the particle is minimizing. The force generated by f is - \partial f .g _{i} are one-sided constraint surfaces. The particle is allowed to move inside g _{i} \leq 0 , but whenever it touches g _{i=0} , it is pushed inwards.h _{j} are two-sided constraint surfaces. The particle is allowed to move only on the surface h _{j} .

Primal stationarity states that the "force" of

\partial f(x ^{*)} is exactly balanced by a linear sum of forces \partial h ^{*)} _{j(x} and \partial g ^{*)} _{i(x} .

Dual feasibility additionally states that all the

\partial g ^{*)} _{i(x} forces must be one-sided, pointing inwards into the feasible set for x .

Complementary slackness states that if

g ^{*)} _{i(x} < 0 , then the force coming from \partial g ^{*)} _{i(x} must be zero i.e., \mu ^{*)} _{i(x} = 0 , since the particle is not on the boundary, the one-sided constraint force cannot activate.

Matrix representation

The necessary conditions can be written with Jacobian matrices of the constraint functions. Let

g(x) : R ^{n} → R ^{m} be defined as g (x) = \left( g _{1} (x), \ldots, g _{m} (x) \right) ^{\top} and let h(x) : R ^{n} → R ^{\ell} be defined as h (x) = \left( h _{1} (x), \ldots, h _{\ell} (x) \right) ^{\top} . Let \boldsymbol{\mu} = \left( \mu _{1,} \ldots, \mu _{m} \right) ^{\top} and \boldsymbol{ λ } = \left( λ _{1,} \ldots, λ _{\ell} \right) ^{\top} . Then the necessary conditions can be written as:

Stationarity

For maximizing f(x) : \partial f(x ^{*)} - D g(x ^{*)} ^{\top} \boldsymbol{\mu} - D h(x ^{*)} ^{\top} \boldsymbol{ λ } = 0

For minimizing

f(x) : \partial f(x ^{*)} + D g(x ^{*)} ^{\top} \boldsymbol{\mu} + D h(x ^{*)} ^{\top} \boldsymbol{ λ } = 0

Primal feasibility

g(x ^{*)} \le 0 h(x ^{*)} = 0

Dual feasibility

\boldsymbol \mu \ge 0

Complementary slackness

\boldsymbol \mu ^{\top} g (x ^{*)} = 0 .

Regularity conditions (or constraint qualifications)

One can ask whether a minimizer point

x ^{*} of the original, constrained optimization problem (assuming one exists) has to satisfy the above KKT conditions. This is similar to asking under what conditions the minimizer x ^{*} of a function f(x) in an unconstrained problem has to satisfy the condition \nabla f(x ^{*)=0} . For the constrained case, the situation is more complicated, and one can state a variety of (increasingly complicated) "regularity" conditions under which a constrained minimizer also satisfies the KKT conditions. Some common examples for conditions that guarantee this are tabulated in the following, with the LICQ the most frequently used one:

Constraint	Acronym	Statement
Linearity constraint qualification	LCQ	If g _{i} and h _{j} are affine functions, then no other condition is needed.
Linear independence constraint qualification	LICQ	The gradients of the active inequality constraints and the gradients of the equality constraints are linearly independent at x ^{*} .
Mangasarian-Fromovitz constraint qualification	MFCQ	The gradients of the equality constraints are linearly independent at x ^{*} and there exists a vector d \in R ^{n} such that \nabla g ^{*)} _{i(x} ^{\top} d < 0 for all active inequality constraints and \nabla h ^{*)} _{j(x} ^{\top} d = 0 for all equality constraints.^[8]
Constant rank constraint qualification	CRCQ	For each subset of the gradients of the active inequality constraints and the gradients of the equality constraints the rank at a vicinity of x ^{*} is constant.
Constant positive linear dependence constraint qualification	CPLD	For each subset of gradients of active inequality constraints and gradients of equality constraints, if the subset of vectors is linearly dependent at x ^{*} with non-negative scalars associated with the inequality constraints, then it remains linearly dependent in a neighborhood of x ^{*} .
Quasi-normality constraint qualification	QNCQ	If the gradients of the active inequality constraints and the gradients of the equality constraints are linearly dependent at x ^{*} with associated multipliers λ _{j} for equalities and \mu _{i\geq0} for inequalities, then there is no sequence x _{k\to} x ^{*} such that λ _{j} ≠ 0 ⇒ λ _{j} h _{j(x} _{k)>0} and \mu _{i} ≠ 0 ⇒ \mu _{i} g _{i(x} _{k)>0.}
Slater's condition	SC	For a convex problem (i.e., assuming minimization, f,g _{i} are convex and h _{j} is affine), there exists a point x such that h _{j(x)=0} and g _{i(x)} < 0 .

The strict implications can be shown

LICQ ⇒ MFCQ ⇒ CPLD ⇒ QNCQ

and

LICQ ⇒ CRCQ ⇒ CPLD ⇒ QNCQ

In practice weaker constraint qualifications are preferred since they apply to a broader selection of problems.

Sufficient conditions

In some cases, the necessary conditions are also sufficient for optimality. In general, the necessary conditions are not sufficient for optimality and additional information is required, such as the Second Order Sufficient Conditions (SOSC). For smooth functions, SOSC involve the second derivatives, which explains its name.

The necessary conditions are sufficient for optimality if the objective function

f of a maximization problem is a differentiable concave function, the inequality constraints g _{j} are differentiable convex functions, the equality constraints h _{i} are affine functions, and Slater's condition holds.^[9] Similarly, if the objective function f of a minimization problem is a differentiable convex function, the necessary conditions are also sufficient for optimality.

It was shown by Martin in 1985 that the broader class of functions in which KKT conditions guarantees global optimality are the so-called Type 1 invex functions.^{[10] [11]}

Second-order sufficient conditions

For smooth, non-linear optimization problems, a second order sufficient condition is given as follows.

The solution

x ^{*,} λ ^{*,} \mu ^{*} found in the above section is a constrained local minimum if for the Lagrangian,L(x, λ ,\mu) = f(x) + \sum ^{m} _{i =1} \mu _{i} g _{i(x)} + \sum ^{\ell} _{j =1} λ _{j} h _{j(x)}

then,

s ^{T\nabla} ^{2} ^{xx} L(x ^{*,λ} ^{*,\mu} ^{*)s} \ge 0

where

s \ne 0 is a vector satisfying the following,\left[ \nabla _{x} g ^{*),} _{i(x} \nabla _{x} h ^{*)} _{j(x} \right] ^{T} s = 0 _{R ^{2}}

where only those active inequality constraints

g _{i(x)} corresponding to strict complementarity (i.e. where \mu _{i} > 0 ) are applied. The solution is a strict constrained local minimum in the case the inequality is also strict.

If

s ^{T\nabla} ^{2} ^{xx} L(x ^{*,λ} ^{*,\mu} ^{*)s} = 0 , the third order Taylor expansion of the Lagrangian should be used to verify if x ^{*} is a local minimum. The minimization of f(x _{1,x} _{2)=(x} _{2-x} ^{2 )(x} ^{2-3 x} ^{2 )} ^{1} is a good counter-example, see also Peano surface.

Economics

See also: Profit maximization. Often in mathematical economics the KKT approach is used in theoretical models in order to obtain qualitative results. For example,^[12] consider a firm that maximizes its sales revenue subject to a minimum profit constraint. Letting

Q be the quantity of output produced (to be chosen), R(Q) be sales revenue with a positive first derivative and with a zero value at zero output, C(Q) be production costs with a positive first derivative and with a non-negative value at zero output, and G _{min} be the positive minimal acceptable level of profit, then the problem is a meaningful one if the revenue function levels off so it eventually is less steep than the cost function. The problem expressed in the previously given minimization form is

Minimize

- R(Q)

subject to

G _{min} \le R(Q) - C(Q) Q \ge 0 ,

and the KKT conditions are

\begin{align} & \left( (d R)/(d Q) \right) ( 1+ \mu ) - \mu \left( (d C)/(d Q) \right) \le 0 , \\[ 5 pt] & Q \ge 0 , \\[ 5 pt] & Q \left[ \left( (d R)/(d Q) \right) ( 1+ \mu ) - \mu \left( (d C)/(d Q) \right) \right] = 0 , \\[ 5 pt] & R(Q) - C(Q) - G _{min} \ge 0 , \\[ 5 pt] & \mu \ge 0 , \\[ 5 pt] & \mu [R(Q) - C(Q) - G _{min} ] = 0 . \end{align}

Since

Q = 0 would violate the minimum profit constraint, we have Q > 0 and hence the third condition implies that the first condition holds with equality. Solving that equality gives(d R)/(d Q) = (\mu)/(1+ \mu) \left( (d C)/(d Q) \right).

Because it was given that

d R / d Q and d C / d Q are strictly positive, this inequality along with the non-negativity condition on \mu guarantees that \mu is positive and so the revenue-maximizing firm operates at a level of output at which marginal revenue d R / d Q is less than marginal cost d C / d Q — a result that is of interest because it contrasts with the behavior of a profit maximizing firm, which operates at a level at which they are equal.

Value function

If we reconsider the optimization problem as a maximization problem with constant inequality constraints:

Maximize f(x) subjectto g _{i(x)} \le a _{i} , h _{j(x)} = 0 .

The value function is defined as

V(a _{1,} \ldots, a _{n)} = \sup\limits _{x} f(x) subjectto g _{i(x)} \le a _{i} , h _{j(x)} = 0 j \in \{ 1 ,\ldots, \ell\}, i\in\{ 1 ,\ldots,m\},

so the domain of

V is \{a \in R ^{m} \mid forsome x\in X, g _{i(x)} \leq a _{i,} i \in \{ 1 ,\ldots,m\}\}.

Given this definition, each coefficient

\mu _{i} is the rate at which the value function increases as a _{i} increases. Thus if each a _{i} is interpreted as a resource constraint, the coefficients tell you how much increasing a resource will increase the optimum value of our function f . This interpretation is especially important in economics and is used, for instance, in utility maximization problems.

Generalizations

With an extra multiplier

\mu _{0\geq0} , which may be zero (as long as (\mu _{0,\mu,λ) ≠ 0} ), in front of \nabla f(x ^{*)} the KKT stationarity conditions turn into\begin{align} & \mu _{0} \nabla f(x ^{*)} + \sum ^{m} _{i =1} \mu _{i} \nabla g ^{*)} _{i(x} + \sum ^{\ell} _{j =1} λ _{j} \nabla h ^{*)} _{j(x} = 0 , \\[ 4 pt] & \mu _{jg} ^{*) =0 ,} ^{i(x} i =1 , ... ,m, \end{align}

which are called the Fritz John conditions. This optimality conditions holds without constraint qualifications and it is equivalent to the optimality condition KKT or (not-MFCQ).

The KKT conditions belong to a wider class of the first-order necessary conditions (FONC), which allow for non-smooth functions using subderivatives.

See also

• Farkas' lemma
• Lagrange multiplier
• The Big M method, for linear problems, which extends the simplex algorithm to problems that contain "greater-than" constraints.
• Interior-point method a method to solve the KKT conditions.
• Slack variable
• Slater's condition

Further reading

• R. . Andreani . J. M. . Martínez . M. L. . Schuverdt . On the relation between constant positive linear dependence condition and quasinormality constraint qualification . Journal of Optimization Theory and Applications . 125 . 2 . 473–485 . 2005 . 10.1007/s10957-004-1861-9 . 122212394 .
• Book: Avriel, Mordecai . 2003 . Nonlinear Programming: Analysis and Methods . Dover . 0-486-43227-0 .
• Book: V. . Boltyanski . H. . Martini . V. . Soltan . Geometric Methods and Optimization Problems . New York . Springer . 1998 . 0-7923-5454-0 . 78–92 . The Kuhn–Tucker Theorem . https://books.google.com/books?id=YD7UBwAAQBAJ&pg=PA78 .
• Book: S. . Boyd . L. . Vandenberghe . 2004 . Optimality Conditions . https://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf#page=255 . Convex Optimization . Cambridge University Press . 0-521-83378-7 . 241–249 .
• Book: Murray C. . Kemp . Yoshio . Kimura . Introduction to Mathematical Economics . New York . Springer . 1978 . 0-387-90304-6 . 38–73 .
• Book: Rau, Nicholas . Lagrange Multipliers . Matrices and Mathematical Programming . London . Macmillan . 1981 . 0-333-27768-6 . 156–174 .
• Book: J. . Nocedal . S. J. . Wright . 2006 . Numerical Optimization . Springer . New York . 978-0-387-30303-1 .
• Book: Sundaram, Rangarajan K. . Inequality Constraints and the Theorem of Kuhn and Tucker . A First Course in Optimization Theory . New York . Cambridge University Press . 1996 . 0-521-49770-1 . 145–171 . https://books.google.com/books?id=yAfug81P-8YC&pg=PA145 .

External links

• Karush–Kuhn–Tucker conditions with derivation and examples
• Examples and Tutorials on the KKT Conditions

Notes and References

1. Book: Daniel . Tabak . Benjamin C. . Kuo . Optimal Control by Mathematical Programming . Englewood Cliffs, NJ . Prentice-Hall . 1971 . 0-13-638106-5 . 19–20 .
2. H. W. . Kuhn . Harold W. Kuhn . A. W. . Tucker . Albert W. Tucker . Proceedings of 2nd Berkeley Symposium . 481–492 . Nonlinear programming . University of California Press . 1951 . Berkeley . 47303.
3. W. Karush. Minima of Functions of Several Variables with Inequalities as Side Constraints. M.Sc. thesis. Dept. of Mathematics, Univ. of Chicago, Chicago, Illinois. 1939.
4. Kjeldsen . Tinne Hoff. Tinne Hoff Kjeldsen . A contextualized historical analysis of the Kuhn-Tucker theorem in nonlinear programming: the impact of World War II . Historia Math. . 27 . 2000 . 4 . 331–361 . 1800317 . 10.1006/hmat.2000.2289. free .
5. Book: Murray C. . Kemp . Yoshio . Kimura . Introduction to Mathematical Economics . New York . Springer . 1978 . 0-387-90304-6 . 38–44 .
6. Book: Boyd. Stephen. Vandenberghe. Lieven. Convex Optimization. Cambridge University Press. Cambridge . 2004. 244. 0-521-83378-7. 2061575.
7. Book: Ruszczyński, Andrzej . Nonlinear Optimization . . 2006 . 978-0691119151 . Princeton, NJ . 2199043 . Andrzej Piotr Ruszczyński.
8. Book: Dimitri Bertsekas. Dimitri Bertsekas. Nonlinear Programming. 1999. Athena Scientific. 2. 329–330. 9781886529007.
9. Book: Boyd. Stephen. Vandenberghe. Lieven. Convex Optimization. Cambridge University Press. Cambridge . 2004. 244. 0-521-83378-7. 2061575.
10. D. H. . Martin . J. Optim. Theory Appl. . 47 . 1 . 65–76 . The Essence of Invexity . 1985 . 10.1007/BF00941316 . 122906371 .
11. M. A. . Hanson . Invexity and the Kuhn-Tucker Theorem . J. Math. Anal. Appl. . 236 . 2 . 594–604 . 1999 . 10.1006/jmaa.1999.6484 . free .
12. Chiang, Alpha C. Fundamental Methods of Mathematical Economics, 3rd edition, 1984, pp. 750–752.

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Karush–Kuhn–Tucker conditions".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.