A survey on the continuous nonlinear resource allocation problem
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint described by a separable convex function. Applications are abundant, and vary from equilibrium problems in the engineering a...
Saved in:
Published in | European journal of operational research Vol. 185; no. 1; pp. 1 - 46 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Amsterdam
Elsevier B.V
2008
Elsevier Elsevier Sequoia S.A |
Series | European Journal of Operational Research |
Subjects | |
Online Access | Get full text |
ISSN | 0377-2217 1872-6860 |
DOI | 10.1016/j.ejor.2006.12.006 |
Cover
Loading…
Summary: | Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint described by a separable convex function. Applications are abundant, and vary from equilibrium problems in the engineering and economic sciences, through resource allocation and balancing problems in manufacturing, statistics, military operations research and production and financial economics, to subproblems in algorithms for a variety of more complex optimization models. This paper surveys the history and applications of the problem, as well as algorithmic approaches to its solution. The most common techniques are based on finding the optimal value of the Lagrange multiplier for the explicit constraint, most often through the use of a type of line search procedure. We analyze the most relevant references, especially regarding their originality and numerical findings, summarizing with remarks on possible extensions and future research. |
---|---|
Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
ISSN: | 0377-2217 1872-6860 |
DOI: | 10.1016/j.ejor.2006.12.006 |