[原创][求助]关于LINGO程序的一个问题
<p>min=16+x21*16+x22*6+x31*17+x21*x32*6+x22*x32*8+x41*17+x31*x42*6+x21*x32*x42*8<br/>+x22*x32*x42*11+x51*18+x41*x52*6+x31*x42*x52*8+x21*x32*x42*x52*11+x22*x32*x42*x52*18;<br/>x21+x22=1;<br/>x31+x32=1;<br/>x41+x42=1;<br/>x51+x52=1;<br/>end<br/>@bin(8)</p><p>这程序运行后 得到Objective value: 59.00000</p><p> <br/> Variable Value Reduced Cost<br/> X21 0.000000 5.000000<br/> X22 1.000000 0.000000<br/> X31 0.000000 4.000000<br/> X32 1.000000 0.000000<br/> X41 0.000000 6.000000<br/> X42 1.000000 0.000000<br/> X51 1.000000 0.000000<br/> X52 0.000000 0.000000<br/>然而明显的有当:</p><p>X21=0; <br/>X22=1;</p><p>X31=1; </p><p>X32 =0; </p><p> X41 =0 ; </p><p> X42 = 1 ; </p><p> X51 = 0 ; </p><p>X52 = 1 ; </p><p>最小值为53 </p><p>我用的是LINGO8.0版本的 不知道出了什么问题? <br/></p><p> </p><p></p><p></p><p></p> <p>采用lingo10计算的结果是你所需要的!但是系统明显提示所求得的是局部最优解,所以能否求得全局最优解要看程序使用的算法,并不是lingo系统的问题!</p><p>Local optimal solution found.<br/> Objective value: 53.00000<br/> Total solver iterations: 11</p><p><br/> Variable Value Reduced Cost<br/> X21 0.000000 8.000000<br/> X22 1.000000 0.000000<br/> X31 0.000000 9.000000<br/> X32 1.000000 0.000000<br/> X41 1.000000 0.000000<br/> X42 0.000000 6.000000<br/> X51 0.000000 12.00000<br/> X52 1.000000 0.000000</p><p> Row Slack or Surplus Dual Price<br/> 1 53.00000 -1.000000<br/> 2 0.000000 -14.00000<br/> 3 0.000000 -8.000000<br/> 4 0.000000 -23.00000<br/> 5 0.000000 -6.000000</p><p></p> <p>我也有同样的疑惑,为什么有时求得的解反代回去,目标值明显不一样?</p><p>另楼上的可否提供10.0的注册码?</p><p> 以下是用LINGO 9求得的解。 </p><p> 1)让系统自动选择优化;</p><p> Local optimal solution found.<br/> Objective value: 57.00000<br/> Total solver iterations: 5</p><p><br/> Variable Value Reduced Cost<br/> X21 1.000000 0.000000<br/> X22 0.000000 2.000000<br/> X31 0.000000 6.000000<br/> X32 1.000000 0.000000<br/> X41 0.000000 4.000000<br/> X42 1.000000 0.000000<br/> X51 0.000000 7.000000<br/> X52 1.000000 0.000000</p><p> Row Slack or Surplus Dual Price<br/> 1 57.00000 -1.000000<br/> 2 0.000000 -41.00000<br/> 3 0.000000 -25.00000<br/> 4 0.000000 -19.00000<br/> 5 0.000000 -11.00000</p><p></p><p> 2)采用全局最优解方法求得的: </p><p> Global optimal solution found.<br/> Objective value: 53.00000<br/> Extended solver steps: 17<br/> Total solver iterations: 3040</p><p><br/> Variable Value Reduced Cost<br/> X21 0.000000 8.000000<br/> X22 1.000000 0.000000<br/> X31 0.000000 9.000000<br/> X32 1.000000 0.000000<br/> X41 1.000000 0.000000<br/> X42 0.000000 6.000000<br/> X51 0.000000 12.00000<br/> X52 1.000000 0.000000</p><p> Row Slack or Surplus Dual Price<br/> 1 53.00000 -1.000000<br/> 2 0.000000 -14.00000<br/> 3 0.000000 -8.000000<br/> 4 0.000000 -23.00000<br/> 5 0.000000 -6.000000</p><p></p>[此贴子已经被作者于2007-7-26 14:44:14编辑过] lingo10,.0的破解补丁下不到 让我用11版帮你算吧。
Global optimal solution found.
Objective value: 53.00000
Objective bound: 53.00000
Infeasibilities: 0.000000
Extended solver steps: 17
Total solver iterations: 2833
Variable Value Reduced Cost
X21 0.000000 8.000000
X22 1.000000 0.000000
X31 0.000000 9.000000
X32 1.000000 0.000000
X41 1.000000 0.000000
X42 0.000000 6.000000
X51 0.000000 12.00000
X52 1.000000 0.000000
Row Slack or Surplus Dual Price
1 53.00000 -1.000000
2 0.000000 -14.00000
3 0.000000 -8.000000
4 0.000000 -23.00000
5 0.000000 -6.000000 我用 lingo9.0求的解和3楼的一样 ,各个版本结果相差很大,那到底该用哪一版本的呢?疑惑
Local optimal solution found.
Objective value: 57.00000
Total solver iterations: 5
Variable Value Reduced Cost
X21 1.000000 0.000000
X22 0.000000 2.000000
X31 0.000000 6.000000
X32 1.000000 0.000000
X41 0.000000 4.000000
X42 1.000000 0.000000
X51 0.000000 7.000000
X52 1.000000 0.000000
Row Slack or Surplus Dual Price
1 57.00000 -1.000000
2 0.000000 -41.00000
3 0.000000 -25.00000
4 0.000000 -19.00000
5 0.000000 -11.00000 当然是版本较高的比较好吧
页:
[1]