A Monotonic Build-Up Simplex Algorithm for Linear Programming

DOI10.1287/OPRE.42.3.556MaRDI QIDQ4305758zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

simplex pivot rule

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• The simplex algorithm with a new primal and dual pivot rule
• Practical finite pivoting rules for the simplex method
• Pivot rules for linear programming: A survey on recent theoretical developments
• Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems

Cited in

(22)

• A new analysis for monotonic type simplex algorithms for feasibility problems
• An efficient simplex type algorithm for sparse and dense linear programs.
• Optimal pivot path of the simplex method for linear programming based on reinforcement learning
• scientific article; zbMATH DE number 4045475 (Why is no real title available?)
• scientific article; zbMATH DE number 3900488 (Why is no real title available?)
• A ``build-down scheme for linear programming
• Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems
• 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
• Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems
• On the existence of a short pivoting sequence for a linear program
• Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
• Pivot rules for linear programming: A survey on recent theoretical developments
• Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
• A new efficient primal dual simplex algorithm
• Strict monotonicity in Todd's low-complexity algorithm for linear programming
• The \(s\)-monotone index selection rules for pivot algorithms of linear programming
• A minimum-ratio-test-free approach to linear programming
• A space decomposition-based deterministic algorithm for solving linear optimization problems
• Monotonizing linear programs with up to two nonzeroes per column
• The simplex algorithm with a new primal and dual pivot rule
• Resolution of the problem of degeneracy in a primal and dual simplex algorithm

This page was built for publication: A Monotonic Build-Up Simplex Algorithm for Linear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4305758)