Abstract
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.
| Original language | English |
|---|---|
| Journal | IMA Journal of Mathematics Applied in Business and Industry |
| Volume | 5 |
| Pages (from-to) | 15-23 |
| ISSN | 0953-0061 |
| Publication status | Published - 1994 |
Keywords
- optimization
- applications
- convex problem