最大流、最小费用最大流、最小生成树lingo

最小生成树

model:
sets:
city/1..7/:u;
links(city,city):dist,x;
endsets
data:
!dist是距离矩阵;
dist=0 3 4 7 100 100 100
     3 0 3 2 4 100 100
     4 3 0 100 5 7 100
     7 2 100 0 2 100 6
     100 4 5 2 0 1 4
     100 100 7 100 1 0 2
     100 100 100 6 4 2 0; 
enddata
!目标函数最小生成树;
min=@sum(links:dist*x);
@for(links:@bin(x));
n=@size(city);
@for(links(i,j)|i#eq#j:x(i,j)=0);
!生成树的必要条件;
@