Optimization, Linear Programming, Convex Optimization, Duality, Towards Data Science.
the optimality, Complementary Slackness requires only one of the two following cases hold true for a constraint (in a non-degeneracy situation): The constraint is binding (i.e., equality) The Lagrangian multiplier of this constraint is zero If we think of the constraint as a resource constraint