LINGO整数规划多解情况疑惑我用的LINGO11,程序代码如下:MAX 800X1+400X2+500X3SUBJEC
1个回答

这个问题的解为:

Global optimal solution found.

Objective value: 162400.0

Infeasibilities: 0.000000

Total solver iterations: 2

Model Class: LP

Total variables: 3

Nonlinear variables: 0

Integer variables: 0

Total constraints: 4

Nonlinear constraints: 0

Total nonzeros: 12

Nonlinear nonzeros: 0

Variable Value Reduced Cost

X1 94.00000 0.000000

X2 218.0000 0.000000

X3 0.000000 0.000000

Row Slack or Surplus Dual Price

1 162400.0 1.000000

2 0.000000 100.0000

3 62.40000 0.000000

4 0.000000 200.0000

这是全局最优解,也就是说不存在多个解的情况.