.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
cutting-plane algorithm
multiobjective nonlinear programming
trade-off method
best-compromise solution
stability
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more