Multiobjective DC programs with infinite convex constraints

New results are established for multiobjective DC programs with infinite convex constraints (MOPIC) that are defined on Banach spaces (finite or infinite dimensional) with objectives given as the difference of convex functions. This class of problems can also be called multiobjective DC semi-infinit...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of global optimization Jg. 59; H. 1; S. 41 - 58
Hauptverfasser: Qu, Shaojian, Goh, Mark, Wu, Soon-Yi, De Souza, Robert
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Boston Springer US 01.05.2014
Springer
Springer Nature B.V
Schlagworte:
Banach space
Banach spaces
Computational mathematics
Computer Science
Convex analysis
Direct current
Duality theorem
Euclidean space
Investment analysis
Joints
Linear equations
Mathematical analysis
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Pareto efficiency
Pareto optimality
Pareto optimum
Real Functions
Studies
Duality
(weak) Pareto efficiency
Optimality
Saddle point
Multiobjective DC programs with infinite convex constraints
ISSN:0925-5001, 1573-2916
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:New results are established for multiobjective DC programs with infinite convex constraints (MOPIC) that are defined on Banach spaces (finite or infinite dimensional) with objectives given as the difference of convex functions. This class of problems can also be called multiobjective DC semi-infinite and infinite programs, where decision variables run over finite-dimensional and infinite-dimensional spaces, respectively. Such problems have not been studied as yet. Necessary and sufficient optimality conditions for the weak Pareto efficiency are introduced. Further, we seek a connection between multiobjective linear infinite programs and MOPIC. Both Wolfe and Mond-Weir dual problems are presented, and corresponding weak, strong, and strict converse duality theorems are derived for these two problems respectively. We also extend above results to multiobjective fractional DC programs with infinite convex constraints. The results obtained are new in both semi-infinite and infinite frameworks.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-013-0091-9