Catalogue of LP problems¶
The linear programming problems used in the examples and exercises of the whole course, cited by their code P0–P86: problems with two and three variables, in four types (A: non-negative right-hand sides; B: dual simplex; C: Phase 0 needed; D: unbounded, infeasible or with multiple optima). For each, the problem and the figure of its feasible region.
-
LP problems with two variables – Type A
-
LP problems with two variables – Type B
-
LP problems with two variables – Type C
-
LP problems with two variables – Type D
-
LP problems with three variables – Type A
-
LP problems with three variables – Type B
-
LP problems with three variables – Type C
-
LP problems with three variables – Type D