A Realization of the Simplex Method Based on Triangular Decompositions-Reference-Cited by-同舟云学术

A Realization of the Simplex Method Based on Triangular Decompositions

Published:1971 Issue: Volume: Page:152-190
ISSN:
Container-title:Handbook for Automatic Computation
language:
Short-container-title:

Author:

Bartels R. H.,Stoer J.,Zenger Ch.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-86940-2_11.pdf

Reference5 articles.

1. Bartels, R. H.: A numerical investigation of the simplex method. Technical Report No. CS 104, 1968, Computer Science Department, Stanford University, California.

2. Bartels, R. H. Golub, G. H.: The simplex method of linear programming using LU decomposition . Comm. ACM. 12, 266 -268 (1969).

3. Dantzig, G. B.: Linear programming and extensions. Princeton: Princeton University Press 1963.

4. Wilkinson, J. H.: Rounding errors in algebraic processes. London: Her Majesty’s Stationery Office; Englewood Cliffs, N.Y.: Prentice Hall 1963. German edition: Rundungsfehler. Berlin-Heidelberg-New York: Springer 1969.

5. Wilkinson, J. H. The algebraic eigenvalue problem. London: Oxford University Press 1965.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. О новом методе линейного программирования с использованием нейронных сетей;2023-10-13

2. Direct Methods for Linear Systems;Texts in Applied Mathematics;2014-10-07

3. Papers on Updating and Downdating Matrix Decompositions;G.W. Stewart;2010

4. The discrete linear restricted Chebyshev approximation;BIT;1977-09

5. A Stable Variant of the Secant Method for Solving Nonlinear Equations;SIAM Journal on Numerical Analysis;1976-12