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.
|Journal||IMA Journal of Mathematics Applied in Business and Industry|
|Publication status||Published - 1994|
- convex problem