Hello Andrew,
the modified patch works fine with my examples.
I guess the coding after
#if 0 /* modified by xypron xypron.g...@gmx.de */
up to
#else
should be removed from the coding as the coding is incorrect for dir ==
GLP_MAX.
Best regards
Xypron
Andrew Makhorin wrote:
Hi Xypron,
the modified patch works fine with my examples.
Thanks.
I guess the coding after
#if 0 /* modified by xypron xypron.g...@gmx.de */
up to
#else
should be removed from the coding as the coding is incorrect for dir ==
GLP_MAX.
Why incorrect? It is another heuristic to choose bnd; probably
Hi Xypron,
please, find appended a patch that resolves the following issues:
* The feasibility pump sets a heuristic solution where the
non integers are not set to optimal values with respect to
the original objective function.
* When the feasibility pump reaches a new integral
Hi Xypron,
please, find appended a patch that resolves the following issues:
* The feasibility pump sets a heuristic solution where the
non integers are not set to optimal values with respect to
the original objective function.
* When the feasibility pump reaches a new integral
Hello Andrew,
please, find appended a patch that resolves the following issues:
* The feasibility pump sets a heuristic solution where the
non integers are not set to optimal values with respect to
the original objective function.
* When the feasibility pump reaches a new integral solution,
Andrew Makhorin wrote:
I would not have expected a MIP solution to yield an noninteger
objective for this model.
'incommon' is declared as continuous:
var incommon {i in teams, j in teams: i j}, =0, =1;
so I do not see a problem. Why do you think that all components of
'incommon'
Hi Xypron,
I have solved the model below with
glpsol.exe --fpump -m test.mod --tmlim 30
(derived from
http://lists.gnu.org/archive/html/help-glpk/2009-09/msg00015.html
http://lists.gnu.org/archive/html/help-glpk/2009-09/msg00015.html
)
The output was
+ 1763: mip = 1.04149e+002 =
I guess what is missing either in function glp_ios_heur_sol() or in
ios_feas_pump() is to
solve the original problem with the integer values found.
Ios_feas_pump provides a complete mip solution.
I would prefer glp_ios_heur_sol to call glp_simplex. This would allow to
check the feasibility
Hello Andrew
Andrew Makhorin wrote:
Ios_feas_pump provides a complete mip solution.
The solution is feasible.
My expectation is that the feasibility pump should provide a result that is
LP optimal if I fix the
integer values provided by the feasibility pump.
Best regards
Xypron
--
View
Hello Andrew,
I guess what is missing either in function glp_ios_heur_sol() or in
ios_feas_pump() is to
solve the original problem with the integer values found.
I would prefer glp_ios_heur_sol to call glp_simplex. This would allow to
check the feasibility
of the heuristic solution and to
Hello Andrew,
I have solved the model below with
glpsol.exe --fpump -m test.mod --tmlim 30
(derived from
http://lists.gnu.org/archive/html/help-glpk/2009-09/msg00015.html
http://lists.gnu.org/archive/html/help-glpk/2009-09/msg00015.html
)
The output was
+ 1763: mip = 1.04149e+002 =
11 matches
Mail list logo
