Jump to content

Revised simplex method

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Kxx (talk | contribs) at 02:49, 11 March 2014 (←Created page with 'In mathematical optimization, the '''revised simplex method''' is an implementation of George Dantzig's simplex method for linear programming.'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In mathematical optimization, the revised simplex method is an implementation of George Dantzig's simplex method for linear programming.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Revised_simplex_method&oldid=599079093"