On the \(\epsilon\)-perturbation method for avoiding degeneracy
From MaRDI portal
Publication:1824546
DOI10.1016/0167-6377(89)90014-XzbMath0682.90057MaRDI QIDQ1824546
Nimrod Megiddo, R. Chandrasekaran
Publication date: 1989
Published in: Operations Research Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C05: Linear programming
Related Items
Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling, \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma, A class of primal affine scaling algorithms, Computing maximum mean cuts, Colorful linear programming, Nash equilibrium, and pivots, Computing solutions of the multiclass network equilibrium problem with affine cost functions, Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks, Concurrent estimation of efficiency, effectiveness and returns to scale, From Parity and Payoff Games to Linear Programming
Cites Work