Sign inSign in

LP proof system

A proof system consisting of axioms representing 0-1 bounds and instance inequalities, where inference derives nonnegative linear combinations of previously derived lines.
as Ryan O'Donnell defines itCarnegie Mellon University
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.

Linear inequalities1Linear programming duality1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Connections

    3

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

    1 lecturer. 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.