.png){kind=icon}
返回
Interactive stability cutting-plane algorithm for multiobjective nonlinear programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.03.037.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we introduce an interactive stability cutting-plane algorithm for determining a best-compromise solution to a multiobjective nonlinear programming problems in situations with an implicitly defined utility function. The method is called interactive stability cutting-plane compromise programming (ISCPCP). The cutting-planes which I am going to derive, are based on suitable pairwise trade-offs between the objective functions, as prescribed by the decision maker (DM) at each iterate generated by the algorithm. This algorithm requires no line searches, and generates iterates that are all contained in the efficient frontier. This feature facilitates the preference judgment of the decision maker, and permits an analyst to terminate short of optimality with an efficient near-optimal solution. Also, we investigate the stability of its efficient solutions which are obtained by using this algorithm. An illustrating example is presented to clarify this algorithm. (C) 2007 Elsevier Inc. All rights reserved.
Keyword:
cutting-plane algorithm
multiobjective nonlinear programming
trade-off method
best-compromise solution
stability
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
Cutting plane method for multiple objective stochastic integer linear programming多目标随机整数线性规划的割平面法
PREAI
分享收藏
查看更多内容