优化问题中的数学规划模型 (4)

x1+x2+y4+y5>8 x1+x2+y5>8 y1+y2+y3+y4+y5<3 end gin 7

【实例2】Lindo程序如下：

max 200u1+200u2+140v1+140v2 st

400xa1+200xb1-u1-v1=0 400xa2+200xb2-u2-v2=0 xa1+ya1+za1=2100 xb1+yb1+zb1-xa1-ya1=890 xa2+ya2+za2-za1=130 xb2+yb2+zb2-zb1-xa2-ya2=15 400xa1<60000 400xa2<60000 200xb1<35000 200xb2<35000 za1>1200 za1<2000 za2>1200 za2<2000

zb1>800 zb1<1500 zb2>800 zb2<1500 u1<50000 u2<50000 end gin 16

5.2 Lingo软件求解

范围：一般数学规划问题。

特点：使用范围广但编程比Lindo复杂。 演示实例： 【实例3】

model: Sets:

Members/1..4/:TSingle;!每个同学面试结束时间; Items/1..3/:;

Times(Members,Items):c,t; Links(Members,Members):r; endsets

min=@max(Members(i):TSingle(i));

@for(Members(i):TSingle(i)=t(i,3)+c(i,3));

@for(Members(i):@for(Items(j)|j#le#2:t(i,j)+c(i,j)<=t(i,j+1)));

@for(Members(k):@for(Members(i)|i#lt#k:@for(Items(j):t(i,j)+c(i,j)-t(k,j)<=@max(Members(l):TSingle(l))*r(i,k))));

@for(Members(k):@for(Members(i)|i#le#k:@for(Items(j):t(k,j)+c(

k,j)-t(i,j)<=@max(Members(l):TSingle(l))*(1-r(i,k))))); @for(Members(i):TSingle(i)>=0);

@for(Members(i):@for(Items(j):t(i,j)>=0)); @for(Members(i):@for(Members(j):@bin(r(i,j)))); data:

c=13 15 20 10 20 18 20 16 10 8 10 15; enddata end