A numerically stable form of the simplex algorithm
From MaRDI portal
Publication:2558746
DOI10.1016/0024-3795(73)90047-5zbMath0255.65029OpenAlexW2045961034MaRDI QIDQ2558746
Publication date: 1973
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(73)90047-5
Related Items
A perturbation analysis of the problem of downdating a Cholesky factorization, A modification to the LINPACK downdating algorithm, The simplex method is not always well behaved, Linear programming via least squares, DCR 2: An improved algorithm for \(\ell_\infty\) rational approximation on intervals, On the Numerical Stability of Simplex-Algorithms, An Error Analysis of a Method for Solving Matrix Equations, Newton-type methods for unconstrained and linearly constrained optimization, Unnamed Item, The sagitta method for solving linear programs, Unnamed Item, A sparse counterpart of Reichel and Gragg's package QRUP, Large-scale linear programming: Geometry, working bases and factorizations, Variable metric methods for linearly constrained nonlinear minimax approximation, An implementation of the simplex method for linear programming problems with variable upper bounds, Procedures for optimization problems with a mixture of bounds and general linear constraints, The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, Stable modification of explicitLU factors for simplex updates
Cites Work
