Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,231,244 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
2016
2016
Revised Simplex Method
T. C. Hu
,
A. Kahng
2016
Corpus ID: 123731231
In this chapter, we will learn about a method that is mathematically equivalent to the Simplex Method but which can exploit…
Expand
Highly Cited
2013
Highly Cited
2013
A Simplified Novel Technique for Solving Fully Fuzzy Linear Programming Problems
I. Khan
,
T. Ahmad
,
N. Maan
Journal of Optimization Theory and Applications
2013
Corpus ID: 34746050
This study proposes a novel technique for solving Linear Programming Problems in a fully fuzzy environment. A modified version of…
Expand
2012
2012
A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design
M. Yaghini
,
M. Momeni
,
M. Sarmadi
Applied Soft Computing
2012
Corpus ID: 224799
2011
2011
Efficient Implementation of the Simplex Method on a CPU-GPU System
M. E. Lalami
,
V. Boyer
,
D. E. Baz
IEEE International Symposium on Parallel…
2011
Corpus ID: 16533257
The Simplex algorithm is a well known method to solve linear programming (LP) problems. In this paper, we propose a parallel…
Expand
Highly Cited
2005
Highly Cited
2005
Hyper-Sparsity in the Revised Simplex Method and How to Exploit it
J. A. Hall
,
K. McKinnon
Computational optimization and applications
2005
Corpus ID: 15967632
The revised simplex method is often the method of choice when solving large scale sparse linear programming problems…
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
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]
J. Weglarz
,
J. Blazewicz
,
W. Cellary
,
R. Słowiński
TOMS
1977
Corpus ID: 11705012
Subroutine ARSME solves a resource constrained, network scheduling problem for the case in which activities may be arbitrarily…
Expand
Highly Cited
1973
Highly Cited
1973
A revised simplex method for linear multiple objective programs
James P. Evans
,
Ralph E. Steuer
Mathematical programming
1973
Corpus ID: 32037123
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
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE