Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

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

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… Expand
2013
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… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
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… Expand
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… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2010
2010
A revised simplex algorithm for fuzzy number linear programming problems using linear ranking functions
Recently, fuzzy simplex algorithms have been proposed for two kinds of fuzzy linear programming problems such as: 1) linear… Expand
2005
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… Expand
  • table 1
  • table 2
  • table 3
  • figure 3
  • table 4
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… Expand
  • table 8.1
  • table 8.2
  • table 8.3
  • table 8.4
  • table 8.5
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… Expand
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… Expand
  • table I
  • figure 2
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… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE