关于约束分类问题的研究  

DISCUSSIONS ABOUT CONSTRAINT CLASSIFICATION

作　　者：刘晓敏[1] 刘善存[1] 

机构地区：[1]北京航空航天大学应用数理系

出　　处：《北京航空航天大学学报》1995年第2期107-113,共7页Journal of Beijing University of Aeronautics and Astronautics

摘　　要：约束条件的分类对于简化数学规划问题的求解具有重要意义．对于凸函数ｇｉ（ｘ）（ｉ＝１，２，…，ｎ）给出了约束ｇｉ（ｘ）≤０是必要约束或多余约束的充要条件．对于一般约束，定义了约束相关矩阵，给出了约束是必要的或多余的充要条件，对相对多余约束给出了分类．Considering a set of inequality constraints gi (x)≤0 (i=1,2,…,m), if gi (x) is convex function, some sufficient and necessary conditions to distinguish gi(x)≤0 as a necessary or redundant constraint are given. For general constraints,a constraint relative matrix A of constraints gi(x)≤0(i=1,…,m) is definited. The sufficient and necessary condition of the kth constraint as necessary or redundant and the classification of relative redundant constraints are presented.

关 键 词：数学规划 约束 分类 约束相关矩阵 

分 类 号：O232[理学—运筹学与控制论]