Abstrak
<p style="margin: 1em 0px; color: #111111; font-family: Arial, Verdana, Helvetica, sans-serif; font-size: 11.2px; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: normal; letter-spacing: normal; orphans: 2; text-align: left; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px; background-color: #fafafa;">The purpose of this study was to determine the allocation of projects to be implemented by the Department of Road Infrastructure Pripinsi West Sumatra in 2005, so the cost minimum. The method used is the method of Branch And Bound together with the simplex method with a solution in the form of binary integer program .. By this method it was found that all the variables that represent each project is worth the cost of the current minimum, so that the entire project could be done with minimum total cost is Rp 17,789,289,600.00. This is in accordance with the reality on the ground that all projects can be realized by the Department of Road Infrastructure West Sumatra province.</p><p style="margin: 1em 0px; color: #111111; font-family: Arial, Verdana, Helvetica, sans-serif; font-size: 11.2px; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: normal; letter-spacing: normal; orphans: 2; text-align: left; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px; background-color: #fafafa;">Key words: branch and bound method, simpleks method, integer biner</p>