Multiobjective optimization problems with modified objective functions and cone constraints and applications. (English) Zbl 1230.90166

Summary: In this paper, we consider a differentiable multiobjective optimization problem with generalized cone constraints (for short, MOP). We investigate the relationship between weakly efficient solutions for (MOP) and for the multiobjective optimization problem with the modified objective function and cone constraints [for short, \((\text{MOP})_{\eta}(x)\)] and saddle points for the Lagrange function of \((\text{MOP})_{\eta}\) involving cone invex functions under some suitable assumptions. We also prove the existence of weakly efficient solutions for (MOP) and saddle points for Lagrange function of \((\text{MOP})_{\eta}\) by using the Karush-Kuhn-Tucker type optimality conditions under generalized convexity functions. As an application, we investigate a multiobjective fractional programming problem by using the modified objective function method.


90C29 Multi-objective and goal programming
90C46 Optimality conditions and duality in mathematical programming
47J20 Variational and other types of inequalities involving nonlinear operators (general)
Full Text: DOI


[1] Aghezzaf B., Hachimi M.: Generalized invexity and duality in multiobjective programming problems. J. Global Optim. 18, 91–101 (2000) · Zbl 0970.90087
[2] Antczak T.: A new approach to multiobjective programming with a modified objective function. J. Global Optim. 27, 485–495 (2003) · Zbl 1059.90126
[3] Antczak T.: An {\(\eta\)}-approximation approach for nonlinear mathematical programming problems involving invex functions. Num. Funct. Anal. Optim. 25, 423–438 (2004) · Zbl 1071.90032
[4] Antczak T.: Modified ratio objective approach in mathematical programming. J. Optim. Theory Appl. 126, 23–40 (2005) · Zbl 1093.90061
[5] Antczak T.: An {\(\eta\)}-approximation method in nonlinear vector optimization. Nonlinear Anal. 63, 236–255 (2005) · Zbl 1093.90053
[6] Antczak T.: An {\(\eta\)}-approximation approach to duality in mathematical programming problems involving r-invex functions. J. Math. Anal. Appl. 315, 555–567 (2006) · Zbl 1140.90048
[7] Bonnans J.F., Shapiro A.: Perturbation Analysis of Optimization Problem. Springer-Verlag, New York (2000) · Zbl 0966.49001
[8] Craven, B.D.: Control and Optimization. Chapman & Hall (1995) · Zbl 0915.49002
[9] Crouzeix J.P., Martinez-Legaz, J.E., Volle, M.: Generalized convexity, generalized monotonicity, proceedings of the fifth symposium on generalized convexity, Kluwer Academic Publishers, Luminy, France, (1997)
[10] Dutta J.: On generalized preinvex functions. Asia-Pacific J. Oper. Res. 18, 257–272 (2001) · Zbl 1042.90603
[11] Eguda R.R., Hanson M.A.: Multiobjective duality with invexity. J. Math. Anal. Appl. 126, 469–477 (1987) · Zbl 0635.90086
[12] Giannessi, F. (eds): Vector Variational Inequalities and Vector Equilibrium. Kluwer Academic Publishers, Dordrechet, Boston, London (2000) · Zbl 0952.00009
[13] Hanson M.A.: On sufficiency of the Kuhn-Tucker conditions. J. Math. Anal. Appl. 80, 545–550 (1981) · Zbl 0463.90080
[14] Khan Z.A., Hanson M.A.: On ratio invexity in mathematical programming. J. Math. Anal. Appl. 205, 330–336 (1997) · Zbl 0872.90094
[15] Li L., Li J.: Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints. Appl. Math. Lett. 21, 599–606 (2008) · Zbl 1191.90057
[16] Luc D.T.: Theory of Vector Optimization. Springer-Verlag, Berlin (1989) · Zbl 0688.90051
[17] Mishra S.K., Wang S.Y., Lai K.K.: Optimality and duality in nondifferentiable and multiobjective programming under generalized d-invexity. J. Global Optim. 29, 425–438 (2004) · Zbl 1119.90071
[18] Weir T., Jeyakumar V.: A class of nonconvex functions and mathematical programming. Bull. Austral. Math, Soc. 38, 177–189 (1988) · Zbl 0639.90082
[19] Weir T., Mond B., Craven B.D.: On duality for weakly minimized vector valued optimization. Optimiz. 17, 711–721 (1986) · Zbl 0606.49011
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.