一、LP_求运量
MODEL
sets:
demand/1..6/:a,b,d;
supply/1..2/:x,y,e;
link(demand,supply):c;
endsets
data:
!需求
a=1.25,8.75,0.5,5.75,3,7.25;
b=1.25,0.75,4.75,5,6.5,7.75;
!供需量
d=3,5,4,7,6,11;
e=20,20;
x,y=5,1,2,7;
enddata
init:
!初始点
endinit
!目标
[OBJ]min=@sum(link(i,j):c(i,j)*((x(j)-a(i))^2+(y(i)-b(i))^2)^(1/2));
!需求约束
@for(demand(i):[DEMAND_CON]@sum(supply(j):c(i,j))=d(i););
!供应约束
@for(supply(i):SUPPLY_CON@sum(demand(j):c(j,i))<=e(i););
@for(supply:@bnd(0.5,x,8.05);@bnd(0.75,y,7.75);)
END
【错误一】model:
记住敲 “ : ”
Global optimal solution found.
Objective value: 136.2275
Infeasibilities: 0.000000
Total solver iterations: 1
Elapsed runtime seconds: 0.14
Model Class: LP
Total variables: 12
Nonlinear variables: 0
Integer variables: 0
Total constraints: 9
Nonlinear constraints: 0
Total nonzeros: 36
Nonlinear nonzeros: 0
Variable Value Reduced Cost
A( 1) 1.250000 0.000000
A( 2) 8.750000 0.000000
A( 3) 0.5000000 0.000000
A( 4) 5.750000 0.000000
A( 5) 3.000000 0.000000
A( 6) 7.250000 0.000000
B( 1) 1.250000 0.000000
B( 2) 0.7500000 0.000000
B( 3) 4.750000 0.000000
B( 4) 5.000000 0.000000
B( 5) 6.500000 0.000000
B( 6) 7.750000 0.000000
D( 1) 3.000000 0.000000
D( 2) 5.000000 0.000000
D( 3) 4.000000 0.000000
D( 4) 7.000000 0.000000
D( 5) 6.000000 0.000000
D( 6) 11.00000 0.000000
X( 1) 5.000000 0.000000
X( 2) 2.000000 0.000000
Y( 1) 1.000000 0.000000
Y( 2) 7.000000 0.000000
E( 1) 20.00000 0.000000
E( 2) 20.00000 0.000000
C( 1, 1) 3.000000 0.000000
C( 1, 2) 0.000000 3.852207
C( 2, 1) 5.000000 0.000000
C( 2, 2) 0.000000 7.252685
C( 3, 1) 0.000000 1.341700
C( 3, 2) 4.000000 0.000000
C( 4, 1) 7.000000 0.000000
C( 4, 2) 0.000000 1.992119
C( 5, 1) 0.000000 2.922492
C( 5, 2) 6.000000 0.000000
C( 6, 1) 1.000000 0.000000
C( 6, 2) 10.00000 0.000000
Row Slack or Surplus Dual Price
1 136.2275 -1.000000
DEMAND_CON( 1) 0.000000 -3.758324
DEMAND_CON( 2) 0.000000 -3.758324
DEMAND_CON( 3) 0.000000 -4.515987
DEMAND_CON( 4) 0.000000 -4.069705
DEMAND_CON( 5) 0.000000 -2.929858
DEMAND_CON( 6) 0.000000 -7.115125
SUPPLY_CON( 1) 4.000000 0.000000
SUPPLY_CON( 2) 0.000000 1.811824
二、NLP_选址
model
sets:
demand/1..6/:a,b,d;
supply/1..2/:x,y,e;
link(demand,supply):c;
endsets
data:
a=1.25,8.75,0.5,5.75,3,7.25;
b=1.25,0.75,4.75,5,6.5,7.75;
d=3,5,4,7,6,11;
e=20,20;
enddata
init
endinit
[OBJ]min=@sum(link(i,j):c(i,j)*((x(j)-a(i))^2+(y(i)-b(i))^2)^(1/2));
!需求约束
@for(demand(i):[DEMAND_CON]@sum(supply(j):c(i,j))=d(i););
!供应约束
@for(supply(i):SUPPLY_CON@sum(demand(j):c(j,i))<=e(i););
@for(supply:@bnd(0.5,X,8.75);@bnd(0.75,Y,7.75);)
end