[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Help-glpk] [Fwd: Initial Basis]

From: Andrew Makhorin
Subject: [Help-glpk] [Fwd: Initial Basis]
Date: Mon, 28 Mar 2011 04:14:07 +0400

-------- Forwarded Message --------
From: John Doe <address@hidden>
To: address@hidden
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.

reply via email to

[Prev in Thread] Current Thread [Next in Thread]