Sign inSign in
ConceptMathematics

Strong duality

If the optimal value of the primal is finite, then the optimal value of the dual is also finite and they are equal.
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

5

Each in their own terms, from the easiest level.

  • Stephen Boyd

    Stanford University · Undergraduate

    That the lower bound given by the dual problem is tight, reaching all the way up to the optimal primal value (d∗=p∗d^* = p^*).
    • 50:27Lagrange Duality, Dual Decomposition & Generalized Inequalities
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    The fact that the best upper bound certificate from the dual LP equals the maximum value of the primal LP when both are finite.
    • 3:57Min-st-Cut is the Dual LP of Max-st-Flow
  • Ankur Moitra

    MIT · Undergraduate

    The property that the optimal values of primal and dual linear programs are equal when both are feasible.
  • Gilbert Strang

    MIT · Undergraduate

    The property that at the optimal solution, the maximum of the dual problem equals the minimum of the primal problem with no duality gap.
    • 21:56Linear Programming and Two-Person Games

Lectures that assume it

2

Connections

16

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

5 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.