The other item on the Simplex menu is Dual. It computes the dual of a linear program.
Simplex + Dual
, Dual system is:
x + y 4x + 3y≤6 3x + 4y≤4 x≥ 0 - y≤ 0
6s1 +4s2 1≤3s1 +4s2 - s4 1≤4s1 +3s2 - s3
Applying the simplex algorithm to these two linear programs yields the following results.
Simplex + Maximize
, Maximum is at:
x + y 4x + 3y≤6 3x + 4y≤4 x≥ 0 - y≤ 0 y = 0, x =
![]()
Simplex + Minimize
, Minimum is at:
6s1 +4s2 1≤4s1 +3s2 - s4 1≤3s1 +4s2 - s3 s1≥ 0 s2≥ 0 s3≥ 0 s4≥ 0 s4 = 0, s1 = 0, s2 =
, s3 =
![]()