Consider an objective function that is a quadratic polynomial, with a singular optimization constraint:Its only feasible point is , giving . For , completing the square yieldsEvery finite Lagrange multiplier gives , but as . Thus : strong duality holds, and the primal optimum is attained, yet dual attainment fails. The inner minimizers approach without ever becoming feasible at finite .
Both the objective function and the constraint function are convex functions. However, Slater's condition fails because is impossible. At the optimum, stationarity would require , which no finite Lagrange multiplier satisfies. Compare KKT regularity at a local minimum: a zero gradient of an active constraint can prevent a multiplier certificate. This example has zero duality gap without the Strong Lagrangian property.
Articles by others on the same topic
There are currently no matching articles.