首页|A FLEXIBLE OBJECTIVE-CONSTRAINT APPROACH AND A NEW ALGORITHM FOR CONSTRUCTING THE PARETO FRONT OF MULTIOBJECTIVE OPTIMIZATION PROBLEMS
A FLEXIBLE OBJECTIVE-CONSTRAINT APPROACH AND A NEW ALGORITHM FOR CONSTRUCTING THE PARETO FRONT OF MULTIOBJECTIVE OPTIMIZATION PROBLEMS
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
万方数据
维普
In this article,a novel scalarization technique,called the improved objective-constraint approach,is introduced to find efficient solutions of a given multiobjective pro-gramming problem.The presented scalarized problem extends the objective-constraint prob-lem.It is demonstrated that how adding variables to the scalarized problem,can lead to find conditions for(weakly,properly)Pareto optimal solutions.Applying the obtained necessary and sufficient conditions,two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed.These algorithms are easy to implement and can achieve an even approximation of(weakly,properly)Pareto op-timal solutions.These algorithms can be generalized for optimization problems with more than three criterion functions,too.The effectiveness and capability of the algorithms are demonstrated in test problems.
万方数据
维普
