Sign inSign in
ConceptMathematics

Dual linear program

A companion linear program derived from a primal LP that provides bounds and complementary interpretations.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 4 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

2

Each in their own terms, from the easiest level.

  • Peter Shor

    MIT · Undergraduate

    The dual of a linear programming minimization problem is a maximization problem with variables yy bounded by ATy=cA^T y = c and y≥0y \geq 0.
    • 52:46Introduction to Linear Programming
    • 41:22Duality in Linear Programming
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 19:33Linear Programming Duality

Connections

10

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

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