A new linear programming algorithm - better or worse than the simplex method?

DOI10.1007/BF03023055zbMath0463.90065MaRDI QIDQ1153837

No author found.

Publication date: 1980

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

zbMATH Keywords

ellipsoid algorithmdualitypolynomial algorithmsimplex methodoptimality conditionsupervisor principlewell- characterized problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Iterative numerical methods for linear systems (65F10)

Related Items (6)

Complexity of linear programming ⋮ On the average number of steps of the simplex method of linear programming ⋮ Unnamed Item ⋮ Einige Erläuterungen zum Khacian-Verfahren ⋮ Khachiyan's Algorithmus ⋮ Integer programming and cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Riemann's hypothesis and tests for primality
• On the Shannon capacity of a graph
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Convergence rate of the gradient descent method with dilatation of the space
• The Factorization of Linear Graphs

This page was built for publication: A new linear programming algorithm - better or worse than the simplex method?