摘要
本文利用广义Ben-Tal代数运算,提出了几类广义(h,φ)-凸函数的定义,并在一定的假设条件下,讨论和得到了一类广义凸规划的最优性充分条件.
In this paper, several classes of generalized convex functions are defined by using Bel-Tal generalized algebraic opreation. Under certain asumptions, optimality sufficient conditions of generalized convex programming problems are presented.
出处
《衡水学院学报》
2009年第1期4-6,共3页
Journal of Hengshui University
基金
四川省教育厅重点项目(07ZA123)
关键词
(h
φ)-凸函数
广义代数运算
K-T条件
广义凸规划
convex functions
generalized algebraic opreation
K-T condition
generalized convex programming
