In this paper a vector optimization problem (VOP) is considered where each component of objective and constraint function involves a term containing support function of a compact convex set. Weak and strong Kuhn−Tucker necessary optimality conditions for the problem are obtained under suitable constraint qualifications. Necessary and sufficient conditions are proved for a critical point to be a weak efficient or an efficient solution of the problem (VOP) assuming that the functions belong to different classes of pseudoinvex functions. Two Mond Weir type dual problems are considered for (VOP) and duality results are established.
Accepté le :
DOI : 10.1051/ro/2016039
Mots clés : Generalized invexity, multiobjective programming support functions, optimality conditions, Duality
@article{RO_2017__51_2_433_0,
author = {Gupta, Rekha and Srivastava, Manjari},
title = {Optimality and duality in multiobjective programming involving support functions},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {433--446},
publisher = {EDP-Sciences},
volume = {51},
number = {2},
year = {2017},
doi = {10.1051/ro/2016039},
mrnumber = {3657433},
zbl = {1365.90215},
language = {en},
url = {http://www.numdam.org/articles/10.1051/ro/2016039/}
}
TY - JOUR AU - Gupta, Rekha AU - Srivastava, Manjari TI - Optimality and duality in multiobjective programming involving support functions JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2017 SP - 433 EP - 446 VL - 51 IS - 2 PB - EDP-Sciences UR - http://www.numdam.org/articles/10.1051/ro/2016039/ DO - 10.1051/ro/2016039 LA - en ID - RO_2017__51_2_433_0 ER -
%0 Journal Article %A Gupta, Rekha %A Srivastava, Manjari %T Optimality and duality in multiobjective programming involving support functions %J RAIRO - Operations Research - Recherche Opérationnelle %D 2017 %P 433-446 %V 51 %N 2 %I EDP-Sciences %U http://www.numdam.org/articles/10.1051/ro/2016039/ %R 10.1051/ro/2016039 %G en %F RO_2017__51_2_433_0
Gupta, Rekha; Srivastava, Manjari. Optimality and duality in multiobjective programming involving support functions. RAIRO - Operations Research - Recherche Opérationnelle, Tome 51 (2017) no. 2, pp. 433-446. doi : 10.1051/ro/2016039. http://www.numdam.org/articles/10.1051/ro/2016039/
, , and , Pseudoinvexity, optimality conditions and efficiency in multiobjective problems; duality. Nonlin. Anal. 68 (2008) 24–34. | DOI | MR | Zbl
, , and , A characterization of pseudoinvexity in multiobjective programming. Math. Comput. Model. 48 (2008) 1719–1723. | DOI | MR | Zbl
, , and , A characterization of pseudoinvexity for the efficiency in non-differentiable multiobjective problems. Duality. Nonlin. Anal. 73 (2010) 1109–1117. | DOI | MR | Zbl
C.R. Bector, S. Chandra and J. Dutta, Principles of optimization theory. Narosa Publishing House, New Delhi (2005)
and , What is invexity? J. Aust. Math. Soc. Ser. B 28 (1986) 1–9. | DOI | MR | Zbl
F.H. Clarke, Optimization and nonsmooth analysis. Interscience Publication. Wiley, New York (1983). | MR | Zbl
, Invex functions and constrained local minima. J. Aust. Math. Soc. Ser. B 24 (1983) 357–366. | MR | Zbl
and , Invex functions and duality. J. Aust. Math. Soc. Ser. A 39 (1985) 1–20. | DOI | MR | Zbl
, On sufficiency of the Kuhn Tucker conditions. J. Math. Anal. Appl. 80 (1981) 545–550. | DOI | MR | Zbl
and , Jabeen, On nonlinear programing with support functions. J. Appl. Math. Comput. 10 (2002) 83–99. | DOI | MR | Zbl
and , On fractional programming containing support functions. J. Appl. Math. Comput. 18 (2005) 361–376. | DOI | MR | Zbl
, Necessary conditions for optimality of nondifferentiable convex multiobjective programming. J. Optim. Theory Appl. 40 (1983) 167–174. | DOI | MR | Zbl
O.L. Mangasarian, Nonlinear Programming. McGraw Hill, New York (1969) | MR | Zbl
, The essence of invexity. J. Optim. Theory Appl. 47 (1985) 65–76. | DOI | MR | Zbl
and , A duality theorem for a homogeneous fractional programming problem. J. Optim. Theory Appl. 25 349–359 (1978) | DOI | MR | Zbl
, and , Generalized convexity in multiobjective programming. J. Math. Anal. Appl. 233 (1999) 205–220. | DOI | MR | Zbl
, and , Invex functions and generalized convexity in multiobjective programming. J. Optim. Theory Appl. 98 (1998) 651–661. | DOI | MR | Zbl
, A subgradient duality theorem. J. Math. Anal. Appl. 61 (1977) 850–855. | DOI | MR | Zbl
W. Stadler (ed.), Multicriteria optimization in mechanics: a survey. Appl. Mech. Rev. 37 (1984) 277–286.
W. Stadler, Multicriteria Optimization in Engineering and in the Sciences. Plenum Press, New York (1988). | MR | Zbl
Cité par Sources :
