Sei sulla pagina 1di 2

Linear Programming: Simplex Method

PROBLEM 1. Write the following problem in standard form. Min Z s.t. = 3x1 + 8x2 x1 + x2 200 x1 80 x2 60

2. Given the following initial simplex tableau Basis s1 s2 s3 cB 0 0 0 zj cj zj x1 5 3 9 1 0 5 x2 8 4 15 1 0 8 x3 12 5 20 2 0 12 s1 0 1 0 0 0 0 s2 0 0 1 0 0 0 s3 0 0 0 0 0 0

80 250 20 0

a. b. c. d. f.

What variables form the basis? What are the current values of the decision variables? What is the current value of the objective function? Which variable will be made positive next, and what will its value be? Which variable that is currently positive will become 0? What value will the objective function have next?

3. Given the following simplex tableau Basis cB x1 3 1/2 0 x2 4 1 0 x3 5 0 1 s1 0 1/2 1/4 s2 0 1/2 1

6 3

cj cj zj a. b. c. d. e. f. What variables form the basis? What are the current values of the decision variables? What is the current value of the objective function? Which variable will be made positive next, and what will its value be? Which variable that is currently positive will become 0? What value will the objective function have next?

4. A simplex tableau is shown below. Basis s1 cB 0 x1 3 3 x2 5 6 x3 8 0 s1 0 1 s2 0 0 s3 0 9

126

s2 x3

0 8 zj cj zj

5/2 1/2 4 1

1/2 1/2 4 1

0 1 8 0

0 0 0 0

1 0 0 0

9/2 1/2 4 4

45 18 144

a. b. c.

Do one more iteration of the simplex procedure. What is the current complete solution? Is this solution optimal? Why or why not?

ANS: 5. A simplex table is shown below. Basis s1 x3 s3 cB 0 8 0 zj cj zj x1 5 2/5 4/5 4/5 32/5 7/5 x2 4 3/5 4/5 9/5 32/5 12/5 x3 8 0 1 0 8 0 s1 0 1 0 0 0 0 s2 0 2/5 1/5 1/5 8/5 8/5 s3 0 0 0 1 0 0

4 8 10 64

a. b. c.

What is the current complete solution? The 32/5 for z1 is composed of 0 + 8(4/5) + 0. Explain the meaning of this number. Explain the meaning of the 12/5 value for c 2 z2.

6. Solve the following problem by the simplex method. Max s.t. 14x1 + 14.5x2 + 18x3 x1 + 2x2 + 2.5x3 50 x1 + x2 + 1.5x3 30 x1 , x2 , x3 0

7. Solve the following problem by the simplex method. Max s.t. 100x1 + 120x2 + 85x3 3x1 + 1x2 + 6x3 120 5x1 + 8x2 + 2x3 160 x1 , x2 , x3 0

Potrebbero piacerti anche