e-Mixed type duality for nonconvex multiobjective programs with an infinite number of constraints

Using a scalarization method, approximate optimality conditions of a multiobjective nonconvex optimization problem which has an infinite number of constraints are established. Approximate duality theorems for mixed duality are given. Results on approximate duality in Wolfe type and Mond-Weir type ar...

Full description

Saved in:
Bibliographic Details
Published inJournal of global optimization Vol. 57; no. 2; p. 447
Main Authors Son, T.Q, Kim, D.S
Format Journal Article
LanguageEnglish
Published Springer 23.05.2022
Online AccessGet full text
ISSN0925-5001
DOI10.1007/s10898-012-9994-0

Cover

More Information
Summary:Using a scalarization method, approximate optimality conditions of a multiobjective nonconvex optimization problem which has an infinite number of constraints are established. Approximate duality theorems for mixed duality are given. Results on approximate duality in Wolfe type and Mond-Weir type are also derived. Approximate saddle point theorems of an approximate vector Lagrangian function are investigated. Keywords Almost quasi [epsilon]-Pareto solution * Quasi [epsilon]-Pareto saddle point * [epsilon]-Vector Lagrangian Mathematics Subject Classification 90C26 * 49N15 * 90C46
ISSN:0925-5001
DOI:10.1007/s10898-012-9994-0