Introduction: New approaches to linear programming

DOI10.1007/BF01840453MaRDI QIDQ1088596zbMATH OpenOpenAlexFDO

Authors 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

interior-point methodsnonlinear methodsrescaling

Mathematics Subject Classification ID

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

Review text

This issue of Algorithmica presents papers on various aspects of nonlinear methods for solving linear programming problems, inspired by the work of Karmarkar. This introduction describes some of these aspects and briefly mentions other recent developments in the field. A bibliography of recent articles is included.

Recommendations

• An algorithm for solving nonlinear programming problems using Karmarkar's technique
• A reduced-gradient variant of Karmarkar's algorithm and null-space projections
• scientific article; zbMATH DE number 1226308
• A variable-metric variant of the Karmarkar algorithm for linear programming
• scientific article; zbMATH DE number 4158373

Cites work

• A feasible direction method for linear programming
• A modification of Karmarkar's linear programming algorithm
• A monotonic projective algorithm for fractional linear programming
• A multiplicative barrier function method for linear programming
• A new polynomial-time algorithm for linear programming
• A polynomial Newton method for linear programming
• A projective method for linear programming with box-type constraints
• A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
• Homotopy techniques in linear programming
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• Normal solutions of linear programs
• The iterative step in the linear programming algorithm of N. Karmarkar

Cited in

(14)

• Linear programming and the Newton barrier flow
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
• Differential-algebraic approach to linear programming
• An algorithm for solving nonlinear programming problems using Karmarkar's technique
• scientific article; zbMATH DE number 3858832 (Why is no real title available?)
• Implementing conflict resolution
• scientific article; zbMATH DE number 3918118 (Why is no real title available?)
• Insights into the interior-point methods
• scientific article; zbMATH DE number 554512 (Why is no real title available?)
• scientific article; zbMATH DE number 562330 (Why is no real title available?)
• A unified view of interior point methods for linear programming
• Asymptotic behaviour of Karmarkar's method for linear programming

This page was built for publication: Introduction: New approaches to linear programming

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