INTEGER LINEAR PROGRAMMING PROBLEM IN MESSEBO CEMENT FACTORY

Haftom Gebreanenya

Abstract


To solve integer linear programming problem is very difficult than to solve linear programming problem. In this paper we are going to see the formulation of integer linear programming problem and one of its solution techniques called Branch and Bound method. This paper also contains a real world problem of integer linear programming problem on Messebo Cement Factory (Mekelle, Tigray, Ethiopia) solved using the Branch and Bound method.

Keywords


Integer linear programming problem, Branch and Bound method.

Full Text:

PDF

References


Dimitris Bertsimas, John N.Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, Belmont, Massachusetts, 1997.

Frederick S.Hillier,Gerald J.Lieberman, introduction to Operations research, seventh edition, McGraw hill, New York, 2000.

Hamdy A.Taha, Operations research: An introduction, eighth edition, Pearson Prentice Hall, New Jersey, 2007.

Singiresu S.RAO, Engineering Optimization theory and practice, fourth edition, John Wiley & Sons, 2009.

Wayne L.winston, Operations research applications and algorithms, Duxbury press, fourth edition, Belmont, 2004.


Refbacks

  • There are currently no refbacks.


Copyright (c) 2016 Journal of Progressive Research in Mathematics

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Copyright © 2016 Journal of Progressive Research in Mathematics. All rights reserved.

ISSN: 2395-0218.

For any help/support contact us at editorial@scitecresearch.com, jprmeditor@scitecresearch.com.