数学建模中的整规划问题(2)

X39 0.000000 150.0000 X44 0.000000 200.0000 X45 0.000000 150.0000 X46 0.000000 80.00000 X47 0.000000 0.000000 X48 50000.00 0.000000 X55 0.000000 200.0000 X56 0.000000 180.0000 X58 10000.00 0.000000 X59 20000.00 0.000000 X66 40000.00 0.000000 X67 0.000000 0.000000 X68 0.000000 0.000000 X69 0.000000 0.000000 X15 0.000000 0.000000 X18 0.000000 0.000000

Row Slack or Surplus Dual Price 1 0.2460000E+08 -1.000000 2 55000.00 0.000000 3 80000.00 0.000000 4 25000.00 0.000000 5 0.000000 70.00000 6 70000.00 0.000000 7 0.000000 30.00000 8 0.000000 50.00000 9 0.000000 100.0000 10 0.000000 50.00000 11 0.000000 50.00000 12 0.000000 -100.0000

13 0.000000 -200.0000 14 0.000000 -70.00000 15 0.000000 -200.0000 16 0.000000 -150.0000 17 0.000000 -200.0000 18 0.000000 -100.0000

(B)

假设B2不扩建：

min=50*X10+50*X11+100*X12+20*X13+60*X14+40*X15+100*X16+150*X18+200*X19+100*X111+30*X21+50*X22+20*X23+40*X24+30*X25+200*X26+150*X37+50*X38+150*X39+100*X311+100*X46+50*X47+50*X48+100*X49+50*X410+150*X57+200*X58+50*X510+150*X511+20*X68+150*X69+50*X610+150*X611+120*X76+60*X77+40*X78+30*X710+80*X711+40*X87+50*X89+60*X810+90*X811+100000*(B3-1)+50000*(B4-1)+1200000*B5+400000*B6;

x10+x11+x12+x13+x14+x15+x16+x17+x18+x19+x110+x111<150000; x21+x22+x23+x24+x25+x26<200000; x10<70000; x11+x21<50000; x12+x22<100000; x13+x23<40000; x14+x24<30000; x15+x25<25000;

x37+x38+x39+x311

x46+x47+x48+x49+x410

x76+x77+x78+x710+x711

x16>50000; x37>10000;

x18+x38+x48+x58+x68+x78>40000; x19+x39+x49+x69+x89>35000; x410>50000; x511+x611>20000;

x510+x610+x710+x810>10000;

B1+B2+B3+B4+B5+B6<4; X10<400000*B1; X11<400000*B2; X21<400000*B2; X12<400000*B3; X22<400000*B3; X13<400000*B4; X23<400000*B4; X14<400000*B5; X24<400000*B5; X15<400000*B6; X25<400000*B6; X37<400000*B1; X38<400000*B1; X39<400000*B1; X311<400000*B1; X46<400000*B2; X47<400000*B2; X48<400000*B2;

X49<400000*B2; X410<400000*B2; X57<400000*B3; X58<400000*B3; X510<400000*B3; X511<400000*B3; X68<400000*B4; X69<400000*B4; X610<400000*B4; X611<400000*B4; X76<400000*B5; X77<400000*B5; X78<400000*B5; X710<400000*B5; X711<400000*B5; X87<400000*B6; X89<400000*B6; X810<400000*B6; X811<400000*B6;

@bin(B1); @bin(B2); @bin(B3); @bin(B4); @bin(B5); @bin(B6);

Global optimal solution found at iteration: 106 Objective value: 0.2280000E+08

Variable Value Reduced Cost X10 40000.00 0.000000 X11 0.000000 20.00000 X12 0.000000 50.00000 X13 40000.00 0.000000 X14 0.000000 0.000000 X15 0.000000 10.00000 X16 50000.00 0.000000 X18 0.000000 50.00000 X19 10000.00 0.000000 X111 0.000000 100.0000 X21 50000.00 0.000000 X22 0.000000 0.000000 X23 0.000000 0.000000 X24 0.000000 0.000000 X25 25000.00 0.000000 X26 0.000000 200.0000 X37 10000.00 0.000000 X38 30000.00 0.000000 X39 0.000000 0.000000 X311 0.000000 150.0000 X46 0.000000 200.0000 X47 0.000000 150.0000 X48 0.000000 50.00000 X49 0.000000 0.000000 X410 50000.00 0.000000 X57 0.000000 200.0000 X58 0.000000 150.0000 X510 0.000000 0.000000