Linear programming lp_求解中的戏剧性错误?
我有一个简单的问题,通过IDE(5.5.2.0)传递给lp_解决Linear programming lp_求解中的戏剧性错误?,linear-programming,solver,lpsolve,Linear Programming,Solver,Lpsolve,我有一个简单的问题,通过IDE(5.5.2.0)传递给lp_解决 /*目标函数*/ 最大值:+r1+r2; /*约束条件*/ R1:+R1+r2当我尝试它时,我得到3作为Obj函数的最佳值 Model name: 'LPSolver' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 3 constraints, 4 variables, 6 non-zeros. Sets:
/*目标函数*/
最大值:+r1+r2;
/*约束条件*/
R1:+R1+r2当我尝试它时,我得到3作为Obj函数的最佳值
Model name: 'LPSolver' - run #1
Objective: Maximize(R0)
SUBMITTED
Model size: 3 constraints, 4 variables, 6 non-zeros.
Sets: 0 GUB, 0 SOS.
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
Relaxed solution 4 after 4 iter is B&B base.
Feasible solution 2 after 6 iter, 3 nodes (gap 40.0%)
Optimal solution 2 after 7 iter, 4 nodes (gap 40.0%).
Excellent numeric accuracy ||*|| = 0
MEMO: lp_solve version 5.5.2.0 for 32 bit OS, with 64 bit REAL variables.
In the total iteration count 7, 1 (14.3%) were bound flips.
There were 2 refactorizations, 0 triggered by time and 0 by density.
... on average 3.0 major pivots per refactorization.
The largest [LUSOL v2.2.1.0] fact(B) had 8 NZ entries, 1.0x largest basis.
The maximum B&B level was 3, 0.8x MIP order, 3 at the optimal solution.
The constraint matrix inf-norm is 3, with a dynamic range of 3.
Time to load data was 0.001 seconds, presolve used 0.017 seconds,
... 0.007 seconds in simplex solver, in total 0.025 seconds.
我与关心lpsolve软件的开发小组有过联系。此错误将在下一版本的lpsolve中修复。您是否使用了windows IDE?是的,我使用了。lpsolve IDE v5.5.2.0Hmmm。。。好的,我明白了。IDE中“结果”下显示的是2作为解决方案。所以这是IDE的一个问题,不是吗?哦不。。。上面写着“国际热核聚变实验堆7号之后的最优解2”,所以结果是错误的!将比例模式更改为二次型,将得到正确的解决方案。。。所以lp_solve中肯定有错误!我可以证实这一点。当我在选项“透视”下选择“随机化”时,我得了3分。
Model name: 'LPSolver' - run #1
Objective: Maximize(R0)
SUBMITTED
Model size: 3 constraints, 4 variables, 6 non-zeros.
Sets: 0 GUB, 0 SOS.
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
Relaxed solution 4 after 4 iter is B&B base.
Feasible solution 2 after 6 iter, 3 nodes (gap 40.0%)
Optimal solution 2 after 7 iter, 4 nodes (gap 40.0%).
Excellent numeric accuracy ||*|| = 0
MEMO: lp_solve version 5.5.2.0 for 32 bit OS, with 64 bit REAL variables.
In the total iteration count 7, 1 (14.3%) were bound flips.
There were 2 refactorizations, 0 triggered by time and 0 by density.
... on average 3.0 major pivots per refactorization.
The largest [LUSOL v2.2.1.0] fact(B) had 8 NZ entries, 1.0x largest basis.
The maximum B&B level was 3, 0.8x MIP order, 3 at the optimal solution.
The constraint matrix inf-norm is 3, with a dynamic range of 3.
Time to load data was 0.001 seconds, presolve used 0.017 seconds,
... 0.007 seconds in simplex solver, in total 0.025 seconds.