QUESTION 5 Solve by using Simplex Method Maximize subject to constraints

+ , ,

LP in standard form, Max

s.t

1)

ROW 0 1 2 3 1 0 0 0 -2 1 2 0 -4 3 1 1 -1 0 0 4 0 1 0 0 0 0 1 0 0 0 0 1

RHS 0 4 3 3

RATIO

is the most negative coefficient in row 0. Thus, choose indicates that enter in row 1.

to enter the basis. The ratio test

2)

ROW 0 1 2 3 1 0 0 0 0 1 0 0 -1 0 0 4 0 0 1 0 0 0 0 1

RHS

ERO R0 + (4 R1) R1 R2 R1 R3 R1

RATIO

None None

Choose

to enter the basis. The ratio test indicates that

enter in row 3.

3)

ROW 0 1 2 3 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0

RHS

ERO R0 + R3

RATIO

R3

None

Choose

to enter the basis. The ratio test indicates that

enter in row 2.

4)

ROW 0 1 2 3 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 0 0

RHS

ERO R0 + ( R2)

1 1

R1

( R2) R2

R3 + (

R2)

Since all of the coefficients in row 0 (except for z) are positive. Then, the optimal solution is exists. Thus, the optimal solution is ,

Note LP: Linear Programming

ERO: Elementary Row Operation RHS: Right-hand side