Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:advantage |
efficient for certain types of problems
|
| gptkbp:approach |
iterative
|
| gptkbp:canBe |
sensitivity analysis
integer programming (as a subroutine) reoptimization |
| gptkbp:category |
linear programming algorithm
|
| gptkbp:developedBy |
W. Orchard-Hays
|
| gptkbp:field |
operations research
mathematical optimization |
| https://www.w3.org/2000/01/rdf-schema#label |
Dual simplex method
|
| gptkbp:input |
linear program in standard form
|
| gptkbp:introducedIn |
1950s
|
| gptkbp:output |
optimal solution to linear program
|
| gptkbp:relatedTo |
simplex method
primal simplex method revised simplex method |
| gptkbp:solvedBy |
linear programs with infeasible primal but feasible dual
|
| gptkbp:step |
checks for primal feasibility at each iteration
selects leaving variable based on dual feasibility updates basis to maintain dual feasibility |
| gptkbp:usedFor |
solving linear programming problems
|
| gptkbp:usedIn |
commercial optimization solvers
|
| gptkbp:bfsParent |
gptkb:Simplex_Method
|
| gptkbp:bfsLayer |
6
|