| Article ID: | iaor2002921 |
| Country: | United Kingdom |
| Volume: | 5 |
| Issue: | 1 |
| Start Page Number: | 15 |
| End Page Number: | 23 |
| Publication Date: | Jan 1993 |
| Journal: | IMA Journal of Mathematics Applied in Business and Industry |
| Authors: | Vidal Ren Victor Valqui |
This paper presents an algorithm for the solution of a simple convex optimization problem. This problem is a generalization of several other optimization problems which have applications to resource allocation, optimal capacity expansion, and vehicle scheduling. The algorithm is based on a constraint-relaxation approach. It is easily implemented and transparent, and can be used to solve even fairly large problems by hand calculator.