Aplikasi Program Integer pada Perumahan Bumi Sergai di Sei Rampah

Abstract

A housing will be built in Sei Rampah the Earth Housing Sergai, with two types. Type 65 (X1) and type 45 (X2). This problem will be modeled in the form of mathematical models peogramming integer that is part of a linear programming problem, where the decision variables must be integers. Integer programming problem will be solved using the branch and bound method to first change the integer programming problem into a linear programming form, then use the simplex method to solve the linear programming problem. With the objective function of the selling price of the house Z = 180.000.000X1 + 140.000.000X2 and constraint functions of building materials. The number of homes for Type 65 are 36 units and type 45 as many as 62 units.