An affine-scaling pivot algorithm for linear programming
type: Item
instance of: scholarly article
title: An affine-scaling pivot algorithm for linear programming
zbMATH Open document ID: 1273.90120
DOI: 10.1080/02331934.2011.606576
author: Ping-Qi Pan
published in: Optimization
publication date: 2013-07-24T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6190691
zbMATH Keywords: pivot
zbMATH Keywords: interior point
zbMATH Keywords: affine-scaling
zbMATH Keywords: QR decomposition
zbMATH Keywords: projection
describes a project that uses: Netlib
describes a project that uses: NETLIB LP Test Set
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/02331934.2011.606576
OpenAlex ID: W1968099403
cites work: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
cites work: An implementation of Karmarkar's algorithm for linear programming
cites work: A variation on Karmarkar’s algorithm for solving linear programming problems
cites work: New Finite Pivoting Rules for the Simplex Method
cites work: Programming of Interdependent Activities: II Mathematical Model
cites work: The Product Form for the Inverse in the Simplex Method
cites work: Steepest-edge simplex algorithms for linear programming
cites work: Updated triangular factors of the basis to maintain sparsity in the product form simplex method
cites work: A practical anti-cycling procedure for linearly constrained optimization
cites work: The dual active set algorithm and its application to linear programming
cites work: The simplex algorithm with the pivot rule of maximizing criterion improvement
cites work: A new polynomial-time algorithm for linear programming
cites work: Convergence results and numerical experiments on a linear programming hybrid algorithm
cites work: Practical finite pivoting rules for the simplex method
cites work: A simplex-like method with bisection for linear programming1
cites work: The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
cites work: A dual projective simplex method for linear programming
cites work: A basis-defiency-allowing variation of the simplex method for linear programming
cites work: A projective simplex method for linear programming
cites work: A projective simplex algorithm using LU decomposition
cites work: A dual projective pivot algorithm for linear programming
cites work: A Revised Dual Projective Pivot Algorithm for Linear Programming
cites work: Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
cites work: A modification of Karmarkar's linear programming algorithm
cites work: The Criss-Cross Method for Solving Linear Programming Problems
cites work: A convergent criss-cross method
description: scientific article; zbMATH DE number 6190691