> I am using GLPK to solve mixed linear integer programing problem for a > large problem, > I am wodering what is the maximum size that the solver can handle? >
There is no artificial limit. However, if your problem is hard (for example, many combinatorial problems are hard), even a small-sized instance may require too much time to be solved to optimality. Please see mip benchmarks included in glpk distribution (subdirectory doc). _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
