Hi, Thanks for GLPK
I use GLPK API Routines and my question is : If GLPK has an integer feasible solution of the minimization problem, how can I access to these MIP non-optimal solutions if I am stopping the resolution of the problem? In the same way , if I want the lower bound (dual bound). Thanks in advance and excuse me for my English, Cedric -- View this message in context: http://www.nabble.com/Obtain-bounds-in-MIP-solver-tf3530829.html#a9853510 Sent from the Gnu - GLPK - Help mailing list archive at Nabble.com. _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
