Finding Feasible Solutions To A Linear Programming Worksheet - Columbia University In The City Of New York Page 14

ADVERTISEMENT

Final tableaux
z =
M
5M x
6M s
M e
(70)
2
1
1
x
=
6
x
s
(71)
1
2
1
a
=
1
+
s
+
e
(72)
1
1
1
The simplex algorithm terminates because all the objective coefficients
are negative. But, the objective function value is
M and a
= 1. This tells
1
us that the original problem is infeasible.

ADVERTISEMENT

00 votes

Related Articles

Related forms

Related Categories

Parent category: Education