Optimization, Linear Programming, Convex Optimization, Duality, Towards Data Science.
Inequality Constraints Consider the following problem (II): KKT conditions: x is optimal to the foregoing problem if and only if conditions (1)-(3) hold true. Condition (1) merely states that x is a feasible solution, which is usually referred as primal feasibility. Condition (2), usually referred