Linear Programming Examples

This page presents links to numerous example pages demonstrating the Simplex Method for solving Linear Programming problems. Almost all of the referenced pages were created by a Perl script that processes data files giving the problem statement. The first list of pages deals with problems that conform to the restrictions of the Basic Simplex processing, namely,

All inequalities are of the "less than or equal" type.
All of the constant terms of the constraints, the inequalities, are non-negative.
All variables are assumed to be non-negative.
We are only asked to Maximize the objective expression.

Link to web page	Description of the problem.
lp_demo_01.htm	2 variables, 5 constraints
lp_demo_02.htm	2 variables, 5 constraints; same as demo_01 but with diffferent objective expression
lp_demo_03.htm	2 variables, 5 constraints; same as demo_01 but with diffferent objective expression
lp_demo_04.htm	2 variables, 5 constraints
lp_demo_05.htm	2 variables, 5 constraints; same as demo_03 but with diffferent objective expression
lp_demo_06.htm	2 variables, 5 constraints; same as demo_03 but with diffferent objective expression
lp_demo_07.htm	3 variables, 7 constraints
lp_demo_08.htm	3 variables, 7 constraints
lp_demo_09.htm	3 variables, 5 constraints
lp_demo_10.htm	3 variables, 5 constraints; same as demo_09 but with diffferent objective expression
lp_demo_11.htm	3 variables, 5 constraints; same as demo_09 but with diffferent objective expression
lp_demo_12.htm	3 variables, 5 constraints; same as demo_09 but with diffferent objective expression
lp_demo_sec01a.htm	2 variables, 4 constraints
lp_demo_sec02a.htm	2 variables, 5 constraints

The second table of links references linear programming problems that require the more expanded version of the Simplex Processing because they involve both greater than and less than or equal to situations, have negative values as constants in the constraints, and may ask to minimize the objective expression.

Link to web page Description of the problem.

lp_demo_13.htm 2 variables, 5 constraints, maximize

lp_demo_14.htm 2 variables, 5 constraints, same as demo_13 but minimize

lp_demo_15.htm 3 variables, 4 constraints, minimize

lp_demo_16.htm 4 variables, 8 constraints, minimize

lp_demo_17.htm 4 variables, 8 constraints, same as demo_16 but maximize

lp_demo_sec01b.htm 2 variables, 5 constraints, minimize

lp_demo_sec01c.htm 2 variables, 5 constraints, same as lp_demo_sec01b but maximize

Link to web page	Description of the problem.
lp_demo_13.htm	2 variables, 5 constraints, maximize
lp_demo_14.htm	2 variables, 5 constraints, same as demo_13 but minimize
lp_demo_15.htm	3 variables, 4 constraints, minimize
lp_demo_16.htm	4 variables, 8 constraints, minimize
lp_demo_17.htm	4 variables, 8 constraints, same as demo_16 but maximize
lp_demo_sec01b.htm	2 variables, 5 constraints, minimize
lp_demo_sec01c.htm	2 variables, 5 constraints, same as lp_demo_sec01b but maximize