Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems

DOI10.1080/10556780701223541zbMath1167.90616OpenAlexW2094885056MaRDI QIDQ5436927

Zsolt Csizmadia, Filiz Bilen, Tibor Illés

Publication date: 18 January 2008

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780701223541

zbMATH Keywords

linear programmingdegeneracyfeasibility problemAnstreicher-Terlaky type monotonic simplex algorithms

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (6)

Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems ⋮ The \(s\)-monotone index selection rules for pivot algorithms of linear programming ⋮ Portfolio selection based on extended Gini shortfall risk measures ⋮ 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 ⋮ Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
• Pivot rules for linear programming: A survey on recent theoretical developments
• Computational techniques of the simplex method
• A convergent criss-cross method
• On the Development of Optimization Theory
• A Monotonic Build-Up Simplex Algorithm for Linear Programming
• Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems

This page was built for publication: Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems