min z= s.t. 5x11+6x12+8x13 +8x21 + 7x22 + 10x23 A 10,000 X11 +X12+ X13 X21 + x22 + x23 10,000 N 6,000 X11 + 321 + X12 X22 8,000 X13 + X23 5,000 All variables 0 MAX 5 X116 X12 +8 X13 + 8 x21 +7 X22 10 X23 SUBJECT TO 2] X11 + X12 + X13 <= 10000 3) X21 + X22 + X23 <- 10000 4) x11 + X21 >= 6000 5) x12 + x22 >= 8000 6) X13 + X23 DE 5000 END 1) VARIABLE VALUE x11 6000.000000 LP OPTIMUM FOUND AT STEP 5 OBJECTIVE FUNCTION VALUE 128000.000 REDUCED COST .000000 X12 .000000 1.000000 X13 4000.000000 .000000 X21 .000000 1.000000 x22 8000.000000 X23 1000.000000 .000000 .000000 ROW SLACK OR SURPLUS DUAL PRICES 2) 3) .000000 1000.000000 4) 2.000000 .000000 -7.000000 5) 6) .000000 .000000 -7.000000 .000000 -10.000000 5 NO. ITERATIONS- RANGES IN WHICH THE BASIS IS UNCHANGED: OBJ COEFFICIENT RANGES VARIABLE CURRENT COEF ALLOWABLE ALLOWABLE INCREASE DECREASE X11 5.000000 1.000000 7.000000 X12 6.000000 INFINITY 1.000000 X13 8.000000 1.000000 1.000000 x21 8.000000 INFINITY 1.000000 x22 7.000000 1.000000 7.000000 X23 10.000000 1.000000 1.000000 RIGHTHAND SIDE RANGES ROW CURRENT RHS 2 10000.000000 ALLOWABLE ALLOWABLE INCREASE DECREASE 1000.000000 1000.000000 6000.000000 3 10000.000000 4 5 B000.000000 1000.000000 INFINITY 1000.000000 1000.000000 1000.000000 8000.000000 6 5000.000000 1000.000000 1000.000000