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… 
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… 
Highly Cited
2013
Highly Cited
2013
A Simplified Novel Technique for Solving Fully Fuzzy Linear Programming Problems
This study proposes a novel technique for solving Linear Programming Problems in a fully fuzzy environment. A modified version of… 
2012
2012
A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design
2011
2011
Efficient Implementation of the Simplex Method on a CPU-GPU System
The Simplex algorithm is a well known method to solve linear programming (LP) problems. In this paper, we propose a parallel… 
Highly Cited
2005
Highly Cited
2005
Hyper-Sparsity in the Revised Simplex Method and How to Exploit it
The revised simplex method is often the method of choice when solving large scale sparse linear programming problems… 
2005
2005
A Revised Dual Projective Pivot Algorithm for Linear Programming
  • Pingqi Pan
  • SIAM Journal on Optimization
  • 2005
  • Corpus ID: 207052868
We revise the dual projective pivot algorithm using sparse rectangular LU factors. In each iteration, the proposed algorithm… 
2002
2002
Modeling multistage cutting stock problems
  • E. Zak
  • European Journal of Operational Research
  • 2002
  • Corpus ID: 36157042
1977
1977
Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
Subroutine ARSME solves a resource constrained, network scheduling problem for the case in which activities may be arbitrarily… 
Highly Cited
1973
Highly Cited
1973
A revised simplex method for linear multiple objective programs
For linear multiple-objective problems, a necessary and sufficient condition for a point to be efficient is employed in the… 
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)