期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A FLEXIBLE OBJECTIVE-CONSTRAINT APPROACH AND A NEW ALGORITHM FOR CONSTRUCTING THE PARETO FRONT OF MULTIOBJECTIVE OPTIMIZATION PROBLEMS 被引量:1
1
作者 n.hoseinpoor M.GHAZNAVI 《Acta Mathematica Scientia》 SCIE CSCD 2024年第2期702-720,共19页
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 pr... 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
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部