| 二维LP问题的一个直接算法 |
| |
| 引用本文： | 张晓军. 二维LP问题的一个直接算法[J]. 电子科技大学学报(社会科学版), 2004, 0(1) |
| |
| 作者姓名： | 张晓军 |
| |
| 作者单位： | 电子科技大学应用数学学院 成都610054 |
| |
| 摘 要： | 针对求解二维线性规划问题的几何算法—图解法,给出了一个二维线性规划问题最优解的性质定理,得到了求解二维线性规划问题的一个直接的代数性算法。利用该算法,可得到一般性规划问题的加速算法,其迭代过程至少是按二维迭代的,迭代速度快于单纯形法。
|
| 关 键 词： | 线性规划 图解法 基平面 单纯形法 |
A Direct Algorithm of Two-Dimensional Linear Programming Questions |
| |
| Zhang Xiaojun. A Direct Algorithm of Two-Dimensional Linear Programming Questions[J]. Journal of University of Electronic Science and Technology of China(Social Sciences Edition), 2004, 0(1) |
| |
| Authors: | Zhang Xiaojun |
| |
| Abstract: | Aim at the chart solution of two-dimensional linear programming questions, a property theorem about optimum solution of two-dimensional linear programming questions was given, and a alglebraic algorithm of two-dimensional linear programming questions was gained. Then generalize the algorithm, a new algorithm of linear programming questions can gain.The new algorithmrapidity of convergence is faster than simplex method. |
| |
| Keywords: | linear programming chart solution base plane simplex method |
| 本文献已被 CNKI 等数据库收录！ |
|
