Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces

DOI10.1007/BF01580088zbMath0949.90061OpenAlexW2126894546MaRDI QIDQ1290608

Gerard Sierksma, Gert A. Tijssen

Publication date: 28 June 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580088

zbMATH Keywords

linear programmingmultiple solutionsdegeneracyoptimal faces

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items (7)

Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution ⋮ Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm ⋮ Applying optimization theory to study extremal \(GI/GI/1\) transient mean waiting times ⋮ An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks ⋮ On the structure of the inverse-feasible region of a linear program ⋮ On the uniqueness of optimal strategies in symmetric matrix games ⋮ A multi-objective distance friction minimization model for performance assessment through data envelopment analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal representation of convex polyhedral sets
• Uniqueness of solution in linear programming
• Degeneracy in interior point methods for linear programming: A survey
• Recovering an optimal LP basis from an interior point solution
• An analysis of degeneracy
• On Finding Primal- and Dual-Optimal Bases
• Duality Theory of Linear Programs: A Constructive Approach with Applications

This page was built for publication: Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces