The simplex algorithm with a new primal and dual pivot rule
- Florida Univ., Gainesville, FL (United States). Dept. of Industrial and Systems Engineering
- Stanford Univ., CA (United States). Systems Optimization Lab.
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.
- Research Organization:
- Stanford Univ., CA (United States). Systems Optimization Lab.
- Sponsoring Organization:
- USDOE, Washington, DC (United States); National Science Foundation, Washington, DC (United States); Department of Defense, Washington, DC (United States)
- DOE Contract Number:
- FG03-92ER25117
- OSTI ID:
- 10179889
- Report Number(s):
- SOL--93-5; ON: DE93019401; CNN: Grant DDM-8814075; Contract STC-91-19999; Grant DDM-9204208; Grant N00014-90-J-1242
- Country of Publication:
- United States
- Language:
- English
Similar Records
A steepest-edge primal-dual network simplex algorithm
Research on primal-dual interior point algorithms for mathematical programming. Final technical report, August 1991--August 1993
Comparisons of composite simplex algorithms. [Weighted Objective, Self-Dual Parametric, and Markowitz Criteria]
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35930
Research on primal-dual interior point algorithms for mathematical programming. Final technical report, August 1991--August 1993
Technical Report
·
Wed Sep 01 00:00:00 EDT 1993
·
OSTI ID:10107167
Comparisons of composite simplex algorithms. [Weighted Objective, Self-Dual Parametric, and Markowitz Criteria]
Technical Report
·
Mon Jun 01 00:00:00 EDT 1987
·
OSTI ID:6157018