Vogel's Approximation Method
GPTKB entity
Statements (27)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:Heuristic_method
gptkb:Mathematical_algorithm |
| gptkbp:advantage |
Provides better initial solution than other methods
|
| gptkbp:alternativeName |
gptkb:VAM
|
| gptkbp:appliesTo |
Balanced transportation problems
Unbalanced transportation problems |
| gptkbp:category |
Linear programming
Optimization |
| gptkbp:introducedIn |
1958
|
| gptkbp:limitation |
Does not guarantee optimal solution
|
| gptkbp:proposedBy |
gptkb:W._R._Vogel
|
| gptkbp:publishedIn |
gptkb:Operations_Research_journal
|
| gptkbp:relatedTo |
gptkb:Stepping_Stone_Method
gptkb:Northwest_Corner_Method Least Cost Method |
| gptkbp:step |
Adjust supply and demand
Calculate penalty for each row and column Repeat until all requirements are satisfied Select row or column with highest penalty Allocate as much as possible to the lowest cost cell |
| gptkbp:usedFor |
Finding initial feasible solution
|
| gptkbp:usedIn |
Operations research
Transportation problem |
| gptkbp:bfsParent |
gptkb:Jain's_method
gptkb:Vogel_Scheme |
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Vogel's Approximation Method
|