一类可微广义凸规划的最优性充分条件

Optimality sufficient condition of a class of differentiable generalized convex programming

利用 Ben- Tal广义代数运算 ,提出了几类广义 ρ-凸函数的定义 ,并在一定的假设条件下 ,讨论和得到了一类可微广义凸规划的最优性充分条件。

Several classes of generalized ρ convex functions are presented by using Ben Tal generalized algebraic operation. Under the weak assumptions, optimality sufficient condition of generalized convex programming is given.