Ie 202 PS 2 1
Ie 202 PS 2 1
24.02.2015
IE 202 PS 2
1.
Use the simplex algorithm to nd the optimal solution to the following LP:
min z= 4x1 - x2
s.t.
2x1 + x2 8
x2 5
x1 - x2 4
x1 0, x2 0
2.
max z= 5x1 +3 x2
s.t.
4x1 + 2x2 12
4x1 + x2 10
x1 + x2 4
x1 0, x2 0
3.
Convert the LP to the standard form. (Hint: |a| b is equivalent to a b and a -b.)
4.
Show that the following LP has alternative optimal solutions; nd three of them and write a general
5 x1 + 7 x2 35
- x1 + 2 x2 2
x1 0, x2 0
5.
max z= x1 + 2 x2
s.t.
- x1 + x2 2
-2 x1 + x2 1
x1 0, x2 0