Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Operations Research and Management Science》 2002-05
Add to Favorite Get Latest Update

Notes on Solving a Class of Linear Programming Problems by the Elementary Row Transformation

HU Sheng biao (Qinghai Nationalities College, Xining 810007,China)  
The paper points out that some conclusions about the existence of initial feasible solution,optimized solution and zero solution are wrong in the solution of linear programming proposed by.In particular if augmented matrix containing constrained conditions of n varibles through elementary row transformation, in which the first n's number is nonpositive and the last number is zero in certain equation, then the linear programming problems can have nonzero solution,and not necessarily zero solution given by.
【CateGory Index】: O221.1
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【Co-citations】
Chinese Journal Full-text Database 3 Hits
1 Wang Junjie, Cui Jingzhe(Northeast Forestry University, Harbin 150040, P. R. China);An Algorithm for Solving Linear Programming with Inequality Contraints[J];JOURNAL OF NORTHEAST FORESTRY UNIVERSITY;1998-04
2 ZHOU Xue\|song(Hangzhou University of Commerce, Hangzhou 310035, China);The Simplex Method for Computing the All Solutions of the Matrix Countermeasure[J];Mathematics In Practice and Theory;2003-09
3 ZHOU Xue-song,SU Wei-hua(College of Statistics and Mathematics,Zhejiang Gongshang University,Hangzhou 310035,China);A Method for Computing the Solutions of The Bimatrix Game[J];Journal of Zhejiang Gongshang University;2006-03
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved