首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一般形式线性分式规划解集的结构与求法
引用本文:薛声家,韩小花.一般形式线性分式规划解集的结构与求法[J].暨南大学学报,2006,27(5):646-651.
作者姓名:薛声家  韩小花
作者单位:暨南大学企业管理系,广东,广州,510632;暨南大学企业管理系,广东,广州,510632
摘    要:使用多面集的分解定理,导出一般形式线性分式规划解集的结构,并基于有效的算法,给出解的唯一性条件以及当唯一性条件不满足时确定解集的计算步骤.同时附有数值例子.

关 键 词:一般形式线性分式规划  分解定理  解集  极点解  解极方向
文章编号:1000-9965(2006)05-0646-06
收稿时间:12 26 2005 12:00AM
修稿时间:2005年12月26

The structure and search procedure of solution sets of linear fractional programming in general form
XUE Sheng-jia,HAN Xiao-hua.The structure and search procedure of solution sets of linear fractional programming in general form[J].Journal of Jinan University(Natural Science & Medicine Edition),2006,27(5):646-651.
Authors:XUE Sheng-jia  HAN Xiao-hua
Institution:Department of Business Administration, Jinan University, Guangzhou 510632, China
Abstract:With the decomposition theorem of polyhedral sets,structure of the solution set of linear fractional programming in general form is derived.Based on an effective algorithm,the uniqueness condition of the solution is given.Computational procedure for determining the solution set is also shown when the uniqueness condition is not satisfied.Some numerical examples are also given.
Keywords:linear fractional programming in general form  decomposition theorem  solution set  extreme point solution  solution extreme direction
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号