Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《JOURNAL OF NORTHEAST FORESTRY UNIVERSITY》 1998-04
Add to Favorite Get Latest Update

An Algorithm for Solving Linear Programming with Inequality Contraints

Wang Junjie, Cui Jingzhe(Northeast Forestry University, Harbin 150040, P. R. China)  
In this paper, an algorithm for solving linear programming with inequality constraints is described. The algorithm, using line matrixing, obtains feasible basis directly from the particular form transformed from linear programming. It avoids introducing any artificial variable, and need not calculate examining figure, but the big M method and the two phase method do, when finding the feasible basis. Therefore it requires less storage and calculation, especially for integer programming solved with the branch and bound method. On the other hand, it can also solve the linear programming with equality constraints.
【CateGory Index】: O221.1
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【Citations】
Chinese Journal Full-text Database 1 Hits
1 Chen Kaizhou;Guo Qiang(Xidian University, Xi'an);AN ALGORITHM OF FINDING A FEASIBLE BASIS AND A BASIC FEASIBLE SOLUTION WfTH ANY BASIS[J];JOURNAL OF UNMERICAL METHODS AND COMPUTER APPLICATIONS;1996-01
【Co-citations】
Chinese Journal Full-text Database 8 Hits
1 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
2 Guo Qiang(Department of Basic Science);A New Algorithm of Finding Nonnegative Solution of System of Linear Equations[J];Journal of Northwestern Institute of Architectural Engineering;1997-01
3 Guo Qiang(Department of Basic Science);An Efficient Algorithm of Finding Linear Programming Under Inequality Constraint[J];Journal of Northwestern Institute of Architectural Engineering;1997-02
4 GAO Guo-cheng (Department of Basic Courses, Shandong University of Science and Technology. Jinan 250031,China);A Basic Solution Algorthm of Linear Programming[J];Operations Research and Management Science;2001-03
5 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
6 Guo Qiang (Northwestern Institute of Architectural Engineering,Xian,Shanxi,710061 China);Meta Basis Iteration Method with All Direction Search[J];OPERATIONS RESEARCH AND MANAGEMENT SCIENCE;1999-01
7 YIGONG HU BOXIONG LAN(School of Economics & Management, Tsinghua University, Beijing 100084);A Simplex Method Based on Kernel Matrix of Linear Program[J];OR TRANSACTIONS;1999-01
8 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