Abdulraheem MZ and Mohammad K
This paper aims to solve the linear programming (LP) problem using the LU decomposition method. The LU method is based on the fact that a square matrix can be decomposed into the product of a unit lower triangular matrix (L) and an upper triangular matrix (U), and a direct solution can be obtained without iteration. Three different problem cases are considered and solved using step-by-step calculations and MATLAB. The results show that this method is superior to the traditional simplex method and has loops.
分享此文章
English 
Spanish 
Russian 
German 
French 
Japanese 
Portuguese 
Hindi 