Introduction: New approaches to linear programming

DOI10.1007/BF01840453zbMATH Open0612.90082OpenAlexW2072823736MaRDI QIDQ1088596FDOQ1088596

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

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 Keywords

interior-point methodsrescalingnonlinear methods

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• Differential-algebraic approach to linear programming
• An algorithm for solving nonlinear programming problems using Karmarkar's technique
• Linear programming and the Newton barrier flow
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Interior path following primal-dual algorithms. I: Linear programming
• Title not available (Why is that?)
• Insights into the interior-point methods
• Title not available (Why is that?)
• Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
• Asymptotic behaviour of Karmarkar's method for linear programming
• A unified view of interior point methods 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)