| Abstract: | A procurement problem, as formulated by Murty [10], is that of determining how many pieces of equipment units of each of m types are to be purchased and how this equipment is to be distributed among n stations so as to maximize profit, subject to a budget constraint. We have considered a generalization of Murty's procurement problem and developed an approach using duality to exploit the special structure of this problem. By using our dual approach on Murty's original problem, we have been able to solve large problems (1840 integer variables) with very modest computational effort. The main feature of our approach is the idea of using the current evaluation of the dual problem to produce a good feasible solution to the primal problem. In turn, the availability of good feasible solutions to the primal makes it possible to use a very simple subgradient algorithm to solve the dual effectively. |
