Abstract
This chapter will study the problems of integer and binary programming, and their extensions, establishing the circumstances in which they should be utilized according to characteristics of the problem and their research objectives, with a focus on decision making. We will present modeling of several real problems in binary and integer programming, including knapsack, selection of investment projects, traveling salesman and staff scheduling problems, to name a few, as well as the methods for solving them. The concept of linear relaxation and its importance for solving binary and integer programming problems will also be discussed. All of the problems presented will be solved using Excel Solver.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
