Hello, I'm trying to solve a series of LP problems, the former solution is a feasible and suboptimal solution to the latter one, so in each time, start optimization problem from a suboptimal solution sounds to be faster than from zeros. So does anyone know about it please share me the way. Thank you very much!
_______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
