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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Optimization problems lie at the core of scientific and engineering endeavors. Solutions to these problems are often compute… 
2016
2016
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
This study proposes a novel technique for solving Linear Programming Problems in a fully fuzzy environment. A modified version of… 
2011
2011
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
The revised simplex method is often the method of choice when solving large scale sparse linear programming problems… 
2005
2005
  • 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
  • E. Zak
  • European Journal of Operational Research
  • 2002
  • Corpus ID: 36157042
1977
1977
Subroutine ARSME solves a resource constrained, network scheduling problem for the case in which activities may be arbitrarily… 
Highly Cited
1973
Highly Cited
1973
For linear multiple-objective problems, a necessary and sufficient condition for a point to be efficient is employed in the…