Problema 1:
Min 10X11+14X12+11X13+16X14+22X21+19X22+14X23+12X24+9X31+19X32+14X33+11X34
ST.
X11+X12+X13+X14≤1000
X21+X22+X23+X24≤1000
X31+X32+X33+X34≤1500
X11+X21+X31=500
X12+X22+X32=700
X13+X23+X33=600
X14+X24+X34=300
ST.
X11+X12+X13+X14≤1000
X21+X22+X23+X24≤1000
X31+X32+X33+X34≤1500
X11+X21+X31=500
X12+X22+X32=700
X13+X23+X33=600
X14+X24+X34=300
Min 10X11+14X12+11X13+16X14+22X21+19X22+14X23+12X24+9X31+19X32+14X33+11X34
ST.
X11+X12+X13+X14≤1000
X21+X22+X23+X24≤1000
X31+X32+X33+X34≤1500
X11+X21+X31=500
X12+X22+X32=700
X13+X23+X33=600
X14+X24+X34=300
END
LINDO:
OBJECTIVE FUNCTION VALUE
1) 27700.00
VARIABLE VALUE REDUCED COST
X11 0.000000 0.000000
X12 0.000000 0.000000
X13 600.000000 0.000000
X14 0.000000 0.000000
X21 0.000000 0.000000
X22 0.000000 0.000000
X23 0.000000 0.000000
X24 0.000000 0.000000
X31 500.000000 0.000000
X32 700.000000 0.000000
X33 0.000000 0.000000
X34 300.000000 0.000000
ROW SLACK OR SURPLUS DUAL PRICES
2) 400.000000 -1.000000
3) 1000.000000 -1.000000
4) 0.000000 -1.000000
5) 0.000000 1.000000
6) 0.000000 1.000000
7) 0.000000 1.000000
8) 0.000000 1.000000
NO. ITERATIONS= 4
RANGES IN WHICH THE BASIS IS UNCHANGED:
OBJ COEFFICIENT RANGES
VARIABLE CURRENT ALLOWABLE ALLOWABLE
COEF INCREASE DECREASE
X11 10.000000 INFINITY 4.000000
X12 14.000000 INFINITY 0.000000
X13 11.000000 0.000000 INFINITY
X14 16.000000 INFINITY 8.000000
X21 22.000000 INFINITY 16.000000
X22 19.000000 INFINITY 3.000000
X23 14.000000 INFINITY 3.000000
X24 12.000000 INFINITY 4.000000
X31 9.000000 4.000000 INFINITY
X32 19.000000 0.000000 INFINITY
X33 14.000000 INFINITY 0.000000
X34 11.000000 4.000000 INFINITY
RIGHTHAND SIDE RANGES
ROW CURRENT ALLOWABLE ALLOWABLE
RHS INCREASE DECREASE
2 1000.000000 0.000000 0.000000
3 1000.000000 0.000000 0.000000
4 1500.000000 0.000000 0.000000
5 500.000000 0.000000 0.000000
6 700.000000 0.000000 0.000000
7 600.000000 0.000000 0.000000
8 300.000000 0.000000 0.000000
ST.
X11+X12+X13+X14≤1000
X21+X22+X23+X24≤1000
X31+X32+X33+X34≤1500
X11+X21+X31=500
X12+X22+X32=700
X13+X23+X33=600
X14+X24+X34=300
END
LINDO:
OBJECTIVE FUNCTION VALUE
1) 27700.00
VARIABLE VALUE REDUCED COST
X11 0.000000 0.000000
X12 0.000000 0.000000
X13 600.000000 0.000000
X14 0.000000 0.000000
X21 0.000000 0.000000
X22 0.000000 0.000000
X23 0.000000 0.000000
X24 0.000000 0.000000
X31 500.000000 0.000000
X32 700.000000 0.000000
X33 0.000000 0.000000
X34 300.000000 0.000000
ROW SLACK OR SURPLUS DUAL PRICES
2) 400.000000 -1.000000
3) 1000.000000 -1.000000
4) 0.000000 -1.000000
5) 0.000000 1.000000
6) 0.000000 1.000000
7) 0.000000 1.000000
8) 0.000000 1.000000
NO. ITERATIONS= 4
RANGES IN WHICH THE BASIS IS UNCHANGED:
OBJ COEFFICIENT RANGES
VARIABLE CURRENT ALLOWABLE ALLOWABLE
COEF INCREASE DECREASE
X11 10.000000 INFINITY 4.000000
X12 14.000000 INFINITY 0.000000
X13 11.000000 0.000000 INFINITY
X14 16.000000 INFINITY 8.000000
X21 22.000000 INFINITY 16.000000
X22 19.000000 INFINITY 3.000000
X23 14.000000 INFINITY 3.000000
X24 12.000000 INFINITY 4.000000
X31 9.000000 4.000000 INFINITY
X32 19.000000 0.000000 INFINITY
X33 14.000000 INFINITY 0.000000
X34 11.000000 4.000000 INFINITY
RIGHTHAND SIDE RANGES
ROW CURRENT ALLOWABLE ALLOWABLE
RHS INCREASE DECREASE
2 1000.000000 0.000000 0.000000
3 1000.000000 0.000000 0.000000
4 1500.000000 0.000000 0.000000
5 500.000000 0.000000 0.000000
6 700.000000 0.000000 0.000000
7 600.000000 0.000000 0.000000
8 300.000000 0.000000 0.000000
Problema 2:
Max 15X11+12X12+9X13+2X14+22X21+19X22+14X23+12X24+9X31+19X32+14X33+11X34+4S1+4S2+4S3
ST
X11+X12+X13+X14+S1=1000
X21+X22+X23+X24+S2=1000
X31+X32+X33+X34+S3=1500
X11+X21+X31=500
X12+X22+X32=700
X13+X23+X33=600
X14+X24+X34=300
ST
X11+X12+X13+X14+S1=1000
X21+X22+X23+X24+S2=1000
X31+X32+X33+X34+S3=1500
X11+X21+X31=500
X12+X22+X32=700
X13+X23+X33=600
X14+X24+X34=300
Max 15X11+12X12+9X13+2X14+22X21+19X22+14X23+12X24+9X31+19X32+14X33+11X34+4S1+4S2+4S3
ST
X11+X12+X13+X14+S1=1000
X21+X22+X23+X24+S2=1000
X31+X32+X33+X34+S3=1500
X11+X21+X31=500
X12+X22+X32=700
X13+X23+X33=600
X14+X24+X34=300
END
LINDO:
LP OPTIMUM FOUND AT STEP 9
OBJECTIVE FUNCTION VALUE
1) 41900.00
VARIABLE VALUE REDUCED COST
X11 0.000000 7.000000
X12 0.000000 7.000000
X13 0.000000 5.000000
X14 0.000000 10.000000
X21 500.000000 0.000000
X22 200.000000 0.000000
X23 0.000000 0.000000
X24 300.000000 0.000000
X31 0.000000 13.000000
X32 500.000000 0.000000
X33 600.000000 0.000000
X34 0.000000 1.000000
S1 1000.000000 0.000000
S2 0.000000 0.000000
S3 400.000000 0.000000
ROW SLACK OR SURPLUS DUAL PRICES
2) 0.000000 4.000000
3) 0.000000 4.000000
4) 0.000000 4.000000
5) 0.000000 18.000000
6) 0.000000 15.000000
7) 0.000000 10.000000
8) 0.000000 8.000000
NO. ITERATIONS= 9
RANGES IN WHICH THE BASIS IS UNCHANGED:
OBJ COEFFICIENT RANGES
VARIABLE CURRENT ALLOWABLE ALLOWABLE
COEF INCREASE DECREASE
X11 15.000000 7.000000 INFINITY
X12 12.000000 7.000000 INFINITY
X13 9.000000 5.000000 INFINITY
X14 2.000000 10.000000 INFINITY
X21 22.000000 INFINITY 7.000000
X22 19.000000 1.000000 0.000000
X23 14.000000 0.000000 INFINITY
X24 12.000000 INFINITY 1.000000
X31 9.000000 13.000000 INFINITY
X32 19.000000 0.000000 1.000000
X33 14.000000 INFINITY 0.000000
X34 11.000000 1.000000 INFINITY
S1 4.000000 INFINITY 5.000000
S2 4.000000 0.000000 INFINITY
S3 4.000000 5.000000 0.000000
RIGHTHAND SIDE RANGES
ROW CURRENT ALLOWABLE ALLOWABLE
RHS INCREASE DECREASE
2 1000.000000 INFINITY 1000.000000
3 1000.000000 500.000000 200.000000
4 1500.000000 INFINITY 400.000000
5 500.000000 200.000000 500.000000
6 700.000000 400.000000 500.000000
7 600.000000 400.000000 600.000000
8 300.000000 200.000000 300.000000
ST
X11+X12+X13+X14+S1=1000
X21+X22+X23+X24+S2=1000
X31+X32+X33+X34+S3=1500
X11+X21+X31=500
X12+X22+X32=700
X13+X23+X33=600
X14+X24+X34=300
END
LINDO:
LP OPTIMUM FOUND AT STEP 9
OBJECTIVE FUNCTION VALUE
1) 41900.00
VARIABLE VALUE REDUCED COST
X11 0.000000 7.000000
X12 0.000000 7.000000
X13 0.000000 5.000000
X14 0.000000 10.000000
X21 500.000000 0.000000
X22 200.000000 0.000000
X23 0.000000 0.000000
X24 300.000000 0.000000
X31 0.000000 13.000000
X32 500.000000 0.000000
X33 600.000000 0.000000
X34 0.000000 1.000000
S1 1000.000000 0.000000
S2 0.000000 0.000000
S3 400.000000 0.000000
ROW SLACK OR SURPLUS DUAL PRICES
2) 0.000000 4.000000
3) 0.000000 4.000000
4) 0.000000 4.000000
5) 0.000000 18.000000
6) 0.000000 15.000000
7) 0.000000 10.000000
8) 0.000000 8.000000
NO. ITERATIONS= 9
RANGES IN WHICH THE BASIS IS UNCHANGED:
OBJ COEFFICIENT RANGES
VARIABLE CURRENT ALLOWABLE ALLOWABLE
COEF INCREASE DECREASE
X11 15.000000 7.000000 INFINITY
X12 12.000000 7.000000 INFINITY
X13 9.000000 5.000000 INFINITY
X14 2.000000 10.000000 INFINITY
X21 22.000000 INFINITY 7.000000
X22 19.000000 1.000000 0.000000
X23 14.000000 0.000000 INFINITY
X24 12.000000 INFINITY 1.000000
X31 9.000000 13.000000 INFINITY
X32 19.000000 0.000000 1.000000
X33 14.000000 INFINITY 0.000000
X34 11.000000 1.000000 INFINITY
S1 4.000000 INFINITY 5.000000
S2 4.000000 0.000000 INFINITY
S3 4.000000 5.000000 0.000000
RIGHTHAND SIDE RANGES
ROW CURRENT ALLOWABLE ALLOWABLE
RHS INCREASE DECREASE
2 1000.000000 INFINITY 1000.000000
3 1000.000000 500.000000 200.000000
4 1500.000000 INFINITY 400.000000
5 500.000000 200.000000 500.000000
6 700.000000 400.000000 500.000000
7 600.000000 400.000000 600.000000
8 300.000000 200.000000 300.000000
Problema 3:
Min 12X11+15X12+16X13+14X14+15X21+2X22+18X23+16X24+10X31+15X32+8X33+6X34+2000I1+25000I2+20000I3+15000I4
ST
X11+X12+X13+X14=150
X21+X22+X23+X24=100
X31+X32+X33+X34=50
X11+X21+X31+I1=500
X12+X22+X32+I2=700
X13+X23+X33+I3=600
X14+X24+X34+I4=300
ST
X11+X12+X13+X14=150
X21+X22+X23+X24=100
X31+X32+X33+X34=50
X11+X21+X31+I1=500
X12+X22+X32+I2=700
X13+X23+X33+I3=600
X14+X24+X34+I4=300
Min 12X11+15X12+16X13+14X14+15X21+2X22+18X23+16X24+10X31+15X32+8X33+6X34+2000I1+25000I2+20000I3+15000I4
ST
X11+X12+X13+X14=150
X21+X22+X23+X24=100
X31+X32+X33+X34=50
X11+X21+X31+I1=500
X12+X22+X32+I2=700
X13+X23+X33+I3=600
X14+X24+X34+I4=300
END
ST
X11+X12+X13+X14=150
X21+X22+X23+X24=100
X31+X32+X33+X34=50
X11+X21+X31+I1=500
X12+X22+X32+I2=700
X13+X23+X33+I3=600
X14+X24+X34+I4=300
END
LINDO:
LP OPTIMUM FOUND AT STEP 9
OBJECTIVE FUNCTION VALUE
1) 41900.00
VARIABLE VALUE REDUCED COST
X11 0.000000 7.000000
X12 0.000000 7.000000
X13 0.000000 5.000000
X14 0.000000 10.000000
X21 500.000000 0.000000
X22 200.000000 0.000000
X23 0.000000 0.000000
X24 300.000000 0.000000
X31 0.000000 13.000000
X32 500.000000 0.000000
X33 600.000000 0.000000
X34 0.000000 1.000000
S1 1000.000000 0.000000
S2 0.000000 0.000000
S3 400.000000 0.000000
ROW SLACK OR SURPLUS DUAL PRICES
2) 0.000000 4.000000
3) 0.000000 4.000000
4) 0.000000 4.000000
5) 0.000000 18.000000
6) 0.000000 15.000000
7) 0.000000 10.000000
8) 0.000000 8.000000
NO. ITERATIONS= 9
RANGES IN WHICH THE BASIS IS UNCHANGED:
OBJ COEFFICIENT RANGES
VARIABLE CURRENT ALLOWABLE ALLOWABLE
COEF INCREASE DECREASE
X11 15.000000 7.000000 INFINITY
X12 12.000000 7.000000 INFINITY
X13 9.000000 5.000000 INFINITY
X14 2.000000 10.000000 INFINITY
X21 22.000000 INFINITY 7.000000
X22 19.000000 1.000000 0.000000
X23 14.000000 0.000000 INFINITY
X24 12.000000 INFINITY 1.000000
X31 9.000000 13.000000 INFINITY
X32 19.000000 0.000000 1.000000
X33 14.000000 INFINITY 0.000000
X34 11.000000 1.000000 INFINITY
S1 4.000000 INFINITY 5.000000
S2 4.000000 0.000000 INFINITY
S3 4.000000 5.000000 0.000000
RIGHTHAND SIDE RANGES
ROW CURRENT ALLOWABLE ALLOWABLE
RHS INCREASE DECREASE
2 1000.000000 INFINITY 1000.000000
3 1000.000000 500.000000 200.000000
4 1500.000000 INFINITY 400.000000
5 500.000000 200.000000 500.000000
6 700.000000 400.000000 500.000000
7 600.000000 400.000000 600.000000
8 300.000000 200.000000 300.000000
LP OPTIMUM FOUND AT STEP 7
OBJECTIVE FUNCTION VALUE
1) 0.2750320E+08
VARIABLE VALUE REDUCED COST
X11 0.000000 22997.000000
X12 150.000000 0.000000
X13 0.000000 5001.000000
X14 0.000000 9999.000000
X21 0.000000 23013.000000
X22 100.000000 0.000000
X23 0.000000 5016.000000
X24 0.000000 10014.000000
X31 0.000000 22995.000000
X32 50.000000 0.000000
X33 0.000000 4993.000000
X34 0.000000 9991.000000
I1 500.000000 0.000000
I2 400.000000 0.000000
I3 600.000000 0.000000
I4 300.000000 0.000000
ROW SLACK OR SURPLUS DUAL PRICES
2) 0.000000 24985.000000
3) 0.000000 24998.000000
4) 0.000000 24985.000000
5) 0.000000 -2000.000000
6) 0.000000 -25000.000000
7) 0.000000 -20000.000000
8) 0.000000 -15000.000000
NO. ITERATIONS= 7
RANGES IN WHICH THE BASIS IS UNCHANGED:
OBJ COEFFICIENT RANGES
VARIABLE CURRENT ALLOWABLE ALLOWABLE
COEF INCREASE DECREASE
X11 12.000000 INFINITY 22997.000000
X12 15.000000 5001.000000 INFINITY
X13 16.000000 INFINITY 5001.000000
X14 14.000000 INFINITY 9999.000000
X21 15.000000 INFINITY 23013.000000
X22 2.000000 5016.000000 INFINITY
X23 18.000000 INFINITY 5016.000000
X24 16.000000 INFINITY 10014.000000
X31 10.000000 INFINITY 22995.000000
X32 15.000000 4993.000000 INFINITY
X33 8.000000 INFINITY 4993.000000
X34 6.000000 INFINITY 9991.000000
I1 2000.000000 22995.000000 INFINITY
I2 25000.000000 INFINITY 4993.000000
I3 20000.000000 4993.000000 INFINITY
I4 15000.000000 9991.000000 INFINITY
RIGHTHAND SIDE RANGES
ROW CURRENT ALLOWABLE ALLOWABLE
RHS INCREASE DECREASE
2 150.000000 400.000000 150.000000
3 100.000000 400.000000 100.000000
4 50.000000 400.000000 50.000000
5 500.000000 INFINITY 500.000000
6 700.000000 INFINITY 400.000000
7 600.000000 INFINITY 600.000000
8 300.000000 INFINITY 300.000000
Problema 4:
Min 9X11+14X12+12X13+17X14+11X21+10X22+6X23+10X24+12X31+8X32+15X33+7X34
ST
X11+X12+X13+X14≤200
X21+X22+X23+X24≤200
X31+X32+X33+X34≤200
X11+X21+X31≥70
X11+X21+X31≤130
X12+X22+X32=170
X13+X23+X33=100
X14+X24+X34=150Min 9X11+14X12+12X13+17X14+11X21+10X22+6X23+10X24+12X31+8X32+15X33+7X34
ST
X11+X12+X13+X14≤200
X21+X22+X23+X24≤200
X31+X32+X33+X34≤200
X11+X21+X31≥70
X11+X21+X31≤130
X12+X22+X32=170
X13+X23+X33=100
X14+X24+X34=150
END
LINDO:
OBJECTIVE FUNCTION VALUE
1) 4600.000
VARIABLE VALUE REDUCED COST
X11 70.000000 0.000000
X12 30.000000 0.000000
X13 100.000000 0.000000
X14 0.000000 0.000000
X21 0.000000 0.000000
X22 90.000000 0.000000
X23 0.000000 0.000000
X24 0.000000 0.000000
X31 0.000000 0.000000
X32 50.000000 0.000000
X33 0.000000 0.000000
X34 150.000000 0.000000
ROW SLACK OR SURPLUS DUAL PRICES
2) 0.000000 -1.000000
3) 110.000000 -1.000000
4) 0.000000 -1.000000
5) 0.000000 2.000000
6) 60.000000 -1.000000
7) 0.000000 1.000000
8) 0.000000 1.000000
9) 0.000000 1.000000
NO. ITERATIONS= 3
RANGES IN WHICH THE BASIS IS UNCHANGED:
OBJ COEFFICIENT RANGES
VARIABLE CURRENT ALLOWABLE ALLOWABLE
COEF INCREASE DECREASE
X11 9.000000 6.000000 INFINITY
X12 14.000000 4.000000 0.000000
X13 12.000000 0.000000 INFINITY
X14 17.000000 INFINITY 4.000000
X21 11.000000 INFINITY 6.000000
X22 10.000000 0.000000 INFINITY
X23 6.000000 INFINITY 0.000000
X24 10.000000 INFINITY 1.000000
X31 12.000000 INFINITY 9.000000
X32 8.000000 9.000000 1.000000
X33 15.000000 INFINITY 9.000000
X34 7.000000 1.000000 INFINITY
RIGHTHAND SIDE RANGES
ROW CURRENT ALLOWABLE ALLOWABLE
RHS INCREASE DECREASE
2 200.000000 0.000000 0.000000
3 200.000000 0.000000 0.000000
4 200.000000 0.000000 0.000000
5 70.000000 0.000000 0.000000
6 130.000000 0.000000 0.000000
7 170.000000 0.000000 0.000000
8 100.000000 0.000000 0.000000
9 150.000000 0.000000 0.000000
No hay comentarios:
Publicar un comentario