Abstract
In this paper, we study optimality conditions for vector optimization problems of a difference of convex mappings
where \(f:=(f_{1},\ldots,f_{p}),g:=(g_{1},\ldots,g_{p}) h:=(h_{1},\ldots,h_{m}), k:=(k_{1},\ldots,k_{m}), Q\) is a closed convex cone in a Banach space Z, l is a mapping Q-convex from a Banach space X into Z, A is a continuous linear operator from X into a Banach space \(W, {\mathbb R}_{+}^{p}\) and \({\mathbb R}_{+}^{m}\) are respectively the nonnegative orthants of \({\mathbb R}^{p}\) and \({\mathbb R}^{m}\), C is a nonempty closed convex subset of X, b∈W, and the functions f i ,g i ,h j and k j are convex for i=1,...,p and j=1,ldots,m. Necessary optimality conditions for (VP) are established in terms of Lagrange-Fritz-John multipliers. When the set of constraints for (VP) is convex and under the generalized Slater constraint qualification introduced in Jeyakumar and Wolkowicz [11] , we derive necessary optimality conditions in terms of Lagrange-Karush-Kuhn-Tucker multipliers which are also sufficient whenever the functions g i ,i=1,...,p are polyhedrals. Our approach consists in using a special scalarization function. A necessary optimality condition for convex vector maximization problem is derived. Also an application to vector fractional mathematical programming is given. Our contribution extends the results obtained in scalar optimization by Hiriart-Urruty [9] and improve substantially the few results known in vector case (see for instance: [11], [12] and [14]).
Similar content being viewed by others
References
Amahroq T. and Taa A. (1997). On Lagrange–Kuhn–Tucker multipliers for multiobjective optimization problems, 41, 159–172.
H. Attouch H. Brezis (1986) Duality for the Sum of Convex Functions in General Banach Spaces J.A. Barroso (Eds) Aspects of Mathematics and its Application Elsevier Science Publishers B.V. Amsterdam 125–133
Y. Censor (1977) ArticleTitlePareto optimality in multiobjective problems Applied Mathematics and Optimization 4 41–59 Occurrence Handle10.1007/BF01442131
M. Ciligot-Travain (1994) ArticleTitleOn Lagrange–Kuhn–Tucker multipliers for Pareto optimization problems Numer. Funct. Anal. Optim. 15 689–693
A. Charnes W.W. Cooper Z.M. Huang Q.L. Wei (1990) ArticleTitleFundamental theorems of nondominated solutions associated with cones in normed linear spaces Journal of Mathematical Analysis and Applications 150 54–78 Occurrence Handle10.1016/0022-247X(90)90195-L
A. Charnes Z.M. Huang J.J. Rousseau Q.L. Wei (1990) ArticleTitleCone extremal solutions of multi-payoff games with cross-constrained strategy sets Optimization 21 51–69
J.P. Dauer O.A. Saleh (1993) ArticleTitleA characterization of proper minimal points as solutions of sublinear optimization problems J. Mathematical Analysis and Applications 178 227–246 Occurrence Handle10.1006/jmaa.1993.1303
J.B. Hiriart-Urruty (1979) ArticleTitleTangent cones, generalized gradients and mathematical programming in banach spaces Math. Ope. Res. 4 79–97
Hiriart-Urruty, J.B. (1989), From Convex Optimization to Nonconvex Optimization. In: Clarke, F.H., Demyanov, V.F. and Giannessi, F. (eds.), Nonsmooth Optimization and Related Topics, Plenum Press, pp. 219–239.
J.B. Hiriart-Urruty C. Lemaréchal (1993) Convex Analysis and Minimization Algo rithms I Springer Verlag Berlin, Germany
V. Jeyakumar H. Wolkowicz (1992) ArticleTitleGeneralizations of Slater’s constraint qualification for infinite convex programs Mathematical Programming 57 85–101 Occurrence Handle10.1007/BF01581074
P. Kanniappan (1983) ArticleTitleNecessary conditions for optimality of nondifferentiable convex multiobjective programming Journal of Optimization Theory and Applications 40 IssueID2 167–173 Occurrence Handle10.1007/BF00933935
S.X. Li (1996) ArticleTitleQuasiconvexity and nondominated solutions in multiobjective programming Journal of Optimization Theory and Applications 88 1997–208
M. Minami (1981) ArticleTitleWeak Pareto optimality of multiobjective problems in locally convex linear topological space Journal of Optimization Theory and Applications 34 IssueID4 469–484 Occurrence Handle10.1007/BF00935888
Moreau J.-J. (1967). Fonctionelles Convexes, Mimeographed Lecture Notes, Collège de France.
Rockafellar, R.T. (1974), Conjugate duality and optimization, Conference Board of Mathematical Sciences Series 16, SIAM, Publications, Philadelphia.
Rockafellar, R.T. (1970), Convex Analysis, Princeton University Press
B. Rodriguez S. Simons (1988) ArticleTitleConjugate functions and subdifferentials in normed situations for operators with complete graphs Nonlinear Analysis 12 1069–1078 Occurrence Handle10.1016/0362-546X(88)90102-2
C. Swartz (1987) ArticleTitlePschenichny’s theorem for vector optimization Journal of Optimization Theory and Appli. 53 309–317 Occurrence Handle10.1007/BF00939223
A. Taa (1999) ArticleTitleOptimality conditions for vector mathematical programming via a theorem of the alternative Journal of Mathematical Analysis and Applications 233 233–245 Occurrence Handle10.1006/jmaa.1999.6288
P.L. Yu (1985) Multiple-Criteria Decisions Making: Concepts, Techniques, and Extensions Plenum New York
Author information
Authors and Affiliations
Corresponding author
Additional information
Mathematics Subject Classification (1991). Primary: 90C29; Secondary 49K30
Rights and permissions
About this article
Cite this article
Taa, A. Optimality Conditions for Vector Optimization Problems of a Difference of Convex Mappings. J Glob Optim 31, 421–436 (2005). https://doi.org/10.1007/s10898-004-6874-2
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-6874-2