Introduction: New approaches to linear programming

DOI10.1007/BF01840453zbMath0612.90082OpenAlexW2072823736MaRDI QIDQ1088596

Nimrod Megiddo

Publication date: 1986

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01840453

zbMATH Keywords

rescalinginterior-point methodsnonlinear methods

Mathematics Subject Classification ID

Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Linear programming and the Newton barrier flow, Insights into the interior-point methods, Interior path following primal-dual algorithms. I: Linear programming, Interior path following primal-dual algorithms. II: Convex quadratic programming, Asymptotic behaviour of Karmarkar's method for linear programming, Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function, A unified view of interior point methods for linear programming

Cites Work

• Unnamed Item
• A monotonic projective algorithm for fractional linear programming
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• A feasible direction method for linear programming
• A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm
• The iterative step in the linear programming algorithm of N. Karmarkar
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Homotopy techniques in linear programming
• A projective method for linear programming with box-type constraints
• A polynomial Newton method for linear programming
• A multiplicative barrier function method for linear programming
• Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
• Normal solutions of linear programs
• Boundary Behavior of Interior Point Algorithms in Linear Programming