| 凸多目标规划弱有效解的几个充要条件 |
| |
| 引用本文： | 安玉伟,刘庆怀.凸多目标规划弱有效解的几个充要条件[J].黑龙江科技学院学报,2002,12(3):43-44,56. |
| |
| 作者姓名： | 安玉伟 刘庆怀 |
| |
| 作者单位： | 1. 黑龙江科技学院基础部,黑龙江,鸡西,158105
2. 吉林大学,数学系,吉林,长春,130025 |
| |
| 基金项目： | 国家自然科技基金资助项目（19771043） |
| |
| 摘 要： | 在无约束规定的条件下，利用向量值函数的泰勒公式，择一定理，证明了约束多目标规划弱有效解满足的几个充要条件，将弱有效解的判断问题转化为判断一线性方程组是否存在非负，非零解的问题。
|
| 关 键 词： | 凸多目标规划 充要条件 弱有效解 约束规定 向量值函数 |
| 文章编号： | 1671-0118(2002)03-0043-02 |
Several Sufficient and Necessary Conditions about the Weak Efficient Solution for Convex Multiobjective Programming |
| |
| AN Yuwei,LIU Qinghuai.Several Sufficient and Necessary Conditions about the Weak Efficient Solution for Convex Multiobjective Programming[J].Journal of Heilongjiang Institute of Science and Technology,2002,12(3):43-44,56. |
| |
| Authors: | AN Yuwei LIU Qinghuai |
| |
| Abstract: | The paper introduced the use of the Taylor formula of the vector-valued function and Gordan Selection principle to prove several sufficient and necessary conditions about the weak efficient solution for convex multiobjective programming. The problem about how to determine the weak efficient solution of convex multiobjective programming is turned into a problem judge whether an equation has non-negative non-zero solution. |
| |
| Keywords: | multiobjective programming weak efficient solutions constraint qualifications |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
