Linear programming: strong duality (incomplete)

Dependencies: (incomplete)

1. Dual of a linear program

For a pair of primal and dual linear programs, exactly one of these is true:

• Both the primal and dual are infeasible.
• The primal is unbounded and the dual is infeasible.
• The primal is infeasible and the dual is unbounded.
• The primal and dual are both feasible and bounded, and have the same optimal objective values.

Dependency for:

1. AnyPrice share

Info:

• Depth: 2
• Number of transitive dependencies: 2

Transitive dependencies:

1. Optimization: Dual and Lagrangian
2. Dual of a linear program