arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.00528math.OC
收藏

多目标问题的积分全局最优性条件及一种算法

Integral Global Optimality Conditions and an Algorithm for Multiobjective Problems

Everton J. Silva, Elizabeth W. Karas, Lucelina B. Santos

AI总结:

本文针对不一定可微的多目标问题,通过加权和与Chebyshev加权标量化方法将积分全局最优性条件从单目标扩展至多目标,并提出一种基于Chebyshev标量化的算法以逼近弱Pareto前沿,通过测试问题验证了其有效性。

摘要:

本文针对不一定可微的多目标问题,提出了积分全局最优性条件。通过加权和与Chebyshev加权标量化方法,将已知适用于单目标问题的积分刻画推广至多目标问题。基于Chebyshev标量化,提出一种算法以逼近弱Pareto前沿,并通过求解一组多目标测试问题验证了其有效性。

英文摘要:

In this work, we propose integral global optimality conditions for multiobjective problems not necessarily differentiable. The integral characterization, already known for single objective problems, are extended to multiobjective problems by weighted sum and Chebyshev weighted scalarizations. Using this last scalarization, we propose an algorithm for obtaining an approximation of the weak Pareto front whose effectiveness is illustrated by solving a collection of multiobjective test problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑