BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, PILANI - KK BIRLA

GOA CAMPUS
FIRST SEMESTER 2014-2015

Optimization
Tutorial7

1. Use dual simplex algorithm to find the optimal solution of the following LPP:

Maximize z = 3x1 2x2

subject to
x1 + x2 1, x1 + x2 7, x1 + 2x2 10, x2 3, and x1 , x2 0.

2. Use the artificial constraint procedure to solve the following problems by dual simplex method. In each
case, indicate whether the resulting solution is feasible, infeasible or unbounded.

(a) Maximize z = 20x1 + 30x2 subject to 2x1 + 4x2 16, x1 + 5x2 15, x2 6 and x1 , x2 0.
(b) Minimize z = x1 + x2 subject to x1 4x2 5, x1 3x2 1, 2x1 5x2 1 and x1 , x2 0.
(c) Maximize z = x1 3x2 subject to x1 x2 2, x1 + x2 4, 2x1 2x2 3 and x1 , x2 0.

3. Use generalized simplex method to find the solution (if exists) of the following LPP:

(a)
Maximize z = 2x3

subject to

x1 + 2x2 2x3 8, x1 + x2 + x3 4, 2x1 x2 + 4x3 10 and x1 , x2 , x3 0.

(b)
Maximize z = 3x1 + 2x2

subject to
2x1 + x2 2, 3x1 + 4x2 12 and x1 , x2 0.

(c)
Maximize z = 2x1 + 4x2 + 4x3 3x4

subject to
x1 + x2 + x3 = 3, x1 + 4x2 + x4 = 8 and x1 , x2 , x3 , x4 0.

(d)
Maximize z = 5x1 + 6x2

subject to
2x1 + 3x2 = 3, x1 + 2x2 5, 6x1 + 7x2 3 and x1 , x2 0.
4. Given the following LPP:
Maximize z = x1 + 2x2 x3

subject to

3x1 + x2 x3 10
x1 + 4x2 + x3 6
x2 + x3 4 and x1 , x2 , x3 0

(a) Determine an optimal solution to the problem.

(b) Determine the range for discrete change in the components b2 and b3 of the required vector, so as to
maintain the optimality of the current optimal solution.

5. Consider the following LPP

Maximize z = 5x1 + 12x2 + 4x3

subject to
x1 + 2x2 + x3 5, 2x1 x2 + 3x3 = 2, and x1 , x2 , x3 0

5 7 3
Discuss the eect of changing the requirement vector from to (a) , (b) on the optimum
2 2 9
solution.

THE END