A linear programming primer: from Fourier to Karmarkar

DOI10.1007/S10479-019-03186-2MaRDI QIDQ2177789zbMATH OpenOpenAlexWikidataFDO

Authors Atlanta Chakraborty, Vijay Chandru, M. R. Rao

Publication date 6 May 2020

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-019-03186-2

zbMATH Keywords

linear programmingoptimisationdualityinterior point methodlinear inequalitiesmonotonesimplex methodellipsoid method

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Men and progress in linear programming
• scientific article; zbMATH DE number 1195551
• scientific article; zbMATH DE number 682417
• Fourier's Method of Linear Programming and Its Dual
• George Dantzig's impact on the theory of computation

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• scientific article; zbMATH DE number 830380 (Why is no real title available?)
• scientific article; zbMATH DE number 3215729 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• scientific article; zbMATH DE number 3069632 (Why is no real title available?)
• A Strongly Polynomial Algorithm for a Special Class of Linear Programs
• A Technique for Resolving Degeneracy in Linear Programming
• A new polynomial-time algorithm for linear programming
• Commentary—Progress in Linear Programming
• Commentary—Theory and Practice for Interior-Point Methods
• Convergence rate of the gradient descent method with dilatation of the space
• Fourier's Method of Linear Programming and Its Dual
• Fourier-Motzkin elimination and its dual
• From LP to LP: Programming with constraints
• Geometric algorithms and combinatorial optimization
• Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
• Lectures on Polytopes
• On Finding Primal- and Dual-Optimal Bases
• On Fourier's algorithm for linear arithmetic constraints
• On Linear Characterizations of Combinatorial Optimization Problems
• Optimality and Degeneracy in Linear Programming
• Polyhedral sets having a least element
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
• The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods
• The ellipsoid method and its consequences in combinatorial optimization
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• The simplex method. A probabilistic analysis
• Towards a Genuinely Polynomial Algorithm for Linear Programming
• Variable Elimination in Linear Constraints

Cited in

(5)

• Solving Real-World Linear Programs: A Decade and More of Progress
• Linear Programming from Fibonacci to Farkas
• Men and progress in linear programming
• scientific article; zbMATH DE number 3852782 (Why is no real title available?)
• George Dantzig's impact on the theory of computation

This page was built for publication: A linear programming primer: from Fourier to Karmarkar

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