×

zbMATH — the first resource for mathematics

Optimality conditions for D.C. vector optimization problems under reverse convex constraints. (English) Zbl 1121.90403
Summary: In this paper, we establish global necessary and sufficient optimality conditions for D.C. vector optimization problems under reverse convex constraints. An application to vector fractional mathematical programming is also given.

MSC:
90C29 Multi-objective and goal programming
90C46 Optimality conditions and duality in mathematical programming
PDF BibTeX XML Cite
Full Text: DOI
References:
[3] Clarke F.H. (1983). Optimization and Nonsmooth Analysis,Wiley-Interscience. · Zbl 0582.49001
[8] Gadhi N., Metrane A. Sufficient Optimality Condition for Vector Optimization Problems Under D.C. Data, To appear in Journal of Global Optimization. · Zbl 1061.90098
[11] Hiriart-Urruty JB. (1989). From Convex Optimization to Nonconvex Optimization. Nonsmooth Optimization and related Topics. In: Clarke, F.H., Demyanov, V.F. and Giannessi, F. (eds.), Plenum Press, pp. 219–239. · Zbl 0735.90056
[14] Lemaire B. (1995). Subdifferential of a convex composite functional. Application to optimal control in variational inequalities in Nondifferentiable Optimizaton. In:Proceeding Sopron, September 1984 lecture notes in economics and mathematical systems. springer, pp. 103–117.
[15] Lemaire B., Volle M. (1998). Duality in D.C. programing, in nonconvex optimization and its applications, 27, 331–345. · Zbl 0961.90127
[17] Levin V.L. On the subdifferential of a composite functional. Soviet Mathematical Doklady. 11: 1194–1195 · Zbl 0222.46001
[20] Michelot C. (1987). Caractérisation des minima locaux des fonctions de la classe D.C. Université de Dijon.
[28] Tao PD., Souad EB. (1988). Duality in D.C. optimization. Subgradient methods Trends in mathematical optimization. Internat. Ser. Numer. Math. 84(c), Birkhauser Verlag, Bassel, pp. 277–293.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.