Simplex algorithm
In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is a popular algorithm for linear programming. The name of the algorithm is derived from the concept of a simplex and was suggested by T. S. Motzkin. Simplices are not actually used in the method, but one interpretation of it is that it operates on simplicial cones, and these become proper simplices with an additional constraint. The simplicial cones in question are the corners (i.e., the neighborhoods of the vertices) of a geometric object called a polytope. The shape of this polytope is defined by the constraints applied to the objective function.
- Comment
- enIn mathematical optimization, Dantzig's simplex algorithm (or simplex method) is a popular algorithm for linear programming. The name of the algorithm is derived from the concept of a simplex and was suggested by T. S. Motzkin. Simplices are not actually used in the method, but one interpretation of it is that it operates on simplicial cones, and these become proper simplices with an additional constraint. The simplicial cones in question are the corners (i.e., the neighborhoods of the vertices) of a geometric object called a polytope. The shape of this polytope is defined by the constraints applied to the objective function.
- Depiction
- Has abstract
- enIn mathematical optimization, Dantzig's simplex algorithm (or simplex method) is a popular algorithm for linear programming. The name of the algorithm is derived from the concept of a simplex and was suggested by T. S. Motzkin. Simplices are not actually used in the method, but one interpretation of it is that it operates on simplicial cones, and these become proper simplices with an additional constraint. The simplicial cones in question are the corners (i.e., the neighborhoods of the vertices) of a geometric object called a polytope. The shape of this polytope is defined by the constraints applied to the objective function.
- Hypernym
- Algorithm
- Is primary topic of
- Simplex algorithm
- Label
- enSimplex algorithm
- Link from a Wikipage to an external page
- glossary.computing.society.informs.org/notes/Klee-Minty.pdf
- www.isye.gatech.edu/~spyros/LP/LP.html
- www.lokminglui.com/lpch3.pdf
- www.phpsimplex.com/simplex/simplex.htm%3Fl=en
- www.mathstools.com/section/main/simplex_online_calculator
- math.uww.edu/~mcfarlat/s-prob.htm
- www.simplex-m.com
- Link from a Wikipage to another Wikipage
- Algorithm
- Baire category theory
- Basic feasible solution
- Best, worst and average case
- Bland's rule
- Canonical form
- Category:1947 in computing
- Category:Computer-related introductions in 1947
- Category:Exchange algorithms
- Category:Linear programming
- Category:Optimization algorithms and methods
- Charles E. Leiserson
- Clifford Stein
- Computer science
- Cone (geometry)
- Convex polytope
- Criss-cross algorithm
- Cunningham's rule
- Cutting-plane method
- Devex algorithm
- Elementary matrix
- Ellipsoidal algorithm
- Exponential time
- Feasible region
- File:Simplex-description-en.svg
- File:Simplex-method-3-dimensions.png
- Fourier–Motzkin elimination
- General topology
- George Dantzig
- Gradient descent
- Identity matrix
- Interior point method
- Jerzy Neyman
- Karmarkar
- Karmarkar's algorithm
- Khachiyan
- Klee–Minty cube
- Lagrange multipliers on Banach spaces
- Lebesgue integral
- Linear-fractional programming
- Linear functional
- Linear programming
- Manfred W. Padberg
- Matrix transpose
- Nelder–Mead method
- NP-hardness
- NP-mighty
- Operations research
- Optimization (mathematics)
- Polynomial time
- Polytope
- Porous set
- Probability distribution
- PSPACE-complete
- Random matrix
- Revised simplex algorithm
- Ronald L. Rivest
- Simplex
- Slack variable
- Smoothed analysis
- Sparse matrix
- Structural stability
- System of linear inequalities
- Theodore Motzkin
- Thomas H. Cormen
- Victor Klee
- Wassily Leontief
- Zadeh's rule
- SameAs
- 4181488-5
- Algorithme du simplexe
- Algoritmo del simplesso
- Algoritmo simplex
- Algoritmo símplex
- Algoritm simplex
- Algorytm sympleksowy
- Lq1t
- m.01z2hh
- Metode simpleks
- Mètode símplex
- Q134164
- Simpleks algoritam
- Simpleks algoritması
- Simplex algorithm
- Simplex algorithm
- Simplex-algoritmen
- Simplex algoritmo
- Simplexmethode
- Simplexmetoden
- Simplexová metóda
- Simplexový algoritmus
- Simplex-Verfahren
- Szimplex algoritmus
- Симплекс алгоритам
- Симплекс-метод
- Симплекс-метод
- Симплекстік әдіс
- Սիմպլեքս մեթոդ
- שיטת הסימפלקס
- الگوریتم غیرمرکب
- طريقة التبسيط (برمجة)
- एकधा विधि
- সিম্প্লেক্স পদ্ধতি
- ขั้นตอนวิธีซิมเพล็กซ์
- シンプレックス法
- 单纯形法
- 단체법 (알고리즘)
- SeeAlso
- Revised simplex algorithm
- Subject
- Category:1947 in computing
- Category:Computer-related introductions in 1947
- Category:Exchange algorithms
- Category:Linear programming
- Category:Optimization algorithms and methods
- Thumbnail
- WasDerivedFrom
- Simplex algorithm?oldid=1122782557&ns=0
- WikiPageLength
- 42279
- Wikipage page ID
- 349458
- Wikipage revision ID
- 1122782557
- WikiPageUsesTemplate
- Template:About
- Template:Anchor
- Template:Authority control
- Template:Citation needed
- Template:Cite book
- Template:Colend
- Template:Div col
- Template:Further
- Template:Isbn
- Template:Main
- Template:Mathematical programming
- Template:Optimization algorithms
- Template:Reflist
- Template:See also
- Template:Short description
- Template:SubSup
- Template:Wikibooks
