实验4Lingo求解最短路最小树问题讲述.ppt

实验１、用Lingo求解最短路、 最小树问题 sets: cities/A, B1, B2, C1, C2, C3, D/; roads(cities, cities)/ A,B1 A,B2 B1,C1 B1,C2 B1,C3 B2,C1 B2,C2 B2,C3 C1,D C2,D C3,D/: w, x; endsets data: w = 2 4 3 3 1 2 3 1 1 3 4; enddata n=@size(cities); min=@sum(roads: w*x); @for(cities(i) | i #ne# 1 #and# i #ne# n: @sum(roads(i,j): x(i,j)) = @sum(roads(j,i): x(j,i))); @sum(roads(i,j)|i #eq# 1 : x(i,j))=1; v6 v3 v4 v2 v5 v1 例1-2 假设某电力公司在7个村庄之间架设电线， 各村庄之间的距离如下图所示，试求出使电线总长度最小的架线方案。 model: sets: city /1..7/:u; link(city,city):dist,x; endsets n=@siz