Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value

DOI10.1007/BF01580729MaRDI QIDQ1103522zbMATH OpenFDO

Authors Donald Goldfarb, Sanjay Mehrotra

Publication date 1988

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

zbMATH Keywords

dual feasible solutionsimproving sequence of lower boundsvariants of Karmarkar's algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• A variant of Karmarkar's linear programming algorithm for problems in standard form
• A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables
• A variation on Karmarkar’s algorithm for solving linear programming problems
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A relaxed version of Karmarkar's method

Cites work

• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• A relaxed version of Karmarkar's method
• A variant of Karmarkar's linear programming algorithm for problems in standard form
• An experimental approach to karmarkar’s projective method for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

Cited in

(13)

• An active-set strategy in an interior point method for linear programming
• A Variant of Karmarkar’s Linear Programming Algorithm for Problems with Some Unrestricted Variables
• A relaxed version of Karmarkar's method
• Computational results of an interior point algorithm for large scale linear programming
• A combined phase I-phase II projective algorithm for linear programming
• Vector processing in simplex and interior methods for linear programming
• An \(\epsilon\)-active barrier-function method for solving minimax problems
• A modified scaling algorithm for LP
• A relaxed primal-dual path-following algorithm for linear programming
• A barrier function method for minimax problems
• El metodo de Karmarkar: Un estudio de sus variantes
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Asymptotic behaviour of Karmarkar's method for linear programming

Describes a project that uses

Uses Software

• LSQR
• CRAIG

This page was built for publication: Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value

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