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

Simplex algorithm

Known as: Surplus variable, Two-phase simplex method, Pivot operations 
In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is a popular algorithm for linear programming. The journal Computing in… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Rating platforms enable large-scale collection of user opinion about items(e.g., products or other users). However, untrustworthy… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
In this paper, we first prove that the expansion and contraction steps of the Nelder-Mead simplex algorithm possess a descent… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
A hybrid simplex artificial bee colony algorithm (HSABCA) which combines Nelder-Mead simplex method with artificial bee colony… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We introduce the smoothed analysis of algorithms, which continuously interpolates between the worst-case and average-case… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We introduce the smoothed analysis of algorithms, which is a hybrid of the worst-case and average-case analysis of algorithms… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The problem of distributing gas through a network of pipelines is formulated as a cost minimization subject to nonlinear flow… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper, we proposed simplex crossover (SPX), a multi-parent recombination operator for real-coded genetic algorithms. SPX… Expand
  • figure 2
  • figure 1
  • figure 4
  • figure 5
  • table 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The Nelder--Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Abstract : In this paper we describe the Nelder-Mead simplex method for obtaining the minimizer of a function. The Nelder-Mead… Expand
Is this relevant?
Highly Cited
1970
Highly Cited
1970
Abstract : By constructing long 'increasing' paths on appropriate convex polytopes, It is shown that the simplex algorithm for… Expand
Is this relevant?