An affine-scaling pivot algorithm for linear programming
From MaRDI portal
Publication:2841137
DOI10.1080/02331934.2011.606576zbMath1273.90120OpenAlexW1968099403MaRDI QIDQ2841137
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
Related Items (3)
Three nearly scaling-invariant versions of an exterior point algorithm for linear programming ⋮ Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis ⋮ Improving a primal–dual simplex-type algorithm using interior point methods
Uses Software
Cites Work
- A modification of Karmarkar's linear programming algorithm
- Practical finite pivoting rules for the simplex method
- A new polynomial-time algorithm for linear programming
- Convergence results and numerical experiments on a linear programming hybrid algorithm
- A projective simplex method for linear programming
- A dual projective simplex method for linear programming
- A practical anti-cycling procedure for linearly constrained optimization
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- A dual projective pivot algorithm for linear programming
- Steepest-edge simplex algorithms for linear programming
- A basis-defiency-allowing variation of the simplex method for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- A projective simplex algorithm using LU decomposition
- The simplex algorithm with the pivot rule of maximizing criterion improvement
- A variation on Karmarkar’s algorithm for solving linear programming problems
- The Criss-Cross Method for Solving Linear Programming Problems
- A convergent criss-cross method
- A simplex-like method with bisection for linear programming1
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- New Finite Pivoting Rules for the Simplex Method
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- A Revised Dual Projective Pivot Algorithm for Linear Programming
- Programming of Interdependent Activities: II Mathematical Model
- The Product Form for the Inverse in the Simplex Method
- The dual active set algorithm and its application to linear programming
This page was built for publication: An affine-scaling pivot algorithm for linear programming
