Multiobjective optimization problems with modified objective functions and cone constraints and applications

被引：0
作者：
Jia Wei Chen
Yeol Je Cho
Jong Kyu Kim
Jun Li
机构：
[1] China West Normal University,School of Mathematics and Information
[2] Gyeongsang National University,Department of Mathematics Education and The RINS, College of Education
[3] Kyungnam University,Department of Mathematics
来源：
Journal of Global Optimization | 2011年 / 49卷
关键词：
Multiobjective optimization problem; -(pseudo)invex; -convexlike; Weakly efficient solution; Saddlepoint; KKT condition; Weak (strong, converse) duality; Lagrange function; 90C29; 90C46; 47J20;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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, (MOP)η(x)] and saddle points for the Lagrange function of (MOP)η(x) 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 (MOP)η(x) 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.
引用
收藏
页码：137 / 147
页数：10
相关论文
共 23 条
  • [1] Aghezzaf B.(2000)Generalized invexity and duality in multiobjective programming problems J. Global Optim. 18 91-101
  • [2] Hachimi M.(2003)A new approach to multiobjective programming with a modified objective function J. Global Optim. 27 485-495
  • [3] Antczak T.(2004)An Num. Funct. Anal. Optim. 25 423-438
  • [4] Antczak T.(2005)-approximation approach for nonlinear mathematical programming problems involving invex functions J. Optim. Theory Appl. 126 23-40
  • [5] Antczak T.(2005)Modified ratio objective approach in mathematical programming Nonlinear Anal. 63 236-255
  • [6] Antczak T.(2006)An J. Math. Anal. Appl. 315 555-567
  • [7] Antczak T.(2001)-approximation method in nonlinear vector optimization Asia-Pacific J. Oper. Res. 18 257-272
  • [8] Dutta J.(1987)An J. Math. Anal. Appl. 126 469-477
  • [9] Eguda R.R.(1981)-approximation approach to duality in mathematical programming problems involving J. Math. Anal. Appl. 80 545-550
  • [10] Hanson M.A.(1997)-invex functions J. Math. Anal. Appl. 205 330-336
123