Operational Research

1. Consider the following problem:

minimize Z = 2x1 + 3x2 + x3,

subject to
x1 + 4x2 + 2x3 ≥ 8
3x1 + 2x2 ≥ 6
and
xj ≥ 0, j = 1, 2, 3.
(a) Reformulate this problem to fit the standard form for a linear programming model
(b) Using the Big M method, work through the simplex method step by step to solve the problem.
(c) Using the two-phase method, work through the simplex method step by step to solve the problem.
(d) Compare the sequence of BF solutions obtained in parts (b) and (c). Which of these solutions are
feasible only for the artificial problem obtained by introducing artificial variables and which are
actually feasible for the real problem?

2. Consider the following problem.

maximize Z = 90x1 + 70x2,
subject to
2x1 + x2 ≤ 2
x1 − x2 ≥ 2
and x1 ≥ 0, x2 ≥ 0.

(a) Demonstrate graphically that this problem has no feasible solutions.

(b) Using the Big M method, work through the simplex method step by step to demonstrate that the
problem has no feasible solutions.
(c) Repeat part (b) when using phase 1 of the two-phase method.