Sign inSign in
ConceptEngineering

Complementary slackness

A condition relating the optimal primal and dual solutions in linear programming where either a variable is zero or its corresponding constraint is tight.
as Peter Shor defines itMITThe wording closest to all 5 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Stephen Boyd

    Stanford University · Undergraduate

    A property at optimality stating that the product of the dual multiplier and the constraint function is zero, meaning either the multiplier is zero or the constraint is active.
    • 1:15:13Lagrange Duality, Dual Decomposition & Generalized Inequalities
    • 5:12Geometric Problems
    • 0:26Duality Theory
  • Ankur Moitra

    MIT · Undergraduate

    Whenever an inequality in a linear program is not tight, the corresponding dual variable must be equal to zero for strong duality to hold.

Connections

9

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.