Examples

All Integer 2D LP

A 2D LP where all basic feasible solutions are integral and have integral tableaus.

Limiting Constraints 2D LP

A 2D LP demonstrating how the most limiting constraint determines the leaving variable.

Degenerate Fin 2D LP

A 2D LP where the (default) intial feasible solution is degenerate.

Klee Minty 2D LP

A 2D LP where the ‘dantzig’ pivot rule results in a simplex path through every bfs. Klee, Victor; Minty, George J. (1972). “How good is the simplex algorithm?”

All Integer 3D LP

A 3D LP where all basic feasible solutions are integral and have integral tableaus.

Multiple Optimal Solutions 3D LP

A 3D LP demonstrating the geometry of multiple optimal solutions.

Square Pyramid 3D LP

A 3D LP which is highly degenerate. It demonstrates that degeneracy can not be solved by removing a seemingly redundant constraint–doing so can alter the feasible region.

Klee Minty 3D LP

A 3D LP where the ‘dantzig’ pivot rule results in a simplex path through every bfs. Klee, Victor; Minty, George J. (1972). “How good is the simplex algorithm?”