Approximations for Pareto and Proper Pareto solutions and their KKT conditions
Poonam Kesarwani, Pradyuman K. Shukla, Joydeep Dutta, Kalyanmoy Deb
Abstract
Open-access reader
Poonam Kesarwani, Pradyuman K. Shukla, Joydeep Dutta, Kalyanmoy Deb
Abstract
Open-access reader
In this article, we view the approximate version of Pareto and weak Pareto solutions of the multiobjective optimization problem through the lens of KKT type conditions. We also focus on an improved version of Geoffrion proper Pareto solutions and characterize them through saddle point and KKT type conditions. We present an approximate version of the improved Geoffrion proper solutions and propose our results in general settings.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this article, we view the approximate version of Pareto and weak Pareto solutions of the multiobjective optimization problem through the lens of KKT type conditions. We also focus on an improved version of Geoffrion proper Pareto solutions and characterize them through saddle point and KKT type conditions. We present an approximate version of the improved Geoffrion proper solutions and propose our results in general settings.
Key concepts: Karush–Kuhn–Tucker conditions, Pareto principle, Saddle point, Mathematical optimization, Focus (optics), Type (biology), Point (geometry), Pareto optimal