Tolla, Pierre Linear and non-linear programming software validity. (English) Zbl 0501.65028 Math. Comput. Simulation 25, 39-42 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 Documents MSC: 65K05 Numerical mathematical programming methods 90C05 Linear programming 90C30 Nonlinear programming 65F05 Direct numerical methods for linear systems and matrix inversion 65F10 Iterative numerical methods for linear systems Keywords:permutation-perturbation method; simplex methods; reduced gradient; matrix inversions; termination criterions PDF BibTeX XML Cite \textit{P. Tolla}, Math. Comput. Simul. 25, 39--42 (1983; Zbl 0501.65028) Full Text: DOI References: [1] Abadie, J., “numerical experiments with the GRG method”, () · Zbl 0331.65041 [2] Bartels, R.H., A numerical investigation of the simplex method, Stanford thesis, (1968) [3] Dantzig, G.B., Linear programming and extensions, (1963), Princeton · Zbl 0108.33103 [4] La Porte, M.; Vignes, J., Algorithmes numériques : analyse et mise en oeuvre, Technip, (1974) · Zbl 0334.65035 [5] Tolla, P., “sparse matrices quasi-triangularization”, () · Zbl 0576.90060 [6] Vignes, J., “new methods for evaluating the validity of the results of mathematical computations”, Math. comp. sim., XX, 227-245, (1978), n^o4 · Zbl 0437.65041 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.