非凸无限维规划的弱有效解  

The Weak Efficient Solution of Nonconvex Infinite Dimension Programming

作　　者：黄正海[1,2] 胡适耕[1,2] 沈轶[1,2] 

机构地区：[1]复旦大学统计运筹系 [2]华中理工大学数学系

出　　处：《工程数学学报》1998年第4期1-7,共7页Chinese Journal of Engineering Mathematics

摘　　要：讨论了非凸无限维规划的弱有效解，其结果主要如下：广义次类凸与近次类凸条件下的Ｇｏｒｄａｎ择一定理；广义弱鞍点定理与Ｌａｇｒａｎｇｅ对偶；几种解之间的关系；弱有效解的必要条件与充分条件。Abstract In this paper, the weak efficient solution of nonconvex infinite dimension programming is discussed, the major results are obtained as follows: (1) Gordan alternative theorem under the conditions of general subconvexlike and nearly subconvexlike; (2) Weak saddle point theorem and Lagrange duality; (3) Relations among a few solutions; (4) necessary condtions and sufficient conditions for weak efficient.

关 键 词：弱有效解 广义次类凸 近次类凸 择一定理 弱鞍点定理 LAGRANGE对偶 最优化理论 

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