LU-Decomposition Computerized Method to Solve Linear Programming Problems

Abdulraheem Mz, K. Mohammad
{"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}
引用次数: 2

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求解线性规划问题的lu分解计算机化方法
这项工作的目的是利用LU分解来解决线性规划(LP)问题。LU方法是基于一个方阵可以分解成单位下三角矩阵(L)与上三角矩阵(U)的乘积,无需迭代即可直接求解。考虑了三种不同的问题情况,并使用逐步计算和MATLAB进行了求解。结果表明,该方法在循环情况下优于传统单纯形法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Energy is Not Conserved Algorithm for Solving Multi-Delay Optimal Control Problems Using Modified Alternating Direction Method of Multipliers Numerical Approach for Determining Impact of Steric Effects in Biological Ion Channel Assessing the Impact of Age andndash;Vaccination Structure Models on the Dynamics of Tuberculosis Transmission A New One-Dimensional Finite Volume Method for Hyperbolic Conservation Laws
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1