Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Studies in College Mathematics》 2010-04
Add to Favorite Get Latest Update

The Determination of the Initial Feasible Basis

ZHANG Wen Jian(Xinyang Vocational and Technical College,Henan XinYang,464000)  
For the linear programming problem,the existence of solution and the method of solving are studied with theories and methods of advanced algebra.Six theorems on the Linear programming problem without initial feasible basis are given to make out the solution existence conditions,and the method to find the initial feasible basis.
【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 4 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 HU Sheng biao (Qinghai Nationalities College, Xining 810007,China);Notes on Solving a Class of Linear Programming Problems by the Elementary Row Transformation[J];Operations Research and Management Science;2002-05
4 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