"On entry to this routine the problem object must
contain an optimal basic solution for LP relaxation,
which can be obtained by means of the simplex-based
solver..."
I am not sure I understand it. OK, I first solve the
simplex problem asuming the variables are real and
then pass the solution through the LPX pointer to
lpx_integer. I was wondering why there is this
intermediate step why the function could not do it for
me in one sweep. Unless I misunderstood something.
Is there any example anywhere with the C code solving
a simple MIP problem?
Thanks,
Michael Jastrzebski
Oakland, CA
_______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
