แจ้งเอกสารไม่ครบถ้วน, ไม่ตรงกับชื่อเรื่อง หรือมีข้อผิดพลาดเกี่ยวกับเอกสาร ติดต่อที่นี่ ==>
หากไม่มีอีเมลผู้รับให้กรอก thailis-noc@uni.net.th
หากไม่มีอีเมลผู้รับให้กรอก thailis-noc@uni.net.th
Kasitinart Sangngern. The relaxed nonfeasible-basis cutting plane method for an integer programming problem. Master's Degree(Mathematics). Thammasat University. Thammasat University Library. : Thammasat University, 2019.
The relaxed nonfeasible-basis cutting plane method for an integer programming problem
Name: Kasitinart Sangngern
keyword:
Integer linear programming
Abstract:
The cutting plane method is an iterative method which is used to solve an integer linear programming problem. It starts by solving the LP relaxation which an integer condition is dropped, and then the cuts are added to refine the continuous feasible region for finding the optimal integer solution. However, the additional cuts lead to enlarge a problem size and a long computational time. In this thesis, we propose two novel methods to improve the cutting plane method for solving an integer programming problem. The proposed methods are the integration of the cutting plane method and the Nonfeasible Basis Method which is solved the LP relaxation without using artificial variables. The first method uses both techniques directly, and it is named the Nonfeasible- Basis Cutting Plane Method (NBC). The second method is the slight modification of NBC with relaxing some constraints, and it is named the Relaxed Nonfeasible-Basis Cutting Plane Method (RNBC). It starts by solving the relaxation problem with the NBC method. The computational results show that NBC and RNBC can reduce the computational time comparing with the traditional method since NBC and RNBC do not involve the artificial variables and are performed on the condensed tableau
Thammasat University. Thammasat University Library
Address:
BANGKOK
Email:
preserv@tu.ac.th
Name: Aua-aree Boonperm
Role:
advisor
Created:
2019
Modified:
2022-09-16
Issued:
2022-09-16
วิทยานิพนธ์/Thesis
application/pdf
eng
DegreeName: Master of Science
Level: Master's Degree
Descipline: Mathematics
Grantor: Thammasat University
©copyrights Thammasat University
RightsAccess:
ใช้เวลา
0.027852 วินาที
Kasitinart Sangngern
| Title | Contributor | Type |
|---|---|---|
| The relaxed nonfeasible-basis cutting plane method for an integer programming problem
มหาวิทยาลัยธรรมศาสตร์ Kasitinart Sangngern | Aua-aree Boonperm | วิทยานิพนธ์/Thesis |
| Two-phase heuristics for solving two-dimensional skiving and cutting stock problem
มหาวิทยาลัยธรรมศาสตร์ Kasitinart Sangngern | Aua-Aree Boonperm | วิทยานิพนธ์/Thesis |
Aua-aree Boonperm