Sign consistent linear programming problems

DOI10.1080/02331930701763496MaRDI QIDQ3648620zbMATH OpenOpenAlexFDO

Authors M. García-Esnaola, J. M. Peña

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

sign consistencydual simplexgrowth factorsign regularitytotally positive linear programming problems

Mathematics Subject Classification ID

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

Recommendations

• Solving linear programs from sign patterns
• Linear programming with positive semi-definite matrices
• Sign-consistency and solvability of constrained linear systems
• scientific article; zbMATH DE number 468799
• Sign-solvable linear complementarity problems

Cites work

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

Cited in

(6)

• Error bounds for linear complementarity problems for \(B\)-matrices
• Recognition of matrices which are sign-regular of a given order and a generalization of oscillatory matrices
• A comparison of error bounds for linear complementarity problems of \(H\)-matrices
• scientific article; zbMATH DE number 468799 (Why is no real title available?)
• A counting problem in linear programming
• Strict Linear Programs and Tight Matrices

This page was built for publication: Sign consistent linear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648620)