运筹学优化建摸.pptVIP

运筹帷幄之中;线性规划;线性规划模型〔1〕;项目;线性规划模型;项目;目标函数;初试LINDO;：MAX2X1+3X2

?ST;线性规划模型〔3〕;线性规划模型〔2〕;线性规划模型〔2〕;Ⅰ;目标函数;:min2800x11+2800x21+2800x31+2800x41+4500x12

+4500x22+4500x32+6000x13+6000x23+7300x14

?st

?x11+x12+x13+x1415

?x12+x13+x14+x21+x22+x2310

?x13+x14+x22+x23+x31+x3220

?x14+x23+x32+x4112

?end

:go;LPOPTIMUMFOUNDATSTEP3

OBJECTIVEFUNCTIONVALUE

1)118400.0

VARIABLEVALUEREDUCEDCOST

X113.0000000.000000

X210.0000002800.000000

X318.0000000.000000

X410.0000001100.000000

X120.0000001700.000000

X220.0000001700.000000

X320.0000000.000000

X130.000000400.000000

X230.0000001500.000000

X1412.0000000.000000;整数规划;例2.0.1某厂拟用集装箱托运甲乙两种货物,每箱的体积、

重量、可获利润以及托运所受限制见表2.1.问每集装箱中

两种货物各装多少箱,可使所获利润最大?;表2.1;求解整数规划;例3求解0-1整数规划;:max3x1-2x2+5x3

?st

?x1+2x2-x32

?x1+4x2+x34

?x1+x23

?4x2+x36

?end

:intx1

:intx2

:intx3

:go;LPOPTIMUMFOUNDATSTEP2

OBJECTIVEVALUE=8NEWINTEGERSOLUTIONOF8ATBRANCH0PIVOT2

RE-INSTALLINGBESTSOLUTION...

OBJECTIVEFUNCTIONVALUE

1)8.000000

VARIABLEVALUEREDUCEDCOST

X11.000000-3.000000

X20.0000002.000000

X31.000000-5.000000

ROWSLACKORSURPLUSDUALPRICES

2)2.0000000.000000

3)2.0000000.000000

4)2.0000000.000000

5)5.0000000.000000;例4求解0-1整数规划;:min3x1+7x2-x3+x4

?st

?2x1-x2+x3-x41

?x1-x2+6x3+4x48

?5x1+3x2+x45

?end

:int4

:go;LPOPTIMUMFOUNDATSTEP