Question

Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2, X320 (a) Convert the above constraints to equalities. (2 marks) (b) Set up the initial simplex tableau and solve. (9 marks)

Answer 1

aiven lincay Subjt to, ろ a. to γ2SP Peti velg the 1st) 2nd and 3ft constraints then the constreaints e comes liies Max Z ini tial ba sie vorri ablas a

c the simpler table ith tabla 2100110 2 3 Condition is atielies, and the ptimal solution is Hence, the c. T-Hvr el solutien is

th a o bjcetivefunction -function , α うvalue. Of the Last var, ables , 23-g→ net ev al u akon. vartiable eaving the ba sisini