|
|
【答案】应助回帖
感谢参与,应助指数 +1
LINGO源程序:
MODEL:
SETS:
PERSON/1..4/;
TASK/1..4/;
ASSIGN(PERSON, TASK):A, X;
ENDSETS
DATA:
A = @FILE("DATA.ldt" ;
ENDDATA
MIN = @SUM(ASSIGN: A*X);
@FOR(PERSON(I): @SUM(TASK(J): X(I,J)) = 1);
@FOR(TASK(J): @SUM(PERSON(I): X(I,J)) = 1);
@FOR(ASSIGN(I, J): @BIN(X(I,J)));
END
data.ldt文件:
1100, 800, 1000, 700,
600, 500, 300, 800,
400, 800, 1000, 900,
1100, 1000, 500, 700~
求解结果(Nonzeros Only):
Global optimal solution found.
Objective value: 2100.00000000
Objective bound: 2100.00000000
Infeasibilities: 0.00000000000
Extended solver steps: 0
Total solver iterations: 0
Elapsed runtime seconds: 0.04
Variable Value Reduced Cost
X( 1, 4) 1.00000000000 700.000000000
X( 2, 2) 1.00000000000 500.000000000
X( 3, 1) 1.00000000000 400.000000000
X( 4, 3) 1.00000000000 500.000000000 |
|