Your Cart

Your cart is empty

Home  >  Volume 42

7. Comparison of ‘Branch and Bound’ and Cutting Plane Algorithms for Solving Pure Integer Linear Programming Problems by Ayansola O.A, Olajide J.T and Olawuwo J.G.Volume 42, pp47 – 52
Sale price: $5.00
Quantity:

Department of Mathematics and Statistics, The Polytechnic Ibadan, Ibadan.

Abstract

The study presents two standard techniques of solving integer linear programming problems to obtain an optimal integer solution. The results revealed that Branch and Bound algorithm is more efficient than Cutting Plane algorithm, at maximizing benefits. 

Keywords: Additive algorithm, Tree search, Integer Solution, Optimization, Fathomed, Fractional cut.

Close
Loading...