| 支撑线法求解LP问题 |
| |
| 引用本文： | 王玉清,宋企功. 支撑线法求解LP问题[J]. 数学的实践与认识, 2003, 33(4): 118-122 |
| |
| 作者姓名： | 王玉清 宋企功 |
| |
| 作者单位： | 太原理工大学阳泉学院基础部,山西,阳泉,045001 |
| |
| 摘 要： | 设LP( n) :max F =cxAx bx 0其中 A=(· ) m× n,n m 2 n,b 0 .用本文提出的支撑线法求解 LP( n) ,至多旋转 n2 +12 n( n- 1)次 ,即可求得最优解
|
| 关 键 词： | 单纯形法 支撑线法 二分法 |
| 修稿时间： | 2001-12-25 |
The Supporting Line Method for Solving LP |
| |
| WANG Yu- qing,SONG Qi- gong. The Supporting Line Method for Solving LP[J]. Mathematics in Practice and Theory, 2003, 33(4): 118-122 |
| |
| Authors: | WANG Yu- qing SONG Qi- gong |
| |
| Abstract: | Let LP(n) : max F =cx Ax b x 0 in this A=(· ) m× n,n m 2 n,b 0 .This paper points outsupporting line method for solving LP(n) ,By the method in n2 +1 2 n(n- 1 ) degrees rotations we are finding optimal solution for Lp(n) . |
| |
| Keywords: | simplex method supporting line method binary chopping |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
