A strongly polynomial algorithm for a new class of linear inequalities1

DOI10.1080/02331939508844062zbMath0820.65027OpenAlexW2023559632WikidataQ57634012 ScholiaQ57634012MaRDI QIDQ4836755

O. V. Gorokh, Frank Werner

Publication date: 21 June 1995

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

linear programming problemsstrongly polynomial algorithmsperfect systems of linear inequalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

On the solution of determinantal systems of linear inequalities ⋮ Deepest point of a polyhedron and linear programming

Cites Work

• A strongly polynomial minimum cost circulation algorithm
• Towards a Genuinely Polynomial Algorithm for Linear Programming
• Linear Programming in Linear Time When the Dimension Is Fixed
• Unnamed Item
• Unnamed Item

This page was built for publication: A strongly polynomial algorithm for a new class of linear inequalities¹