Vous êtes sur la page 1sur 2

# BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, PILANI - KK BIRLA

GOA CAMPUS
FIRST SEMESTER 2014-2015

Optimization
Tutorial5

1. In the following LPP, compute the entire simplex tableau associated with XB = (x1 , x2 , x5 ))T .

Minimize z = 2x1 + x2

subject to

3x1 + x2 x3 = 3
4x1 + 3x2 x4 = 6
x1 + 2x2 + x5 = 3
x1 , x2 , x3 , x4 , x5 0.

## 2. The following is an optimal LP tableau:

Basic x1 x2 x3 x4 x5 Solution
z 0 0 0 3 2 ?
x3 0 0 1 1 -1 2
x2 0 1 0 1 0 6
x1 1 0 0 -1 1 2

The variables x3 , x4 and x5 are slacks in the original problem. Use matrix manipulations to reconstruct
the original LP and then compute the optimal value.

## 3. Consider the LPP:

Minimize z = x1 + 2x2 + 3x3 + 4x4
subject to

x1 + 2x2 + x3 + 3x4 + x5 = 9
2x1 + x2 + 3x4 + x6 = 9
x1 + x2 + x3 + x7 = 0
x1 , x2 , x3 , x4 , x5 , x6 , x7 0.

## After we apply the Simplex method, a portion of the tableau is as follows:

Basic x1 x2 x3 x4 x5 x6 x7 Solution
z 0 0
x1 1 0
x6 0 1
x3 0
Identify the missing numbers in the above tableau.

4. Solve the following linear programming problems by using revised simplex method

(a)
Minimize z = x1 + x2
subject to

x1 + 2x2 7
4x1 + x2 6
x1 , x2 0.

(b)
Maximize z = x1 + x2
subject to

2x1 + 5x2 6
x1 + x2 2
x1 , x2 0.

(c)
Maximize z = x1 + x2
subject to

3x1 + 2x2 6
x1 + 4x2 4
x1 , x2 0.

(d)
Maximize z = 3x1 + 2x2 + 3x3
subject to

2x1 + x2 + x3 2,
3x1 + 4x2 + 2x3 8,
x1 , x2 , x3 0.

THE END