Skip to search formSkip to main contentSkip to account menu

Revised simplex method

Known as: Revised simplex algorithm 
In mathematical optimization, the revised simplex method is a variant of George Dantzig's simplex method for linear programming. The revised simplex… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Basis (linear algebra)Karush–Kuhn–Tucker conditionsLagrange multiplierMathematical optimization

Broader (2)

Linear programmingOperations research

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Accelerating Revised Simplex Method Using GPU-Based Basis Update
Optimization problems lie at the core of scientific and engineering endeavors. Solutions to these problems are often compute… 
2019
2019
Revised Simplex Method
The objective of this chapter is to discuss: The revised simplex methods and their computational procedures The… 
2018
2018
Effective Implementation of GPU-based Revised Simplex algorithm applying new memory management and cycle avoidance strategies
Graphics Processing Units (GPUs) with high computational capabilities used as modern parallel platforms to deal with complex… 
2016
2016
Revised Simplex Method
In this chapter, we will learn about a method that is mathematically equivalent to the Simplex Method but which can exploit… 
2015
2015
Parallelization of Revised Simplex Algorithm on GPUs
This paper develops a novel Single Instruction Multiple Data (SIMD) Architecture processors (GPUs) based RSA algorithm and… 
2013
2013
A Parallel Implementation of the Revised Simplex Algorithm Using OpenMP: Some Preliminary Results
Linear Programming (LP) is a significant research area in the field of operations research. The simplex algorithm is the most… 
2010
2010
Optimizations for Tensorial Bernstein-Based Solvers by Using Polyhedral Bounds
The tensorial Bernstein basis for multivariate polynomials in n variables has a number 3n of functions for degree 2. Consequently… 
2005
2005
A Revised Dual Projective Pivot Algorithm for Linear Programming
We revise the dual projective pivot algorithm using sparse rectangular LU factors. In each iteration, the proposed algorithm… 
1998
1998
Approaches to the Incremental Detection of Implicit Equalities with the Revised Simplex Method
This paper deals with the incremental detection of implicit equalities using the revised simplex method. This algorithm is more… 
1996
1996
PARSMI, a Parallel Revised Simplex Algorithm Incorporating Minor Iterations and Devex Pricing
When solving linear programming problems using the revised simplex method, two common variants are the incorporation of minor… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)