Pricing for sparsity in the revised simplex method

James K. Ho

RAIRO - Operations Research - Recherche Opérationnelle (1978)

  • Volume: 12, Issue: 3, page 285-290
  • ISSN: 0399-0559

How to cite


Ho, James K.. "Pricing for sparsity in the revised simplex method." RAIRO - Operations Research - Recherche Opérationnelle 12.3 (1978): 285-290. <>.

author = {Ho, James K.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
language = {eng},
number = {3},
pages = {285-290},
publisher = {EDP-Sciences},
title = {Pricing for sparsity in the revised simplex method},
url = {},
volume = {12},
year = {1978},

AU - Ho, James K.
TI - Pricing for sparsity in the revised simplex method
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1978
PB - EDP-Sciences
VL - 12
IS - 3
SP - 285
EP - 290
LA - eng
UR -
ER -


  1. 1. E. M. L. BEALE, Sparseness in Linear Programming, in Large Sparse Sets of Linear Equations, J. K. REID, éd., Academic Press, London, 1971, pp. 1-15. 
  2. 2. H. CROWDER and J. M. HATTINGH, Partially Normalized Pivot Selection in Linear Programming, Mathematical Programming Study, Vol. 4, 1975, pp. 12-25. Zbl0394.90060MR429104
  3. 3. L. CUTLER and P. WOLFE, Experiments in Linear Programming, in Recent advances in mathematical programming R. L. GRAVES and P. WOLFE, éd. McGraw-Hill, New York, 1963, pp. 177-200. Zbl0223.90001MR155682
  4. 4. G. B. DANTZIG, Linear Programming and Extensions, Princeton University Press Princeton, N.J., 1963. Zbl0997.90504MR201189
  5. 5. J. C. DICKSON and F. P. FREDERICK, A Decision Rule for Improved Efficiency in Solving Linear Programming Problems with the Simplex Algorithm, Communications of the Association for Computing Machinery, Vol. 3, 1960. Zbl0111.17301MR115820
  6. 6. D. GOLDFARB, Using the Steepest-Edge Simplex Algorithm to Solve Sparse Linear Programs in Sparse matrix computations, J. R. BUNCH and D. ROSE, ed., Academic Press, New York, 1976, pp. 227-240. Zbl0345.65033MR462566
  7. 7. P. M. J. HARRIS, Pivot Selection Methods of the Devex LP Code, Mathematical Programming Study, Vol. 4, 1975, pp. 30-57. Zbl0395.90046MR391947
  8. 8. E. HELLERMAN and D. RARICK, Reinversion with the Preassigned Pivot Procedure, Mathematical Programming, Vol. 1, 1971, pp. 195-216. Zbl0246.65022MR293819
  9. 9. H. W. KUHN and R. E. QUANDT, An Experimental Study of the Simplex Method, Proceedings of symposia in applied mathematics, Vol. 15, Amer. Math. Soc, Providence, R.I., 1963. Zbl0127.08203MR161746
  10. 10. W. ORCHARD-HAYS, Advanced Linear Programming Computing Techniques, McGraw-Hill, New York, 1968. Zbl0995.90595
  11. 11. J. A. TOMLIN, Pivoting for Size and Sparsity in Linear Programming Inversion Routines, J. Inst. Math, and Appl., Vol. 10, 1972, pp. 289-295. Zbl0249.90039
  12. 12. J. A. TOMLIN, LPM1 user's Manual, Systems Optimization Laboratory, Department of Operations Research, Stanford University, 1973. 

NotesEmbed ?


You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.


Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.