Multiobjective DC Programming with Infinite Convex Constraints
Abstract: In this paper new results are established in multiobjective DC programming with infinite convex constraints ($MOPIC$ for abbr.) that are defined on Banach space (finite or infinite) with objectives given as the difference of convex functions subject to infinite convex constraints. This problem can also be called multiobjective DC semi-infinite and infinite programming, where decision variables run over finite-dimensional and infinite-dimensional spaces, respectively. This problem has not been studied yet at present. Necessary and sufficient optimality conditions for weak Pareto-optimality are introduced. Also, we seek a connection between multiobjective linear infinite programming and $MOPIC$. The Wolfe and Mond-Weir dual problems are presented and the weak, strong and strict converse duality theorems are also derived. The results obtained are new in both semi-infinite and infinite frameworks.
Keywords: Multiobjective DC programming with infinite convex constraints, optimality, duality, saddle point, (weak) Pareto-optimality.
Category 1: Infinite Dimensional Optimization (Semi-infinite Programming )
Category 2: Convex and Nonsmooth Optimization (Nonsmooth Optimization )
Category 3: Other Topics (Multi-Criteria Optimization )
Entry Submitted: 01/18/2011
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|