Anonymous user
Vogel's approximation method: Difference between revisions
m
Add missing ')'; add wikipedia link for GLPK
m (added link to related task) |
m (Add missing ')'; add wikipedia link for GLPK) |
||
Line 41:
</pre>
Determine the largest difference (D or E above). In the case of ties I shall choose the one with the lowest price (in this case E because the lowest price for D is Z=15, whereas for E it is Z=11). For your choice determine the minimum cost (chosen E above so Z=11 is chosen now). Allocate as much as possible from Z to E (50 in this case limited by Z's supply).
Adjust the supply and demand accordingly. If demand or supply becomes 0 for a given task or contractor it plays no further part. In this case Z is out of it. If you choose arbitrarily, and chose D see [http://rosettacode.org/mw/index.php?title=VAM&oldid=167195 here] for the working.
Line 62:
</pre>
The optimal solution determined by [[wp:GNU Linear Programming Kit|GLPK]] is £3100:
<pre>
A B C D E
| |||