A Monotonic Build-Up Simplex Algorithm for Linear Programming
From MaRDI portal
Publication:4305758
DOI10.1287/opre.42.3.556zbMath0810.90089OpenAlexW2051085407MaRDI QIDQ4305758
Kurt M. Anstreicher, Tamás Terlaky
Publication date: 15 September 1994
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.42.3.556
Related Items
Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems, Resolution of the problem of degeneracy in a primal and dual simplex algorithm, The \(s\)-monotone index selection rules for pivot algorithms of linear programming, Exterior point simplex-type algorithms for linear and network optimization problems, On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds, Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules, Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems, Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied, An efficient simplex type algorithm for sparse and dense linear programs., A space decomposition-based deterministic algorithm for solving linear optimization problems, A new efficient primal dual simplex algorithm
