Exploiting special structure in Karmarkar's linear programming algorithm

DOI10.1007/BF01580755zbMath0649.90070OpenAlexW2015848061MaRDI QIDQ1106098

Michael J. Todd

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

polynomialspecial structureKarmarkar's projective algorithmmean value-level set method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Related Items (4)

A survey of dynamic network flows ⋮ El metodo de Karmarkar: Un estudio de sus variantes ⋮ Exploiting special structure in a primal-dual path-following algorithm ⋮ Interior-point methods with decomposition for solving large-scale linear programs

Cites Work

• A monotonic projective algorithm for fractional linear programming
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A projective method for linear programming with box-type constraints
• A polynomial Newton method for linear programming
• Generalized upper bounding techniques
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• A variation on Karmarkar’s algorithm for solving linear programming problems
• The Decomposition Algorithm for Linear Programs
• A variant of Karmarkar's linear programming algorithm for problems in standard form
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
• Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
• An implementation of the simplex method for linear programming problems with variable upper bounds
• The factorization approach to large-scale linear programming
• Implicit representation of generalized variable upper bounds in linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exploiting special structure in Karmarkar's linear programming algorithm