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.
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… 
2013
2013
An empirical study on factors influencing the effectiveness of algorithm visualization
The determination of the factors influencing the effectiveness of algorithm visualization poses an interesting research question… 
2012
2012
A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design
Highly Cited
2012
Highly Cited
2012
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… 
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… 
2002
2002
Modeling multistage cutting stock problems
2002
2002
Row and column generation technique for a multistage cutting stock problem
2000
2000
The Revised Simplex Method Based on the LU Decomposition
Based on the Gaussian elimination technique and its relevant theory of the matrix decomposition, a variant of the revised simplex… 
2000
2000
O(n3) noniterative heuristic algorithm for linear programs with error-free implementation
Highly Cited
1977
Highly Cited
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… 
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)