A New Global Scalarization Method for Multiobjective Optimization with an Arbitrary Ordering Cone  被引量:1

A New Global Scalarization Method for Multiobjective Optimization with an Arbitrary Ordering Cone

在线阅读下载全文

作  者:El-Desouky Rahmo Marcin Studniarski 

机构地区:[1]Department of Mathematics, Faculty of Science, Taif University, Khurma, Kingdom of Saudi Arabia [2]Mathematics Department, Faculty of Science, Mansoura University, Mansoura, Egypt [3]Faculty of Mathematics and Computer Science, University of Lódé , Lódé , Poland

出  处:《Applied Mathematics》2017年第2期154-163,共10页应用数学(英文)

摘  要:We propose a new scalarization method which consists in constructing, for a given multiobjective optimization problem, a single scalarization function, whose global minimum points are exactly vector critical points of the original problem. This equivalence holds globally and enables one to use global optimization algorithms (for example, classical genetic algorithms with “roulette wheel” selection) to produce multiple solutions of the multiobjective problem. In this article we prove the mentioned equivalence and show that, if the ordering cone is polyhedral and the function being optimized is piecewise differentiable, then computing the values of a scalarization function reduces to solving a quadratic programming problem. We also present some preliminary numerical results pertaining to this new method.We propose a new scalarization method which consists in constructing, for a given multiobjective optimization problem, a single scalarization function, whose global minimum points are exactly vector critical points of the original problem. This equivalence holds globally and enables one to use global optimization algorithms (for example, classical genetic algorithms with “roulette wheel” selection) to produce multiple solutions of the multiobjective problem. In this article we prove the mentioned equivalence and show that, if the ordering cone is polyhedral and the function being optimized is piecewise differentiable, then computing the values of a scalarization function reduces to solving a quadratic programming problem. We also present some preliminary numerical results pertaining to this new method.

关 键 词:MULTIOBJECTIVE Optimization SCALARIZATION Function Generalized JACOBIAN VECTOR CRITICAL Point 

分 类 号:O1[理学—数学]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象