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

ADVERTISEMENT

Eliminating a
1
z =
x
M a
(61)
1
1
a
= 7
x
x
+ e
(62)
1
1
2
1
s
= 6
x
x
(63)
1
1
2
Next we eliminate a
from the objective, yielding:
1
z =
7M
+ M x
+ M x
M e
(64)
1
2
1
a
=
7
x
x
+
e
(65)
1
1
2
1
s
=
6
x
x
(66)
1
1
2
Now, we choose x
to enter and s
to leave:
2
1
z =
M
5M x
6M s
M e
(67)
2
1
1
x
=
6
x
s
(68)
1
2
1
a
=
1
+
s
+
e
(69)
1
1
1

ADVERTISEMENT

00 votes

Related Articles

Related forms

Related Categories

Parent category: Education