-------- Forwarded Message -------- From: John Doe <[email protected]> To: [email protected] Subject: Initial Basis Date: Sun, 27 Mar 2011 17:06:11 -0700 (PDT)
Hi glpk team, Suppose I solve a linear programming problem with the simplex algorithm, then change a row of coefficients. I then change the previously found optimal basis slightly or not at all (by one or zero variables -- both cases are relevant here) so that the new basis is primal feasible. Given how little I changed from the first problem, it seems that I should be able to solve a second one without having to restart from scratch. Is this possible? Thanks guys. _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
