Thank you for your answer,
On Thu, 19 Jan 2006, Andrew Makhorin wrote:
This feature will be implemented in a next release.
Sounds great!
The lower bound obtained from a relaxation is only a bound. Its value
may depend, for example, on transformations performed by presolver or
on cutting
The lower bound obtained from a relaxation is only a bound. Its value
may depend, for example, on transformations performed by presolver or
on cutting planes added to the relaxation. So it does not express any
essential information.
I agree with you, but when using cplex I use it as an
Very nice work on the new MIP solver, Andrew!
I have some requests though:
* I'd like to optionally specify an initial bound for the BB.
* I'd like to optionally see the real valued bound for the BB for a MIP
with integer objective function.
* For some applications I have, it is useful to
- Forwarded message begin -
From: Andrew Makhorin [EMAIL PROTECTED]
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
GLPK 4.9 -- Release Information
===
Release date: Jan 17, 2006
GLPK (GNU Linear Programming Kit) is intended for solving large-scale
linear
I have some requests though:
* I'd like to optionally specify an initial bound for the BB.
This feature will be implemented in a next release.
* I'd like to optionally see the real valued bound for the BB for a MIP
with integer objective function.
The lower bound obtained from a
