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