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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Hyperspectral unmixing aims at identifying the hidden spectral signatures (or endmembers) and their corresponding proportions (or… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The problem of distributing gas through a network of pipelines is formulated as a cost minimization subject to nonlinear flow… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We propose EMD-L1: a fast and exact algorithm for computing the earth mover's distance (EMD) between a pair of histograms. The… (More)
  • 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 multiparent recombination operator for real-coded genetic algorithms. SPX… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 5
  • table 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper, we propose a general tridimensional reconstruction algorithm of range and volumetric images, based on deformable… (More)
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… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We describe a randomized variant of the simplex algcrrithm. The expected number of arithmetic operations required by our… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A new global optimization algorithm for functions of continuous variables is presented, derived from the “Simulated Annealing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table II
Is this relevant?
Highly Cited
1977
Highly Cited
1977
It is shown that suitable recurrences may be used in order to implement in practice the steepest-edge simplex linear programming… (More)
Is this relevant?
Highly Cited
1975
Highly Cited
1975
Large practical linear and integer programming problems are not always presented in a form which is the most compact… (More)
  • table 1
  • table 3
  • table 4
  • table 5
  • table 8
Is this relevant?