Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,772,525 papers from all fields of science
Search
Sign In
Create Free Account
Simplex algorithm
Known as:
Surplus variable
, Two-phase simplex method
, Pivot operations
Expand
In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is a popular algorithm for linear programming. The journal Computing in…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
48 relations
Algorithm
Best, worst and average case
Big M method
Bland's rule
Expand
Broader (1)
Linear programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Implementing the Nelder-Mead simplex algorithm with adaptive parameters
Fuchang Gao
,
Lixing Han
Comput. Optim. Appl.
2012
Corpus ID: 9211872
In this paper, we first prove that the expansion and contraction steps of the Nelder-Mead simplex algorithm possess a descent…
Expand
Highly Cited
2004
Highly Cited
2004
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
D. Spielman
,
S. Teng
2004
Corpus ID: 53229228
We introduce the smoothed analysis of algorithms, which continuously interpolates between the worst-case and average-case…
Expand
Highly Cited
2001
Highly Cited
2001
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
D. Spielman
,
S. Teng
STOC '01
2001
Corpus ID: 1471
We introduce the smoothed analysis of algorithms, which is a hybrid of the worst-case and average-case analysis of algorithms…
Expand
Highly Cited
2000
Highly Cited
2000
The Gas Transmission Problem Solved by an Extension of the Simplex Algorithm
D. D. Wolf
,
Y. Smeers
2000
Corpus ID: 17877053
The problem of distributing gas through a network of pipelines is formulated as a cost minimization subject to nonlinear flow…
Expand
Highly Cited
1999
Highly Cited
1999
Multi-parent recombination with simplex crossover in real coded genetic algorithms
S. Tsutsui
,
M. Yamamura
,
T. Higuchi
1999
Corpus ID: 17361792
In this paper, we proposed simplex crossover (SPX), a multi-parent recombination operator for real-coded genetic algorithms. SPX…
Expand
Highly Cited
1998
Highly Cited
1998
Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions
J. Lagarias
,
J. Reeds
,
M. H. Wright
,
P. E. Wright
SIAM J. Optim.
1998
Corpus ID: 9245771
The Nelder--Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional…
Expand
Highly Cited
1992
Highly Cited
1992
Steepest-edge simplex algorithms for linear programming
John J. H. Forrest
,
D. Goldfarb
Math. Program.
1992
Corpus ID: 25000105
We present several new steepest-edge simplex algorithms for solving linear programming problems, including variants of both the…
Expand
Highly Cited
1977
Highly Cited
1977
A practicable steepest-edge simplex algorithm
D. Goldfarb
,
J. Reid
Math. Program.
1977
Corpus ID: 40451994
It is shown that suitable recurrences may be used in order to implement in practice the steepest-edge simplex linear programming…
Expand
Highly Cited
1977
Highly Cited
1977
Linear Programming and Network Flows
M. Bazaraa
,
J. J. Jarvis
,
H. Sherali
1977
Corpus ID: 57239716
One: Introduction.Two: Linear Algebra, Convex Analysis, and Polyhedral Sets.Three: The Simplex Method.Four: Starting Solution and…
Expand
Highly Cited
1970
Highly Cited
1970
HOW GOOD IS THE SIMPLEX ALGORITHM
V. Klee
,
G. Minty
1970
Corpus ID: 117965841
Abstract : By constructing long 'increasing' paths on appropriate convex polytopes, It is shown that the simplex algorithm for…
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