> I need to find out wheter a MIP is solveable, unsolveable or unbound. Is > there a way to do that? The lpx_mip_status function doesn`t return UNBND in > any way. Or did I get something wrong here? I'm using GLPK 4.8 with VC.NET.
If lp relaxation of an mip instance is unbounded and the instance has at least one integer feasible solution, it is also unbounded. However, this cannot happen in the glpk mip solver, since it requires an optimal basis of lp relaxation to start the search. _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
