MODEL:
MAX=-X1*X1-X2;
X1*X1+X2*X2<9;
X1+X2<1;
@FREE(X1);
@FREE(X2);
END
这个是上个题目的lingo模型解法!
Local optimal solution found at iteration: 13
Objective value: 3.000000
Variable Value Reduced Cost
X1 -0.2636344E-07 0.000000
X2 -3.000000 0.000000
Row Slack or Surplus Dual Price
1 3.000000 1.000000
2 0.000000 0.1666667
3 4.000000 0.000000
这个是report