A combined phase I-phase II projective algorithm for linear programming

DOI10.1007/BF01582290zbMath0662.90048MaRDI QIDQ1114588

Kurt M. Anstreicher

Publication date: 1989

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

zbMATH Keywords

Karmarkar's algorithmprojective algorithmsequence of lower boundsfractional linear programming

Mathematics Subject Classification ID

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

Related Items

Combining phase I and phase II in a potential reduction algorithm for linear programming, Infeasible interior-point methods for linear optimization based on large neighborhood, Potential-reduction methods in mathematical programming, An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution, An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption, A Fourth bibliography of fractional programming, A combined phase I-phase II scaled potential algorithm for linear programming, A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start, On Anstreicher's combined phase I-phase II projective algorithm for linear programming, On interior algorithms for linear programming with no regularity assumptions, A little theorem of the big \({\mathcal M}\) in interior point algorithms, On combined phase 1-phase 2 projective methods for linear programming, Linear updates for a single-phase projective method, Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions, A complete algorithm for linear fractional programs, An extension of the potential reduction algorithm for linear complementarity problems with some priority goals

Cites Work

• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A polynomial Newton method for linear programming
• Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
• A relaxed version of Karmarkar's method
• 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