.png){kind=icon}
返回
A survey on the continuous nonlinear resource allocation problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2006.12.006.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
convex programming
inventory
large scale optimization
logistics
nonlinear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Cardiac abnormalities in ischemic cerebrovascular disease studied by two-dimensional echocardiography..png)
Stroke
StrokeIF0
PREAI
分享收藏
查看更多内容