运筹学运输问题案例研究.pptVIP

运筹学运输问题案例分析

韩恺张好雨

B11400

6

3

7B21800

110000

P1

1300

A1B3

81900

4

210000

P29B42900

600A2

5B5

102300

9000P3

11

B62200

12

B72700

〔1〕用线性规划的方法

•如上如所示，给各个地点编号，即i=1,2，……，

12分别表示十二个地点

•设xij表示从i到j的运量

•问题的目标函数为

minf=4.5x13+4.0x14+5.2x24+5.4x25+3.2x36+3.0x37+

4.3x38+3.6x39+3.6x46+4.1x47+3.3x48+3.5x49+3.2x410

+4.2x411+3.4x412+3.4x58+4.3x59+3.5x510+4.2x511+3.1

x512

•再更具其他约束条件，写出所有的约束等式不等

式，得到线性规划模型：

minf=4.5x13+4.0x14+5.2x24+5.4x25+3.2x36+3.0x37+4.3x38+3.6

x39+3.6x46+4.1x47+3.3x48+3.5x49+3.2x410+4.2x411+3.4x412+

3.4x58+4.3x59+3.5x510+4.2x511+3.1x512

x13+x14=13000

x24+x25=6000

x13-x36-x37-x38-x39=0

x14+x24-x46-x47-x48-x49-x410-x411-x412=0

x25-x58-x59-x510-x511-x512=0

x36+x37+x38+x39=10000

x46+x47+x48+x49+x410+x411+x412=10000

x58+x59+x510+x511+x512=9000

x36+x46=1400

x37+x47=1800

x38+x48+x58=1900

x39+x49+x59=2900

x410+x510=2300