4.5 Article

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

Journal

JOURNAL OF GLOBAL OPTIMIZATION
Volume 57, Issue 2, Pages 447-465

Publisher

SPRINGER
DOI: 10.1007/s10898-012-9994-0

Keywords

Almost quasi epsilon-Pareto solution; Quasi epsilon-Pareto saddle point; epsilon-Vector Lagrangian

Funding

  1. Basic Science Research Program through the National Research Foundation of Korea (NRF)
  2. Ministry of Education, Science and Technology [2010-0012780]
  3. National Foundation for Science and Technology Development (NAFOSTED), Vietnam
  4. National Research Foundation of Korea [2010-0012780] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available