Men and progress in linear programming

DOI10.1080/09720502.2011.10700746zbMath1219.90005MaRDI QIDQ3089104

Noureddine Daili

Publication date: 23 August 2011

Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.connectjournals.com/file_html_pdf/1082402H_06_JIM_T19_14-2_pp205-221A.pdf

zbMATH Keywords

linear programming; history; simplex method; ellipsoid method; Karmarkar's method

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90C05: Linear programming

01A60: History of mathematics in the 20th century

01A61: History of mathematics in the 21st century

90-03: History of operations research and mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Outline of an algorithm for integer solutions to linear programs
• Linear Programming
• Being in the Right Place at the Right Time
• A note on degeneracy in linear programming
• Mathematical Developments Arising from Linear Programming
• The Distribution of a Product from Several Sources to Numerous Localities
• The complexity of linear programming