The double pivot simplex method
From MaRDI portal
Publication:684156
DOI10.1007/s00186-017-0610-4zbMath1390.90387OpenAlexW3109606681MaRDI QIDQ684156
Publication date: 9 February 2018
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-017-0610-4
Related Items (2)
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming ⋮ A double-pivot simplex algorithm and its upper bounds of the iteration numbers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interior point methods 25 years later
- Linear programming models with planned lead times for supply chain operations planning
- A new version of the improved primal simplex for degenerate linear programs
- Linear quadratic programming in oriented matroids
- A new polynomial-time algorithm for linear programming
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Matrix multiplication via arithmetic progressions
- A stable and sparsity exploiting LU factorization of the basis matrix in linear programming
- Linear optimization and extensions.
- A fast LU update for linear programming
- Pivot rules for linear programming: A survey on recent theoretical developments
- A primal-dual infeasible-interior-point algorithm for linear programming
- Pivot versus interior point methods: Pros and cons
- Cycling in linear programming problems
- A mathematical programming model for scheduling steelmaking-continuous casting production
- Homotopy perturbation technique
- Combining linear programming and automated planning to solve intermodal transportation problems
- Novel update techniques for the revised simplex method
- Fuzzy chance constrained linear programming model for optimizing the scrap charge in steel production
- Conditional value at risk and related linear programming models for portfolio optimization
- Gaussian elimination is not optimal
- A stabilization of the simplex method
- Mathematical Methods of Organizing and Planning Production
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
- A Linear Programming Approach to Discriminant Analysis with a Reserved-Judgment Region
- An Improved Primal Simplex Algorithm for Degenerate Linear Programs
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems
- Smoothed analysis of algorithms
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- A Block-$LU$ Update for Large-Scale Linear Programming
- On the Implementation of a Primal-Dual Interior Point Method
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- New Finite Pivoting Rules for the Simplex Method
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- The Discovery of Linear Programming
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Systems of distinct representatives and linear algebra
- The Product Form for the Inverse in the Simplex Method
This page was built for publication: The double pivot simplex method
