Redundant constraints identification methods for linear programming problems
รหัสดีโอไอ
Creator Ratee Bojaras
Title Redundant constraints identification methods for linear programming problems
Publisher Faculty of Science, Ubon Ratchathani University
Publication Year 2565
Journal Title Journal of Science and Science Education
Journal Vol. 5
Journal No. 1
Page no. 141-147
Keyword Linear programming (LP), redundant constraint, optimal solution
URL Website https://so04.tci-thaijo.org/index.php/JSSE
Website title https://so04.tci-thaijo.org/index.php/JSSE/article/view/255263/174345
ISSN ISSN 2697-410X
Abstract Linear programming (LP) is one of the most important methods used in modeling and solving to manage the resources effectively. Formulating LP model may include redundant constraints so it takes more time-consuming to achieve the optimal solutions. This paper presents the results of Paulraj and Sumathi (2010, 2012) and Estiningsih et al. (2019) which identified the redundant constraints by 8 methods. It reveals that each method can detect redundant constraints with different computational times. The effective method to identify the redundant constraints can reduce time to solve the optimal solutions.
Faculty of Science, Ubon Ratchathani University

บรรณานุกรม

EndNote

APA

Chicago

MLA

ดิจิตอลไฟล์

Digital File
DOI Smart-Search
สวัสดีค่ะ ยินดีให้บริการสอบถาม และสืบค้นข้อมูลตัวระบุวัตถุดิจิทัล (ดีโอไอ) สำนักการวิจัยแห่งชาติ (วช.) ค่ะ