Simplex Method for Linear Programming
GPTKB entity
Statements (48)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
linear optimization
|
| gptkbp:complexity |
exponential in worst case
polynomial in practice |
| gptkbp:detects |
infeasibility
unboundedness |
| gptkbp:developedBy |
gptkb:George_Dantzig
|
| gptkbp:fieldOfStudy |
gptkb:mathematics
computer science operations research |
| gptkbp:hasApplication |
gptkb:transportation
finance logistics manufacturing telecommunications resource allocation energy management scheduling production planning network flows transportation problems diet problems |
| gptkbp:hasVariant |
dual simplex method
primal simplex method revised simplex method |
| https://www.w3.org/2000/01/rdf-schema#label |
Simplex Method for Linear Programming
|
| gptkbp:implementedIn |
many optimization software packages
|
| gptkbp:input |
linear constraints
linear objective function |
| gptkbp:introducedIn |
1947
|
| gptkbp:limitation |
cycling (rare)
|
| gptkbp:output |
optimal solution
optimal value |
| gptkbp:relatedTo |
linear programming
interior point method dual simplex method |
| gptkbp:requires |
feasible region
basic feasible solution |
| gptkbp:solvedBy |
maximization problems
minimization problems |
| gptkbp:step |
basis change
pivot operation tableau update |
| gptkbp:supportsAlgorithm |
deterministic
iterative |
| gptkbp:usedFor |
solving linear programming problems
|
| gptkbp:bfsParent |
gptkb:Top_Ten_Algorithms_of_the_20th_Century_(SIAM)
|
| gptkbp:bfsLayer |
8
|