{"title":"求解线性规划问题的lu分解计算机化方法","authors":"Abdulraheem Mz, K. Mohammad","doi":"10.4172/2168-9679.1000391","DOIUrl":null,"url":null,"abstract":"The purpose of this work is to solve Linear Programming (LP) problems using LU factorization. LU method is based on the fact that a square matrix can be factorized into the product of unit lower triangular matrix (L) and upper triangular matrix (U), and the direct solution was obtained without iterations. Three different problem cases were considered and solved using step-by-step calculations as well as using MATLAB. Results show this method is superior than the traditional simplex method with cases of cycling.","PeriodicalId":15007,"journal":{"name":"Journal of Applied and Computational Mathematics","volume":"51 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"LU-Decomposition Computerized Method to Solve Linear Programming Problems\",\"authors\":\"Abdulraheem Mz, K. Mohammad\",\"doi\":\"10.4172/2168-9679.1000391\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The purpose of this work is to solve Linear Programming (LP) problems using LU factorization. LU method is based on the fact that a square matrix can be factorized into the product of unit lower triangular matrix (L) and upper triangular matrix (U), and the direct solution was obtained without iterations. Three different problem cases were considered and solved using step-by-step calculations as well as using MATLAB. Results show this method is superior than the traditional simplex method with cases of cycling.\",\"PeriodicalId\":15007,\"journal\":{\"name\":\"Journal of Applied and Computational Mathematics\",\"volume\":\"51 1\",\"pages\":\"1-5\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied and Computational Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4172/2168-9679.1000391\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Computational Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4172/2168-9679.1000391","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
LU-Decomposition Computerized Method to Solve Linear Programming Problems
The purpose of this work is to solve Linear Programming (LP) problems using LU factorization. LU method is based on the fact that a square matrix can be factorized into the product of unit lower triangular matrix (L) and upper triangular matrix (U), and the direct solution was obtained without iterations. Three different problem cases were considered and solved using step-by-step calculations as well as using MATLAB. Results show this method is superior than the traditional simplex method with cases of cycling.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
