The double pivot simplex method
type: Item
instance of: scholarly article
title: The double pivot simplex method
zbMATH Open document ID: 1390.90387
author: Fabio Vitor
author: T. Easton
published in: Mathematical Methods of Operations Research
publication date: 2018-02-09T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C49
zbMATH DE Number: 6836902
zbMATH Keywords: linear programming
zbMATH Keywords: simplex method
zbMATH Keywords: block pivots
zbMATH Keywords: multiple pivots
zbMATH Keywords: double pivots
describes a project that uses: MIPLIB
MaRDI profile type: Publication
full work available at URL: s00186-017-0610-4
OpenAlex ID: W3109606681
cites work: A stabilization of the simplex method
cites work: Q3160276
cites work: New Finite Pivoting Rules for the Simplex Method
cites work: Matrix multiplication via arithmetic progressions
cites work: Q5808752
cites work: The Product Form for the Inverse in the Simplex Method
cites work: Decomposition Principle for Linear Programs
cites work: The Discovery of Linear Programming
cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs
cites work: Systems of distinct representatives and linear algebra
cites work: A Block-$LU$ Update for Large-Scale Linear Programming
cites work: An improved primal simplex algorithm for degenerate linear programs
cites work: A suggested computation for maximal multi-commodity network flows
cites work: Updated triangular factors of the basis to maintain sparsity in the product form simplex method
cites work: Combining linear programming and automated planning to solve intermodal transportation problems
cites work: Cycling in linear programming problems
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
cites work: Interior point methods 25 years later
cites work: Homotopy perturbation technique
cites work: Q5538306
cites work: Q3266141
cites work: Novel update techniques for the revised simplex method
cites work: Pivot versus interior point methods: Pros and cons
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3050157
cites work: Q4051879
cites work: Q3491304
cites work: A primal-dual infeasible-interior-point algorithm for linear programming
cites work: A linear programming approach to discriminant analysis with a reserved-judgment region
cites work: Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
cites work: Conditional value at risk and related linear programming models for portfolio optimization
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Q4206561
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Linear optimization and extensions.
cites work: Q3592129
cites work: A new version of the improved primal simplex for degenerate linear programs
cites work: A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
cites work: A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems
cites work: Fuzzy chance constrained linear programming model for optimizing the scrap charge in steel production
cites work: Q4221106
cites work: Smoothed analysis of algorithms
cites work: Linear programming models with planned lead times for supply chain operations planning
cites work: Gaussian elimination is not optimal
cites work: A fast LU update for linear programming
cites work: Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
cites work: A mathematical programming model for scheduling steelmaking-continuous casting production
cites work: Pivot rules for linear programming: A survey on recent theoretical developments
cites work: Linear quadratic programming in oriented matroids
cites work: A stable and sparsity exploiting LU factorization of the basis matrix in linear programming
cites work: Q4858101
cites work: The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate
DOI: 10.1007/S00186-017-0610-4
description: scientific article; zbMATH DE number 6836902