.png){kind=icon}
返回
Inverse optimization for linearly constrained convex separable programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2009.01.043.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study inverse optimization for linearly constrained convex separable programming problems that have wide applications in industrial and managerial areas. For a given feasible point of a convex separable program, the inverse optimization is to determine whether the feasible point can be made optimal by adjusting the parameter values in the problem, and when the answer is positive, find the parameter values that have the smallest adjustments. A sufficient and necessary condition is given for a feasible point to be able to become optimal by adjusting parameter values. inverse optimization formulations are presented with l(1) and l(2) norms. These inverse optimization problems are either linear programming when l(1) norm is used in the formulation, or convex quadratic separable programming when l(2) norm is used. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Inverse optimization
Convex separable program
KKT conditions
Linear programming
Quadratic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容