Vogel’s Approximation Method
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
gptkb:logic |
| gptkbp:advantage |
more complex than other methods
yields better initial solution |
| gptkbp:alsoKnownAs |
gptkb:VAM
|
| gptkbp:appliesTo |
linear programming
|
| gptkbp:characteristic |
heuristic method
|
| gptkbp:contrastsWith |
Least Cost Method
North West Corner Method |
| gptkbp:developedBy |
gptkb:W._R._Vogel
|
| gptkbp:field |
optimization
|
| https://www.w3.org/2000/01/rdf-schema#label |
Vogel’s Approximation Method
|
| gptkbp:introducedIn |
1958
|
| gptkbp:step |
adjust supply and demand
calculate penalty for each row and column select row or column with highest penalty allocate as much as possible to lowest cost cell repeat until all requirements are met |
| gptkbp:usedFor |
operations research
transportation problem finding initial feasible solution |
| gptkbp:bfsParent |
gptkb:Northwest_Corner_Method
|
| gptkbp:bfsLayer |
8
|