An affine-scaling pivot algorithm for linear programming

DOI10.1080/02331934.2011.606576MaRDI QIDQ2841137zbMATH OpenOpenAlexFDO

Authors Ping-Qi Pan

Publication date 24 July 2013

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

projectioninterior pointQR decompositionpivotaffine-scaling

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 910007
• The simplex algorithm with a new primal and dual pivot rule
• Combining Interior-Point and Pivoting Algorithms for Linear Programming
• Polynomial affine algorithms for linear programming
• Implementation of a Dual Affine Interior Point Algorithm for Linear Programming

Cites work

• A Revised Dual Projective Pivot Algorithm for Linear Programming
• A basis-defiency-allowing variation of the simplex method for linear programming
• A convergent criss-cross method
• A dual projective pivot algorithm for linear programming
• A dual projective simplex method for linear programming
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• A practical anti-cycling procedure for linearly constrained optimization
• A projective simplex algorithm using LU decomposition
• A projective simplex method for linear programming
• A simplex-like method with bisection for linear programming¹
• A variation on Karmarkar’s algorithm for solving linear programming problems
• An implementation of Karmarkar's algorithm for linear programming
• Convergence results and numerical experiments on a linear programming hybrid algorithm
• Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
• Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
• New Finite Pivoting Rules for the Simplex Method
• Practical finite pivoting rules for the simplex method
• Programming of Interdependent Activities: II Mathematical Model
• Steepest-edge simplex algorithms for linear programming
• The Criss-Cross Method for Solving Linear Programming Problems
• The Product Form for the Inverse in the Simplex Method
• The dual active set algorithm and its application to linear programming
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• The simplex algorithm with the pivot rule of maximizing criterion improvement
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method

Cited in

(6)

• A pivoting algorithm for linear programming with linear complementarity constraints
• Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
• Improving a primal–dual simplex-type algorithm using interior point methods
• scientific article; zbMATH DE number 1226265 (Why is no real title available?)
• Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
• Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix

Describes a project that uses

Uses Software

• NETLIB LP Test Set
• Netlib

This page was built for publication: An affine-scaling pivot algorithm for linear programming

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