A MINIMUM-RATIO-TEST-FREE APPROACH TO LINEAR PROGRAMMING

作     者：王哲民 

作者机构：Department of Statistics & Operations Research Fudan University Shanghai China. 

出 版 物：《Chinese Annals of Mathematics,Series B》 (数学年刊（B辑英文版）)

年 卷 期：1989年第10卷第4期

页      面：472-479页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：This research was partly supported by the National Foundation of Science of PRC 

主　　题：purely combinatorial accordance quantities concerned simplex duality smallest RATIO ready 

摘      要：Two nan-simplex-type pivotal algorithms are given in the paper which realize constructively the Farkas Lemma and the strong duality theorem of the linear programming on purely combinatorial pivoting rnles, 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.