Abstract
This chapter begins by introducing integer linear programming. Then, it proposes a mixed set of integer linear programming problems and provides their solutions. This chapter aims to provide a better understanding of the formulation of integer linear programming models. It pays special attention to the use of binary decision variables to express the conditions or dichotomies in the constraints of the problems. Thus, it sets out different problem formulations with their solutions in relation to Industrial Organisation Engineering and the management setting.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anderson DR, Sweeney DJ, Williams TA, Wisniewski M (2009) An introduction to management science: quantitative approaches to decision making. South-Western CENGAGE Learning UK, UK
Balas E (1965) An additive algorithm for solving linear programs with zero-one variables. Oper Res 13:517–546
COIN-OR (2011) COmputational INfrastructure for Operations Research. July, 2011. http://www.coin-or.org/
Driebeck NJ (1966) An algorithm for the solution of mixed integer programming problems. Manage Sci 12:576–587
Fletcher R (2000) Practical methods of optimization, 3rd ed. Wiley, New York
Gomory RE (1958) Outline of an algorithm for integer solutions to linear programs. Bull Am Math Soc 64:275–278
Gomory RE (1960a) All-integer programming algorithm. Report RC-189, IBM Research Center, Mohansic, New York
Gomory RE (1960b) Solving linear programming problems in integers. In: Bellman R, Hall M (eds) Combinatorial analysis, Proceedings of the tenth symposium in applied mathematics of the American Mathematical Society, pp 211–216
Gomory RE (1960c) An algorithm for the mixed integer problem. Report RAND Corporation, RM-2597
Gomory RE (1963) An algorithm for integer solutions to linear programs. In: Graves RL, Wolfe P (eds) Recent advances in mathematical programming. McGraw-Hill, New York, pp. 269–302
Hillier FS, Lieberman GJ (2002) Introduction to operations research, 7th edn. Mc-Graw Hill, San Francisco
Land AH, Doig AG (1960) An automatic method of solving discrete programming problems. Econometrics 28:497–520
Little JD, Murty CKG, Sweeney DW, Karel C (1963) An algorithm for the travelling salesman problem. Oper Res 11:972–989
Murty KG (1995) Operations research: deterministic optimization models. Prentice Hall, Englewood Cliffs
Rardin RL (1998) Optimization in operations research. Prentice Hall, Englewood Cliffs
Taha H (2010) Operations research: an introduction, 9th edn. Prentice Hall, Englewood Cliffs
Winston WL (2003) Operations research: applications and algorithms, 4th edn. Duxbury Press, Belmont
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer-Verlag London
About this chapter
Cite this chapter
Poler, R., Mula, J., Díaz-Madroñero, M. (2014). Integer Programming. In: Operations Research Problems. Springer, London. https://doi.org/10.1007/978-1-4471-5577-5_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5577-5_2
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5576-8
Online ISBN: 978-1-4471-5577-5
eBook Packages: EngineeringEngineering (R0)