|
|
| |
| A MINIMUM-RATIO TEST-FREE APPROACH TO LINEAR PROGRAMMING |
| |
Citation： |
Wang Zhemin.A MINIMUM-RATIO TEST-FREE APPROACH TO LINEAR PROGRAMMING[J].Chinese Annals of Mathematics B,1989,10(4):472~479 |
| Page view： 783
Net amount： 738 |
Authors： |
Wang Zhemin; |
Foundation： |
Visiting at the Department of Management Sciences, University of Waterloo, Ontario, Canada. This
research was partly supported by the National Foundation of Science of PRC. |
|
|
| Abstract： |
Two non-simplex-type pivotal algorithms are given in the paper which realize construetively the Farkas Lemma and the strong duality theorem of the linear programming on purely combinatorial pivoting rules, i.e. they involve no process of minimum-ratio-test and work purely on smallest subscript principle in accordance with the signs of the quantities concerned. |
Keywords： |
|
Classification： |
|
|
|
Download PDF Full-Text
|
