Mixed Integer Programming Problems Using Branch & Bound and Gomory's Methods
| dc.contributor.advisor | Guta, Berhanu (PhD) | |
| dc.contributor.author | Getachew, Zinash | |
| dc.date.accessioned | 2021-03-29T11:43:24Z | |
| dc.date.accessioned | 2023-11-04T12:31:09Z | |
| dc.date.available | 2021-03-29T11:43:24Z | |
| dc.date.available | 2023-11-04T12:31:09Z | |
| dc.date.issued | 2020-06-25 | |
| dc.description.abstract | Mixed integer programming is a linear programming with some of the deci- sion variables are integer and some of them are continuous. Thus, unlike to linear programming it some what complex to solve due to the integer decision variables. Some of the complexities are minimized using di_erent methods such as Gomory's cutting plane, Branch and bound methods. In this project, we presented the solutions of mixed integer linear programming using Go- mory's Fractional cutting plane through removing the unnecessary region from its linear programming relaxation to obtain the integer solution and branch and bound by dividing the problem to smaller sub-problems which are more simple than the original problem. Therefore, based on these con- cepts, the corresponding algorithms are presented with illustrative examples. | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/25760 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Linear Programming | en_US |
| dc.subject | Simplex Method | en_US |
| dc.subject | Dual Simplex Method | en_US |
| dc.subject | Mixed Integer Programming | en_US |
| dc.subject | Cutting Plane Method | en_US |
| dc.subject | Branch and Bound Method | en_US |
| dc.title | Mixed Integer Programming Problems Using Branch & Bound and Gomory's Methods | en_US |
| dc.type | Thesis | en_US |