理学院信息与计算科学运筹学课程设计
x11 x12 x13 x14 35, x x x x 50,
222324 21
x31 x32 x33 x34 40,
x11 x21 x31 45,s.t
x x x 20,2232 12
x13 x23 x33 30,
x14 x24 x34 30,
x 0,i 1,2,3,j 1,2,3,4. ij
将上述模型转化成LINGO代码，如下所示:
MODEL: SETS:
PLANTS/P1,P2,P3/:CAP; CITIES/C,C2,C3,C4/:DEM;
LINKS(PLANTS,CITIES):COST,SHIP; ENDSETS
MIN=@SUM(LINKS:COST*SHIP);
@FOR(CITIES(J):@SUM(PLANTS(I):SHIP(I,J))>DEM(J)); @FOR(PLANTS(I):@SUM(CITIES(J):SHIP(I,J))<CAP(I));
DATA:
CAP=35,50,40; DEM=45,20,30,30;
COST=8,6,10,9,9,12,13,7,14,9,16,5; ENDDATA END
输出结果：
Global optimal solution found.
Objective value: 1020.000