ANALISIS METODE CUTTING PLANE PADA PENYELESAIAN INTEGER PROGRAMMING

Integer programming constitutes are model linear programming which some or all values of its decision variables are defined on the set of non negative integers. This model arises because infacts not some or all decision variables yielded by the implementation of solution method to a linear program meet a specific demand of decision variable characteristics, which are non negative integers. One way that can be used to solve the integer programming problem is the cutting plane method, a method used to solve integer programming with the introduction of new constraints called
Gomory. Gomory constraints need to be implented if the values of decision variables are not rounded (fractional value). This paper analyzes how to find the optimal solution
to solve pure integer programming problems through the application of example. So far the analysis shows that the pure integer programming problems can be solved using
cutting plane method yielding optimal solutions which are integer valued