Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,357,958 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Basis (linear algebra)
Karush–Kuhn–Tucker conditions
Lagrange multiplier
Mathematical optimization
Expand
Broader (2)
Linear programming
Operations 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
Usman Ali Shah
,
S. Yousaf
,
Iftikhar Ahmad
,
S. Rehman
,
Muhammad Ovais Ahmad
IEEE Access
2020
Corpus ID: 214623786
Optimization problems lie at the core of scientific and engineering endeavors. Solutions to these problems are often compute…
Expand
2019
2019
Revised Simplex Method
A. Bhunia
,
Laxminarayan Sahoo
,
A. Shaikh
Springer Optimization and Its Applications
2019
Corpus ID: 213711217
The objective of this chapter is to discuss: The revised simplex methods and their computational procedures The…
Expand
2018
2018
Effective Implementation of GPU-based Revised Simplex algorithm applying new memory management and cycle avoidance strategies
Arash Raeisi Gahrouei
,
M. Ghatee
arXiv.org
2018
Corpus ID: 3843635
Graphics Processing Units (GPUs) with high computational capabilities used as modern parallel platforms to deal with complex…
Expand
2010
2010
A revised simplex algorithm for fuzzy number linear programming problems using linear ranking functions
S. Nasseri
,
B. Khabiri
2010
Corpus ID: 115548331
Recently, fuzzy simplex algorithms have been proposed for two kinds of fuzzy linear programming problems such as: 1) linear…
Expand
2006
2006
Comparative Analysis for the Simplex Method and the Revised Simplex Method
Liu Hui
2006
Corpus ID: 124287318
The comparative analysis on the simplex method and the revised simplex method in solving the equations of the linear program have…
Expand
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…
Expand
2005
2005
A MODIFICATION OF REVISED SIMPLEX METHOD
M. Petković
,
P. Stanimirović
,
N. Stojkovic
2005
Corpus ID: 31382850
We introduce a modification of the revised simplex method, which accelerates the process of finding the first basic feasible…
Expand
2000
2000
The Revised Simplex Method Based on the LU Decomposition
W. Zhong
2000
Corpus ID: 124294784
Based on the Gaussian elimination technique and its relevant theory of the matrix decomposition, a variant of the revised simplex…
Expand
1996
1996
PARSMI, a Parallel Revised Simplex Algorithm Incorporating Minor Iterations and Devex Pricing
J. A. J. Hall
,
K. McKinnon
Workshop on Applied Parallel Computin
1996
Corpus ID: 14009481
When solving linear programming problems using the revised simplex method, two common variants are the incorporation of minor…
Expand
1977
1977
Number of operations for updating the elimination form of the basis-inverse of the revised simplex-algorithm
C. Mandl
Computing
1977
Corpus ID: 28340600
Some results on the number of operations, that are needed to update the elimination form of the basis inverse of a linear program…
Expand
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)
ACCEPT & CONTINUE