Optimization Online


Approximations for Pareto and Proper Pareto solutions and their KKT conditions

Poonam Kesarwani (kesari.poonam24***at***gmail.com)
Pradyumn Kumar Shukla (pradyumn.shukla***at***kit.edu )
Joydeep Dutta (jdutta***at***iitk.ac.in)
Kalyanmoy Deb deb (kdeb***at***egr.msu.edu)

Abstract: There has been numerous amount of studies on proper Pareto points in multiobjective optimization theory. Geoffrion proper points are one of the most prevalent form of proper optimality. Due to some convergence issues a restricted version of these proper points, Geoffrion proper points with preset bounds has been introduced recently. Since solution of any algorithm for multiobjective optimization problem gives rise to approximate solution set, in this article we study the approximate version of Geoffrion proper points with preset bounds. We investigate scalarization results and saddle point condition for these points. We also study the notion of approximate KKT condition for multiobjective optimization problem in general settings. Further, we discuss notion of approximate Benson proper point and develop KKT condition for the same.

Keywords: Multi-Criteria Optimization, Approximate solutions, Geoffrion proper optimality, Benson proper optimality

Category 1: Other Topics (Multi-Criteria Optimization )

Citation: Indian Institute of Technology, Kanpur India

Download: [PDF]

Entry Submitted: 10/06/2018
Entry Accepted: 10/06/2018
Entry Last Modified: 02/08/2019

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society