Fritz John conditions

The Fritz John conditions are first-order necessary conditions for optimality in constrained nonlinear programming that hold without any constraint qualification. Named after Fritz John, who introduced them in 1948, they predate the more famous KKT conditions and are strictly more general. Where KKT requires a constraint qualification to guarantee the existence of Lagrange multipliers, Fritz John conditions always provide a multiplier vector — at the cost of introducing an additional multiplier on the objective function itself.

In the Fritz John formulation, the stationarity condition includes a non-negative multiplier \(\lambda_0\) on the gradient of the objective: \(\lambda_0 \nabla f(x) + \sum \lambda_i \nabla g_i(x) + \sum \mu_j \nabla h_j(x) = 0\). If \(\lambda_0 > 0\), the condition reduces to KKT after normalization. If \(\lambda_0 = 0\), the condition describes a degenerate situation where the constraints alone determine the optimum, and the objective plays no role in the first-order characterization.

The Fritz John conditions are the safety net of optimization theory: they always apply, but they say less. They are what you use when the geometry of the feasible set is too pathological for the cleaner KKT framework. The existence of cases where \(\lambda_0 = 0\) — where the objective is invisible to the optimality conditions — reveals that constraint qualifications are not merely convenient assumptions. They are the conditions under which optimization problems have enough breathing