Statements (48)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alternativeTo |
interior point method
ellipsoid method |
| gptkbp:appliesTo |
gptkb:transportation
economics engineering finance logistics manufacturing |
| gptkbp:canBe |
big-M method
dual simplex primal simplex revised simplex two-phase simplex |
| gptkbp:complexity |
exponential in worst case
polynomial in practice |
| gptkbp:developedBy |
gptkb:George_Dantzig
|
| gptkbp:field |
gptkb:mathematics
computer science operations research |
| gptkbp:implementedIn |
many optimization software
|
| gptkbp:improves |
gptkb:Bland's_rule
anti-cycling rules |
| gptkbp:input |
objective function
linear inequalities |
| gptkbp:introducedIn |
1947
|
| gptkbp:limitation |
cycling
numerical instability degeneracy |
| gptkbp:output |
optimal solution
|
| gptkbp:publishedIn |
gptkb:Naval_Research_Logistics_Quarterly
|
| gptkbp:relatedTo |
gptkb:Polygon
pivot linear algebra vertex basis interior point method dual simplex method feasible region |
| gptkbp:solvedBy |
optimization problems
|
| gptkbp:step |
iteration
initialization termination |
| gptkbp:taughtAt |
university courses
|
| gptkbp:usedFor |
linear programming
|
| gptkbp:bfsParent |
gptkb:George_Dantzig
|
| gptkbp:bfsLayer |
4
|
| https://www.w3.org/2000/01/rdf-schema#label |
Simplex method
|