×

A stabilization of the simplex method. (English) Zbl 0197.43305


PDF BibTeX XML Cite
Full Text: DOI EuDML

References:

[1] Chartres, Bruce A., Geuder, James C.: Computable error bounds for direct solution to linear equations. J. Assoc. Comp. Mach.14, 63–71 (1967). · Zbl 0153.46103
[2] Clasen, R. J.: Techniques for automatic tolerance control in linear programming. Comm. Assoc. Comp. Mach.9, 802–803 (1966). · Zbl 0171.38302
[3] Dantzig, George B.: Linear programming and extensions. Princeton University Press 1965
[4] Hadley, G.: Linear programming. Addison Wesley 1962. · Zbl 0102.36304
[5] Mueller-Merbach, Heiner: On round-off errors in linear programming, paper presented at the joint CORS-ORSA conference, Montreal, May 28, 1964.
[6] Oettli, W., Prager, W.: Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides. Numer. Math.6, no. 5, 405–409 (1964). · Zbl 0133.08603
[7] Rabinowitz, Philip: Applications of linear programming to numerical analysis. SIAM Review10, 121–159 (1968). · Zbl 0236.65001
[8] Storoy, Sverre: Error control in the simplex-technique. BIT7, no. 3, 216–225 (1967). · Zbl 0152.35402
[9] Wilkinson, J. H.: Rounding errors in algebraic processes. Proceedings of the International Conference on Information Processing, UNESCO, 1959 · Zbl 0868.65027
[10] —- Error analysis of direct methods of matrix inversion. J. Assoc. Comp. Mach.8, no. 3, 281–330 (1961). · Zbl 0109.09005
[11] – Rounding errors in algebraic processes. Prentice-Hall 1963. · Zbl 1041.65502
[12] – The algebraic eigenvalue problem. Oxford University Press 1965. · Zbl 0258.65037
[13] Wolfe, Philip: Error in the solution of linear programming problems, in Error in digital computation, Louis B. Rall, ed. Wiley 1965 · Zbl 0173.17903
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.