A stable theorem of the alternative: An extension of the Gordan theorem

DOI10.1016/0024-3795(81)90100-2zbMath0488.90044OpenAlexW2068996704WikidataQ115465255 ScholiaQ115465255MaRDI QIDQ1166412

Olvi L. Mangasarian

Publication date: 1981

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(81)90100-2

zbMATH Keywords

uniquenessboundednessfeasible points of polyhedral setsGordan theoremstable theorem of the alternative

Mathematics Subject Classification ID

Linear programming (90C05) Miscellaneous inequalities involving matrices (15A45)

Related Items

Interior dual proximal point algorithm for linear programs, Extreme points of well-posed polytopes, On regularity and stability in semi-infinite optimization, Error bounds for solutions of linear equations and inequalities, A theorem of the alternative with an arbitrary number of inequalities and quadratic programming, KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions, Minimum principle sufficiency, Condition measures and properties of the central trajectory of a linear program, Optimality conditions in smooth nonlinear programming, Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs, A geometric Gordan-Stiemke theorem, A dual differentiable exact penalty function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniqueness of solution in linear programming
• Complementary pivot theory of mathematical programming
• Exact penalty functions in nonlinear programming
• Stability Theory for Systems of Inequalities. Part I: Linear Systems
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• Marginal Values in Linear Programming