On Sun, 6 Aug 2017, Andrew Makhorin wrote:
On Sun, 2017-08-06 at 12:13 +0300, Andrew Makhorin wrote:
Interesting to note that exactly the same picture (cycling on two bases
near the optimum on solving LP with MPSX/370) is described in the paper:
W.Ogryczak, On practical stopping rules for the simplex method,
Math.Prog.Study 31 (1987), pp.167-174.
BTW, this article is freely available at:
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.703.6576&rep=rep1&type=pdf
I get a zero-byte document.
--
Michael [email protected]
"Sorry but your password must contain an uppercase letter, a number,
a haiku, a gang sign, a heiroglyph, and the blood of a virgin."
-- someeecards
_______________________________________________
Help-glpk mailing list
[email protected]
https://lists.gnu.org/mailman/listinfo/help-glpk
