A FLEXIBLE OBJECTIVE-CONSTRAINT APPROACH AND A NEW ALGORITHM FOR CONSTRUCTING THE PARETO FRONT OF MULTIOBJECTIVE OPTIMIZATION PROBLEMS  

作　　者：N.HOSEINPOOR M.GHAZNAVI 

机构地区：[1]Faculty of Mathematical Sciences,Shahrood University of Technology,Shahrood,Iran

出　　处：《Acta Mathematica Scientia》2024年第2期702-720,共19页数学物理学报（B辑英文版）

摘　　要：In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. 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 optimal 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.

关 键 词：multiobjective optimization Pareto front SCALARIZATION objective-constraint approach proper efficient solution 

分 类 号：O224[理学—运筹学与控制论]