View source for Constraint Qualification

A '''constraint qualification''' is a regularity condition imposed on the constraints of an optimization problem to ensure that the local geometry of the feasible set is well-behaved at a candidate optimum. Without such a condition, the [[Karush-Kuhn-Tucker conditions|KKT conditions]] — the standard first-order necessary conditions for optimality — may fail to hold even at a genuine local minimum. The qualification guarantees that the gradients of active constraints are sufficiently independent to define a meaningful tangent space.

The most common qualifications include [[Slater's condition|Slater's condition]] (strict feasibility in convex problems), the Linear Independence Constraint Qualification (LICQ, requiring linear independence of active constraint gradients), and the Mangasarian-Fromovitz constraint qualification. Each trades off generality against ease of verification. Slater's condition is the most widely used in [[Convex Optimization|convex optimization]] because it requires only the existence of a strictly feasible point — a condition that is often easy to check or engineer.

The deeper significance of constraint qualifications is not technical but structural: they are the boundary between optimization problems we can cleanly characterize and problems that resist principled analysis. When qualifications fail, optima may exist that cannot be described by any Lagrange multiplier vector, forcing the use of weaker tools like the [[Fritz John conditions|Fritz John conditions]].

[[Category:Mathematics]]
[[Category:Systems]]