Article ID: | iaor20001781 |
Country: | Netherlands |
Volume: | 112 |
Issue: | 3 |
Start Page Number: | 570 |
End Page Number: | 581 |
Publication Date: | Feb 1999 |
Journal: | European Journal of Operational Research |
Authors: | Pilot Chris, Pilot Steve |
Keywords: | programming: transportation, optimization, networks |
We present a simple mathematical model which will relate the actual cost spent in accomplishing a task to the dollars budgeted for that task. In the specific instances of assignment and transportation problems we show how to minimize total dollars spent given total dollars allocated. We show furthermore how to quantitatively measure the work done along each arc in such problems. The total work, which will measure how fixed costs are realized across various arcs for a given prescribed effort, can then be minimized. It is shown that this, in general, leads to a third type of optimal solution which is different from those optimal solutions obtained by minimizing either total cost or total dollars allocated.