Approximations for Pareto and Proper Pareto Solutions and Their KKT Conditions.

Kesarwani P.,Shukla P. K.,Dutta J.,Deb K.

Mathematical methods of operations research（2022）

Cited 2|Views8

No score

Abstract

In this article, we view the Pareto and weak Pareto solutions of the multiobjective optimization by using an approximate version of KKT type conditions. In one of our main results Ekeland’s variational principle for vector-valued maps plays a key role. We also focus on an improved version of Geoffrion proper Pareto solutions and it’s approximation and characterize them through saddle point and KKT type conditions.

Translated text

Key words

Convex functions,Locally Lipschitz functions,Multi objective optimisation,Pareto minimum,Proper Pareto minimum,Saddle point

AI Read Science

Must-Reading Tree

Example

Generate MRT to find the research sequence of this paper

Chat Paper

Summary is being generated by the instructions you defined