A linear programming primer: from Fourier to Karmarkar

DOI10.1007/S10479-019-03186-2zbMATH Open1442.90122OpenAlexW2919984904WikidataQ128306283 ScholiaQ128306283MaRDI QIDQ2177789FDOQ2177789

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

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

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)

Cites Work

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