Mixed Integer Programming Problems Using Branch Bound And Gomorys Methods

Mixed integer programming is a linear programming with some of the deci-rnsion variables are integer and some of them are continuous. Thus, unlike tornlinear programming it some what complex to solve due to the integer decisionrnvariables. Some of the complexities are minimized using di_erent methodsrnsuch as Gomory's cutting plane, Branch and bound methods. In this project,rnwe presented the solutions of mixed integer linear programming using Go-rnmory's Fractional cutting plane through removing the unnecessary regionrnfrom its linear programming relaxation to obtain the integer solution andrnbranch and bound by dividing the problem to smaller sub-problems whichrnare more simple than the original problem. Therefore, based on these con-rncepts, the corresponding algorithms are presented with illustrative examples.

Get Full Work

Report copyright infringement or plagiarism