Three nearly scaling-invariant versions of an exterior point algorithm for linear programming

DOI10.1080/02331934.2014.926356zbMath1326.90048OpenAlexW2043944603MaRDI QIDQ3454862

Charalampos Triantafyllidis, Nikolaos Samaras

Publication date: 27 November 2015

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2014.926356

zbMATH Keywords

linear programmingexterior point algorithmsimplex algorithmscale invariance attribute

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items (1)

Exterior point simplex-type algorithms for linear and network optimization problems

Uses Software

• Matlab

Cites Work

• Scaling linear optimization problems prior to application of the simplex method
• Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
• Practical finite pivoting rules for the simplex method
• An infeasible (exterior point) simplex algorithm for assignment problems
• An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
• Efficient nested pricing in the simplex algorithm
• The complex interior-boundary method for linear and nonlinear programming with linear constraints
• Pivot rules for linear programming: A survey on recent theoretical developments
• An exterior point simplex algorithm for (general) linear programming problems
• An efficient simplex type algorithm for sparse and dense linear programs.
• A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
• A simple direct cosine simplex algorithm
• A largest-distance pivot rule for the simplex algorithm
• A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
• A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method
• An affine-scaling pivot algorithm for linear programming
• A convergent criss-cross method
• On the Implementation of a Primal-Dual Interior Point Method
• User'S guide To Lipsol linear-programming interior point solvers V0.4
• On using exterior penalty approaches for solving linear programming problems

This page was built for publication: Three nearly scaling-invariant versions of an exterior point algorithm for linear programming