
























We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorithm for which one can bound the number of steps by a polynomial in the diameter plus the number of facets of the polyhedron of feasible solutions then the general linear programming problem can be solved in strongly polynomial time.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。