Skip to content

Kuhn-Tucker Lagrangian

Definition

For an optimization problem with equality constraints hi(x)=0h_i(\boldsymbol{x})=0 and inequality constraints gj(x)≤0g_j(\boldsymbol{x})\le 0, a Kuhn-Tucker Lagrangian is an expression of the form

L(x,λ,μ)=f(x)+∑iλihi(x)+∑jμjgj(x),L(\boldsymbol{x},\boldsymbol{\lambda},\boldsymbol{\mu}) = f(\boldsymbol{x}) +\sum_i \lambda_i h_i(\boldsymbol{x}) +\sum_j \mu_j g_j(\boldsymbol{x}),

with sign restrictions such as μj≥0\mu_j\ge 0 or μj≤0\mu_j\le 0 depending on the maximization or minimization convention.


Interpretation

The Kuhn-Tucker Lagrangian brings the objective and all active constraint pressures into one stationarity expression.

Feasible triangle x1 + x2 at most 3.8, with the unconstrained maximum of f outside it. At x star on the boundary the gradients of f and g are parallel and point outwards.

At the illustrated constrained maximum, the gradient points outwards, towards the infeasible unconstrained maximum. Writing the constraints as gi(x)≤big_i(\boldsymbol{x})\le b_i and using the maximization convention L=f−∑iλi(gi−bi)\displaystyle L=f-\sum_i\lambda_i(g_i-b_i) with λi≥0\lambda_i\ge0, the multipliers satisfy ∇f(x∗)=∑iλi∇gi(x∗)\displaystyle \boldsymbol{\nabla} f(\boldsymbol{x}^\ast)=\sum_i\lambda_i\boldsymbol{\nabla} g_i(\boldsymbol{x}^\ast), λi≥0\lambda_i\ge0, and λi(gi(x∗)−bi)=0\lambda_i(g_i(\boldsymbol{x}^\ast)-b_i)=0. Any slack inequality has multiplier zero.

At the optimum ∇f\boldsymbol{\nabla} f is a nonnegative multiple of the gradients of the binding constraints.

This extends the Lagrangian function by including inequality residuals. Their multiplier signs depend on how the residual and optimization direction are written; complementary slackness prevents a strictly slack constraint from contributing a nonzero multiplier.


Key Results

  • Equality multipliers are usually unrestricted in sign.
  • Inequality multipliers have sign restrictions tied to the chosen convention.
  • Complementary slackness connects each inequality multiplier to whether its constraint is binding.

Examples

  • For maximizing f(x)f(x) subject to g(x)≤0g(x)\le 0, one common convention uses L=f−μgL=f-\mu g with μ≥0\mu\ge 0.
  • For a nonnegativity condition xi≥0x_i\ge 0, the Kuhn-Tucker system may include a multiplier attached to that boundary condition.

Prerequisites

Sources

Aliases: KKT Lagrangian, Karush-Kuhn-Tucker Lagrangian Keywords: Lagrangian with inequality constraints Symbols: lambda, mu, nabla gradient, sum

Last updated: 22 October 2026 19:04