A stabilization of the simplex method
From MaRDI portal
Publication:2540164
DOI10.1007/BF02169151zbMath0197.43305OpenAlexW2001116826MaRDI QIDQ2540164
Publication date: 1971
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132048
Related Items
A phase-1 approach for the generalized simplex algorithm, The use of mass balances to test and improve the estimates of carbon fluxes in an ecosystem, On error growth in the Bartels-Golub and Fletcher-Matthews algorithms for updating matrix factorizations, A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems, The simplex method is not always well behaved, On the Numerical Stability of Simplex-Algorithms, Stable algorithm for updating denseLUfactorization after row or column exchange and row and column addition or deletion, Round-off estimates for second-order conic feasibility problems, Assessing a set of additive utility functions for multicriteria decision- making, the UTA method, An alternate implementation of Goldfarb's minimization algorithm, A projective simplex algorithm using LU decomposition, The double pivot simplex method, Hyper-sparsity in the revised simplex method and how to exploit it, Solving linear programs with finite precision. II: Algorithms, On the Bartels—Golub decomposition for linear programming bases, Large-scale linearly constrained optimization, Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos, A practicable steepest-edge simplex algorithm, Maintaining LU factors of a general sparse matrix, Sign consistent linear programming problems, A numerically stable form of the simplex algorithm, Large-scale linear programming: Geometry, working bases and factorizations, An implementation of the simplex method for linear programming problems with variable upper bounds, Symbiosis between linear algebra and optimization, Solving second-order conic systems with variable precision, Solving staircase linear programs by the simplex method, 1: Inversion, Novel update techniques for the revised simplex method, A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases, Stable modification of explicitLU factors for simplex updates
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Error Analysis of Direct Methods of Matrix Inversion
- Error control in the simplex-technique
- Computable Error Bounds for Direct Solution of Linear Equations
- Techniques for automatic tolerance control in linear programming
- Applications of Linear Programming to Numerical Analysis
