The Fritz John conditions (abbr. FJ conditions), in mathematics, are a necessary condition for a solution in nonlinear programming to be optimal.[1] They are used as lemma in the proof of the Karush–Kuhn–Tucker conditions, but they are relevant on their own. We consider the following optimization problem:
where ƒ is the function to be minimized, [math]\displaystyle{ g_i }[/math] the inequality constraints and [math]\displaystyle{ h_j }[/math] the equality constraints, and where, respectively, [math]\displaystyle{ \mathcal{I} }[/math], [math]\displaystyle{ \mathcal{I'} }[/math] and [math]\displaystyle{ \mathcal{E} }[/math] are the indices sets of inactive, active and equality constraints and [math]\displaystyle{ x^* }[/math] is an optimal solution of [math]\displaystyle{ f }[/math], then there exists a non-zero vector [math]\displaystyle{ \lambda=[\lambda_0, \lambda _1, \lambda _2,\dots,\lambda _n] }[/math] such that:
[math]\displaystyle{ \lambda_0\gt 0 }[/math] if the [math]\displaystyle{ \nabla g_i (i\in\mathcal{I}') }[/math] and [math]\displaystyle{ \nabla h_i (i\in\mathcal{E}) }[/math] are linearly independent or, more generally, when a constraint qualification holds.
Named after Fritz John, these conditions are equivalent to the Karush–Kuhn–Tucker conditions in the case [math]\displaystyle{ \lambda_0 \gt 0 }[/math]. When [math]\displaystyle{ \lambda_0=0 }[/math], the condition is equivalent to the violation of Mangasarian–Fromovitz constraint qualification (MFCQ). In other words, the Fritz John condition is equivalent to the optimality condition KKT or not-MFCQ.
![]() | Original source: https://en.wikipedia.org/wiki/ Fritz John conditions.
Read more |