确定一般线性约束下伪线性规划全部解的一种方法  

A method for determining all solutions of pseudolinear programming with general linear constraints

作　　者：薛声家[1] 周乐平[1] 

机构地区：[1]暨南大学企业管理系,广东广州510632

出　　处：《暨南大学学报（自然科学与医学版）》2010年第1期16-19,共4页Journal of Jinan University(Natural Science & Medicine Edition)

基　　金："211工程"子项目(50630060);广东省教育厅科研重大项目(20060914009)

摘　　要：讨论一般线性约束下伪线性规划的多重解问题.推导出解的一般表达式.并基于XH算法,提出解的唯一性条件以及当唯一性条件不满足时确定全部解的计算步骤.从而推广了文献"一般形式线性分式规划解集的结构与求法"的结果.The problem of multiple solutions to pseudolinear programming with general linear constraints is discussed. The general expression of solutions is derived. Based on the XH algorithm, uniqueness condition of solution is given and the computational procedure for determining all solutions, when this uniqueness condition is not satisfied, is presented. Thus the result in paper ＂The structure and search procedure of solution sets of linear fractional programming in general form＂ is extended.

关 键 词：伪线性规划 一般线性约束 全部解 极点解 解极方向 

分 类 号：O221.2[理学—运筹学与控制论]