USING THE STEEPEST-EDGE SIMPLEX ALGORITHM TO SOLVE SPARSE LINEAR PROGRAMS

Publisher Website

1 January 1976

book chapter
Published by Elsevier

p. 227-240
https://doi.org/10.1016/b978-0-12-141050-6.50018-0

Abstract

No abstract available

This publication has 4 references indexed in Scilit:

On pricing and backward transformation in linear programming
Mathematical Programming, 1974
Pivot selection methods of the Devex LP code
Mathematical Programming, 1973
Updated triangular factors of the basis to maintain sparsity in the product form simplex method
Mathematical Programming, 1972
An experimental study of the simplex method
Proceedings of Symposia in Applied Mathematics, 1963