首页 | 本学科首页   官方微博 | 高级检索  
     检索      

S-d-invexity条件下的多目标规划和凸规划问题
引用本文:刘艳芳.S-d-invexity条件下的多目标规划和凸规划问题[J].昆明大学学报,2006,17(4):16-18.
作者姓名:刘艳芳
作者单位:云南大学,数学系,云南,昆明,650091
摘    要:新定义了一种广义的d-invexity函数,(记为S-d-invex),进而考虑了一类非线性多目标规划问题,且通过引入Pareto最优解,凸集,和凸函数的概念,得到了凸规划问题的最优结果.

关 键 词:多目标规划  (弱)Pareto最优解  S-d-invex函数  凸集  凸函数  凸规划
文章编号:1671-2056(2006)04-0016-04
收稿时间:2006-11-05
修稿时间:2006年11月5日

Multiobjective Programming under S-d-invexity and E-Convex Programming
LIU Yan-fang.Multiobjective Programming under S-d-invexity and E-Convex Programming[J].Journal of Kunming University,2006,17(4):16-18.
Authors:LIU Yan-fang
Abstract:In this paper,a new convexity which is called S-d-invex is defined;moreover,a class of nonlinear multi-objective programming problems is considered.By considering the concepts of Pareto optimal solution,E-convex sets and E-convex functions,the optimality results for E-convex programming problems are established.
Keywords:multi-objective programming  (weak) Pareto optimal solutions  S-d-invex function  E-convex sets  E-convex functions  E-convex programming
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号