Exploiting special structure in Karmarkar's linear programming algorithm

DOI10.1007/BF01580755MaRDI QIDQ1106098zbMATH OpenOpenAlexFDO

Authors 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) Linear programming (90C05) Large-scale problems in mathematical programming (90C06)

Recommendations

• Publication:3496152
• Some experiments with Karmarkar's algorithm for linear programming
• Publication:3801333
• Publication:3486755
• Publication:4381220

Cites work

• scientific article; zbMATH DE number 3833697 (Why is no real title available?)
• scientific article; zbMATH DE number 3849165 (Why is no real title available?)
• scientific article; zbMATH DE number 3561083 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• A modification of Karmarkar's linear programming algorithm
• A monotonic projective algorithm for fractional 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 variant of Karmarkar's linear programming algorithm for problems in standard form
• A variation on Karmarkar’s algorithm for solving linear programming problems
• An extension of Karmarkar's algorithm for linear programming using dual variables
• An implementation of the simplex method for linear programming problems with variable upper bounds
• Generalized upper bounding techniques
• Implicit representation of generalized variable upper bounds in linear programming
• Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
• The Decomposition Algorithm for Linear Programs
• The factorization approach to large-scale linear programming

Cited in

(5)

• Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming
• El metodo de Karmarkar: Un estudio de sus variantes
• Exploiting special structure in a primal-dual path-following algorithm
• A survey of dynamic network flows
• Interior-point methods with decomposition for solving large-scale linear programs

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

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