| 一般形式线性分式规划的一个解法 |
| |
| 引用本文： | 何文汉,薛声家.一般形式线性分式规划的一个解法[J].广州师院学报,1994(2):64-69. |
| |
| 作者姓名： | 何文汉 薛声家 |
| |
| 作者单位： | [1]广东省青年干部学院经济系，广州510500 [2]暨南大学企管系，广州510632 |
| |
| 摘 要： | 本文提出一个直接处理一般形式线性分式规划的算法而不需要把问题的约束条件转化为标准形式。无需非退化假设条件。我们证明了算法在有限步后终止于原问题的最优解。
|
| 关 键 词： | 线性分式规划 凸单纯形法 标准形式 极点 非退化性 约束条件 最优解 |
SOLUTION FOR LINEAR FRACTIONAL PROGRAMMING IN GENERAL FORM |
| |
| Authors: | He Wenhan Xue Shengjia |
| |
| Institution: | He Wenhan; Xue Shengjia(Guangdong Youth Cadre College) (Jinan University) |
| |
| Abstract: | In this paper, the authors present an algorithm to handle linear fractional programming in the general form directly, which need not transform the constraints of the problem into the stan dard form. It is proved that the algorithm terminates with an optimal solution of the original prob lem after a finite number of stepe without the nondegeneracy assumption. |
| |
| Keywords: | linear fractional programming convex simplex method standard form extreme point nondegeneracy cycling |
| 本文献已被 CNKI 维普 等数据库收录！ |
