The simplex algorithm with a new primal and dual pivot rule

The simplex algorithm with a new primal and dual pivot rule [electronic resource]

We present a simplex-type algorithm for linear programming that works with primal-feasible and dual-feasible points associated with bases that differ by only one column.

Saved in:

Bibliographic Details
Online Access:	Online Access
Corporate Authors:	Stanford University. Systems Optimization Laboratory (Researcher), United States. Department of Energy. Oakland Operations Office (Researcher)
Format:	Government Document Electronic eBook
Language:	English
Published:	Oakland, Calif. : Oak Ridge, Tenn. : United States. Dept. of Energy. Oakland Operations Office ; distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 1993.
Subjects:	Algorithms. Linear Programming. General And Miscellaneous//mathematics, Computing, And Information Science.

Description
Summary:	We present a simplex-type algorithm for linear programming that works with primal-feasible and dual-feasible points associated with bases that differ by only one column.
Item Description:	Published through the Information Bridge: DOE Scientific and Technical Information. 06/01/1993. "sol--93-5" "DE93019401" ": Grant DDM-8814075" "Contract STC-91-19999" "Grant DDM-9204208" "Grant N00014-90-J-1242" Saunders, M.A.; Pardalos, P.M.; Chen, Hsin-Der. USDOE, Washington, DC (United States);National Science Foundation, Washington, DC (United States);Department of Defense, Washington, DC (United States)
Physical Description:	9 p. : digital, PDF file.