实验Lingo求解最短路最小树问题.pptxVIP

实验Lingo求解最短路最小树问题;实验１、用Lingo求解最短路、 最小树问题;第3页/共17页;第4页/共17页;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; ;;;;model: sets: city /1..7/:u; link(city,city):dist,x; endsets n=@size(city); data: dist=0 3 4 7 100 100 10