Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:alternativeTo |
MODI Method
|
| gptkbp:appliesTo |
balanced transportation problems
unbalanced transportation problems |
| gptkbp:category |
linear programming
|
| https://www.w3.org/2000/01/rdf-schema#label |
Stepping Stone Method
|
| gptkbp:originatedIn |
20th century
|
| gptkbp:purpose |
find optimal solution for transportation problems
|
| gptkbp:relatedTo |
MODI Method
|
| gptkbp:requires |
initial basic feasible solution
|
| gptkbp:step |
adjust allocations along closed path
calculate opportunity cost for unused routes identify unused routes repeat until no negative opportunity cost select route with most negative opportunity cost |
| gptkbp:usedIn |
operations research
transportation problem |
| gptkbp:bfsParent |
gptkb:Vogel's_Approximation_Method
|
| gptkbp:bfsLayer |
8
|