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:
Online Access: |
Online Access |
---|---|
Corporate Authors: | , |
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: |
Internet
Online AccessOnline
Call Number: |
E 1.99:sol--93-5
|
---|---|
E 1.99:sol--93-5 | Available |