1 max f(x) = 5000x, + 4000x, sujeto a 6x, + 4x2 < 24 Ixy +2x2 56 2%) =O) 3. max f(x) = 20x, + 50x, sujeto a 1x, = 100 2x, + 4x, = 240 xy 20 5. max f(x) = 40x, + 85x, sujetoa 4x, + 95x, < 38 xy tx, S75 Xa 0 1. max f(x) = 280x, + 40x, + 500x, + 5102, sujetoa 30x, +5xz + 45x, + 60x, < 300 20x, + 8x, + 60x, + 30x, < 180 10x, + 20x2 + 10x3 + 120x4 < 300 Hy 2% 20 2 ‘max f(x) = 30x, + 5000x, sujeto a ly <4 2x, 12 3x, + 2x, < 18 xt, 20 4 min f(x) = 0.2x, + 0.08%, sujetoa O.1x, + Ox, > 04 Ox, + 0.1x, = 0.6 Oct +0.2x, = 2 0.2, + Ox, > 7 xy 20 6. max f (x) = x, + 5x2 sujetoa 3x, +4x, $6 y+ 3x2 >2 Xx 20 8 min f(x) = 2x, ~ 3x, 4x5 sujetoa 3x, — 2x, xy 55 x + 3x; — 45 29 x +5x, 21 yx ty, Ayn X20 6EJERCICIO i IP OPTI FOUND aT STEP 2 OBJECTIVE FUNCTION VALUE 1) 21000. 00 VARTABLE vATUE REDUCED COST iL 3.000000 0. 000000 2 i/s00000 0.000000 ROW SLACK OR SURPLUS DUAL PRICES 2) 0 -o00000 750. 000000 3) 0 -o00000 S00 000000 NO. TTERATTONS= 2 EJERCICIO 2 IP OPTIMUM FOUND AT STEP 2 OBJECTIVE FUNCTION VALUE 1) 36000.00 VARIABLE VALUE REDUCED COST aL 2.000000 o.o000a0 2 6 ‘00000 0.000000 ROW SLACK OR SURPLUS DUAL PRICES 2) 2.000000 0. ou0000 3) 0 -oooo00 isoc.coo000 a) 0 oooo00 ono enooon NO. ITERATIONS= 2EJERCICIO 3 LP OPTIWUM FOUND AT STEF L OBJECTIVE FUNCTION VALUE 1) 3000.00 VARIABLE VALUE REDUCED COST a1 0.o00000 5 ongacn, 2 60000000 0. cocoon ROY SLACK OR SURPLUS DUAL PRICES 2) 100 oonon0 0. onooon 3) 0.000000 12.500000 NO. ITERATIONS= 1 EJERCICIO 4 | LP OPTIMUH FOUND aT STEP 2 OBJECTIVE FUNCTION VALUE 1) 1.20000 VARIABLE VALUE REDUCED COST aL 4.000000 0. oodoo0 2 3000000 00000 ROY SLACK OR SURPLUS DUAL PRICES 2) 0000000 “0. 400000 3) 0-300000 0 ooco00 4a) 0.200000 8 oucoo0 5) 0000000 0 so00ca NO. ITERATIONS= 2