75b927a2fe
Changes:
4.65
----
- The following new API routines for LP/MIP preprocessing were
added:
glp_npp_alloc_wksp allocate the preprocessor workspace
glp_npp_load_prob load original problem instance
glp_npp_preprocess1 perform basic LP/MIP preprocessing
glp_npp_build_prob build resultant problem instance
glp_npp_postprocess postprocess solution to resultant problem
glp_npp_obtain_sol obtain solution to original problem
glp_npp_free_wksp free the preprocessor workspace
See doc/npp.txt for detailed description of these API routines.
- A new, more robust implementation of locally valid simple cover
cuts was included in the MIP solver.
- The API routine glp_init_iocp was changed to enable long-step
option of the dual simplex by default.
4.64
----
- The dual simplex solver routine was changed to perform more
aggressive perturbation to prevent dual degeneracy and avoid
stalling even if the current dual basic solution is strongly
feasible (mainly if the objective is zero). Thanks to David
Monniaux <David.Monniaux@univ-grenoble-alpes.fr> for bug report
and example model.
- The exact simplex solver routine was changed to perform
terminal output according to the verbosity level (specified by
the control parameter smcp.msg_lev). Thanks to Jeroen Demeyer
<jdemeyer@cage.ugent.be> for bug report.
- A minor bug (related to MS Windows version) was fixed. Thanks
to Heinrich Schuchardt <xypron.glpk@gmx.de> for bug report.
- An example model (Graceful Tree Labeling Problem) in MathProg
was added. Thanks to Mike Appleby <mike@app.leby.org> for
contribution.
- Three example models (Power plant LP scheduler, Neumann CA
grid emulator generator) in MathProg and one in Cplex LP format
were added. Thanks to Peter Naszvadi <vuk@cs.elte.hu> for
contribution.
Discussed with <adam>, thanks!
|
||
|---|---|---|
| .. | ||
| patches | ||
| buildlink3.mk | ||
| DESCR | ||
| distinfo | ||
| Makefile | ||
| PLIST | ||