A monotonic projective algorithm for fractional linear programming

DOI10.1007/BF01840458zbMATH Open0625.90088MaRDI QIDQ580191FDOQ580191

Authors: Kurt M. Anstreicher 

Publication date: 1986

Published in: Algorithmica (Search for Journal in Brave)

Recommendations

• A combined phase I-phase II projective algorithm for linear programming
• Short Steps with Karmarkar’s Projective Algorithm for Linear Programming
• A Centered Projective Algorithm for Linear Programming
• Karmarkar's linear programming algorithm and Newton's method
• scientific article; zbMATH DE number 4068603

zbMATH Keywords

N. Karmarkar's projective algorithm

Mathematics Subject Classification ID

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

Cites Work

• A new polynomial-time algorithm for linear programming
• Title not available (Why is that?)

Cited In (53)

• An alternative derivation of the projective interior point method for linear programming through the least squares approach
• The finite criss-cross method for hyperbolic programming
• Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
• Interior-point algorithms for semi-infinite programming
• Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
• Cutting planes and column generation techniques with the projective algorithm
• An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope
• A polynomial method of approximate centers for linear programming
• Long steps in an \(O(n^ 3L)\) algorithm for linear programming
• Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
• On Anstreicher's combined phase I-phase II projective algorithm for linear programming
• On combined phase 1-phase 2 projective methods for linear programming
• Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
• A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
• Search directions for interior linear-programming methods
• Conical projection algorithms for linear programming
• El metodo de Karmarkar: Un estudio de sus variantes
• A ``build-down scheme for linear programming
• A combined phase I-phase II scaled potential algorithm for linear programming
• Combining phase I and phase II in a potential reduction algorithm for linear programming
• Karmarkar's algorithm and the ellipsoid method
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• A variant of Karmarkar's linear programming algorithm for problems in standard form
• A variable-metric variant of the Karmarkar algorithm for linear programming
• Karmarkar's projective method for linear programming: a computational survey
• A combined phase I-phase II projective algorithm for linear programming
• A Fourth bibliography of fractional programming
• A primal projective interior point method for linear programming
• An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
• Recursive portfolio management: Large-scale evidence from two Scandinavian stock markets
• An interior-point method for fractional programs with convex constraints
• On lower bound updates in primal potential reduction methods for linear programming
• Convergence in Karmarkar's algorithm: a review
• A Polynomial Method of Weighted Centers for Convex Quadratic Programming
• Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
• A relaxed version of Karmarkar's method
• On the improvement per iteration in Karmarkar's algorithm for linear programming
• A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• On polynomiality of the method of analytic centers for fractional problems
• Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
• Solving combinatorial optimization problems using Karmarkar's algorithm
• Exploiting special structure in Karmarkar's linear programming algorithm
• Potential-reduction methods in mathematical programming
• A survey of search directions in interior point methods for linear programming
• Interior point algorithms for linear programming with inequality constraints
• A path-following version of the Todd-Burrell procedure for linear programming
• On monotonicity in the scaled potential algorithm for linear programming
• The affine-scaling direction for linear programming is a limit of projective-scaling directions
• Introduction: New approaches to linear programming
• Computing Karmarkar projections quickly
• Karmarkar's linear programming algorithm and Newton's method

This page was built for publication: A monotonic projective algorithm for fractional linear programming

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