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

广义凸规划的最优性条件
引用本文:王艳.广义凸规划的最优性条件[J].内江师范学院学报,2009,24(10):30-32.
作者姓名:王艳
作者单位:重庆师范大学数学与计算机科学学院,重庆,400047
摘    要:把多目标规划问题转化为单目标规划问题,利用强伪不变凸函数和强拟不变凸函数,得出了在K-T条件下多目标规划问题(VP)(弱)有效解存在的存在性定理,并给出了相应的证明.

关 键 词:强伪不变凸函数  强拟不变凸函数  多目标规划

The Optimality Conditions for Generalized Convex Programming
WANG Yan.The Optimality Conditions for Generalized Convex Programming[J].Journal of Neijiang Teachers College,2009,24(10):30-32.
Authors:WANG Yan
Institution:WANG Yan (College of Mathematics and Computer Science, Chongqing Normal University, Chongqing 400047, China)
Abstract:Through transformation of multi-objective programming problem into a single-objective programming problem and by use of strong pseudo-invariant convex function and strong quasi-invariant convex function, an efficient-solution existence theorem for the multi-objective programming problem(VP) under the Kuhn-Tucher condition is obtained and proven valid.
Keywords:strong pseudo-invariant convex function  strong quasi-invariant convex function  multi-objective programming
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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