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

T. Son () and D. Kim ()

Journal of Global Optimization, 2013, vol. 57, issue 2, 447-465

Abstract: 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. Copyright Springer Science+Business Media New York 2013

Keywords: Almost quasi $${\epsilon}$$ -Pareto solution; Quasi $${\epsilon}$$ -Pareto saddle point; $${\epsilon}$$ -Vector Lagrangian; 90C26; 49N15; 90C46 (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-012-9994-0 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:57:y:2013:i:2:p:447-465

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-012-9994-0

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().