2 papers
math.OC2026
On finding exact solutions of linear programs in the oracle model
Daniel Dadush, László A. Végh, Giacomo Zambelli
We consider linear programming in the oracle model: , where the polyhedron is given by a separation oracle. We…
math.OC2025
Interior point methods are not worse than Simplex
Xavier Allamigeon, Daniel Dadush, Georg Loho +2
We develop a new `subspace layered least squares' interior point method (IPM) for solving linear programs. Applied to an -variable linear program in standard form, the iteration…