Or Assignment 2
Or Assignment 2
subject to 2x1 + x2 ≤ 4
3x1 + 4x2 ≥ 24
2x1 − 3x2 ≥ 6
x1 , x2 ≥ 0.
Is the solution unique? If not, write down the convex combination of the alternative optima.
1
Q.5. Use the simplex method to solve the L.P.P.
Maximize z = 2x2 + x3
subject to x1 + x2 − 2x3 ≤ 7
−3x1 + x2 + 2x3 ≤ 3
x1 , x2 , x3 ≥ 0.
Q.7. Find xj ≥ 0, (j = 1, 2, 3, 4)
Q.8. Show that the following L.P.P. admits of an infinite number of solutions :