用LINGO求A到E的最短路动态规划模型model:sets: cities/A,B1,B2,B3,C1,C2,C3,D1,D2,E/:F;roads(cities,cities)/A,B1 A,B2 A,B3 B1,C1 B1,C2 B1,C3 B2,C1 B2,C2 B2,C3 B3,C1B3,C2 B3,C3 C1,D1 C1,D2 C2,D1 C2,D2 C3,D1 C3,D2 D1,ED2,E/:D, P;endsetsdata:D=20,60,30,70,40,60,30,20,10,40,20,50,10,40,60,30,30,30,30,40;enddatan=size (cities);F(n)=0;for(cities(i) | i#lt# n:F(i)= min (roads(i,j): D(i,j)+F(j););for(roads(i,j):P(i,j尸 if(F(i) #eq# D(i,j)+F(j),1,0);end