Sign consistent linear programming problems

DOI10.1080/02331930701763496zbMath1175.90285OpenAlexW2146016948MaRDI QIDQ3648620

Juan Manuel Peña, Marta García-Esnaola

Publication date: 27 November 2009

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930701763496

zbMATH Keywords

growth factordual simplexsign regularitysign consistencytotally positive linear programming problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items

Error bounds for linear complementarity problems for \(B\)-matrices ⋮ A comparison of error bounds for linear complementarity problems of \(H\)-matrices ⋮ Recognition of matrices which are sign-regular of a given order and a generalization of oscillatory matrices

Cites Work

• The discrete moment problem and linear programming
• Generalized convexity preserving transformations
• Backward stability of a pivoting strategy for sign-regular linear systems
• On the expected condition number of linear programming problems
• Solving linear programs with finite precision. I: Condition numbers and random programs
• A stabilization of the simplex method
• A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems
• Variation Diminishing Transformations: A Direct Approach to Total Positivity and its Statistical Applications
• Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
• Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method
• Accuracy and Stability of Numerical Algorithms
• Matrices with Sign Consistency of a Given Order
• Totally positive matrices