April 2019
Beginner to intermediate
1240 pages
45h 43m
English
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.
Read now
Unlock full access