The simplex algorithm with the pivot rule of maximizing criterion improvement
From MaRDI portal
Publication:2558159
DOI10.1016/0012-365X(73)90171-4zbMath0254.90027MaRDI QIDQ2558159
Publication date: 1973
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On the length of simplex paths: The assignment case, The Random‐Facet simplex algorithm on combinatorial cubes, A new family of exponential LP problems, A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps, Affirmative action algorithms, Worst case behavior of the steepest edge simplex method, The Polyhedral Geometry of Pivot Rules and Monotone Paths, Inapproximability of shortest paths on perfect matching polytopes, On relaxation methods for systems of linear inequalities, A Friendly Smoothed Analysis of the Simplex Method, A double-pivot simplex algorithm and its upper bounds of the iteration numbers, Constraint Satisfaction Problems over Numeric Domains, A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games, On scaling linear programs—some experimental results, The complexity of linear programming, On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes, Steepest-edge rule and its number of simplex iterations for a nondegenerate LP, Efficient search for rationals, Practical finite pivoting rules for the simplex method, Low order polynomial bounds on the expected performance of local improvement algorithms, Fast finite methods for a system of linear inequalities, An affine-scaling pivot algorithm for linear programming, The ellipsoid method and its implications, On the Length of Monotone Paths in Polyhedra, Nonadjacent extreme point methods for solving linear programs, An exterior point simplex algorithm for (general) linear programming problems, Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization, The Average number of pivot steps required by the Simplex-Method is polynomial, Trivial integer programs unsolvable by branch-and-bound
Cites Work
