一般形式线性分式规划解集的结构与求法

The structure and search procedure of solution sets of linear fractional programming in general form

使用多面集的分解定理,导出一般形式线性分式规划解集的结构,并基于有效的算法,给出解的唯一性条件以及当唯一性条件不满足时确定解集的计算步骤.同时附有数值例子.

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.