1. 0 Integer Programming Introduction to Integer Programming (IP) Difficulties of LP relaxation IP Formulations Branch and Bound Algorithms Reference: Chapter 9 in W. L. Winston’s book.

2. 1 Integer Programming Model An Integer Programming model is a linear programming problem where some or all of the variables are required to be non-negative integers. These models are in general substantially harder than solving linear programming models. Network models are special cases of integer programming models and are very efficiently solvable. We will discuss several applications of integer programming models. We will study the branch and bound technique, one of the most popular algorithm to solve integer programming models.

3. 2 Classifications of IP Models Pure IP Model: Where all variables must take integer values. Maximize z = 3x 1 + 2x 2 subject to x 1 + x 2  6 x 1, x 2  0, x 1 and x 2 integer Mixed IP Model: Where some variables must be integer while others can take real values. Maximize z = 3x 1 + 2x 2 subject to x 1 + x 2  6 x 1, x 2  0, x 1 integer 0-1 IP Model: Where all variables must take values 0 or 1. Maximize z = x 1 - x 2 subject to x 1 + 2x 2  2 2x 1 - x 2  1, x 1, x 2 = 0 or 1

4. 3 Classifications of IP Models (contd.) LP Relaxation: The LP obtained by omitting all integer or 0-1 constraints on variables is called the LP relaxation of IP. IP: Maximize z = 21x 1 + 11x 2 subject to 7x 1 + 4x 2  13 x 1, x 2  0, x 1 and x 2 integer LP Relaxation: Maximize z = 21x 1 + 11x 2 subject to 7x 1 + 4x 2  13 x 1, x 2  0 Result: Optimal objective function value of IP  Optimal obj. function value of LP relaxation

5. 4 IP and LP Relaxation xxxx x x x x x1x1 x2x2 12 3 1 3 2 7x 1 + 4x 2 = 13

6. 5 Simple Approaches for Solving IP Approach 1: Enumerate all possible solutions Determine their objective function values Select the solution with the maximum (or, minimum) value. Any potential difficulty with this approach? Approach 2: Solve the LP relaxation Round-off the solution to the nearest feasible integer solution Any potential difficulty with this approach?

7. 6 Capital Budgeting Problem Stockco Co. is considering four investments It has $14,000 available for investment Formulate an IP model to maximize the NPV obtained from the investments IP: Maximize z = 16x 1 + 22x 2 + 12x 3 + 8x 4 subject to 5x 1 + 7x 2 + 4x 3 + 3x 4  14 x 1, x 2,, x 3, x 4  0, 1

8. 7 Fixed Charge Problem Gandhi cloth company manufactures three types of clothing: shirts, shorts, and pants Machinery must be rented on a weekly basis to make each type of clothing. Rental Cost:  $200 per week for shirt machinery  $150 per week for shorts machinery  $100 per week for pants machinery There are 150 hours of labor available per week and 160 square yards of cloth Find a solution to maximize the weekly profit

9. 8 Fixed Charge Problem (contd.) Decision Variables: x 1 = number of shirts produced each week x 2 = number of shorts produced each week x 3 = number of pants produced each week y 1 = 1 if shirts are produced and 0 otherwise y 2 = 1 if shorts are produced and 0 otherwise y 3 = 1 if pants are produced and 0 otherwise Formulation: Max. z = 6x 1 + 4x 2 + 7x 3 - 200y 1 - 150 y 2 - 100y 3 subject to 3x 1 + 2x 2 + 6x 3  150 4x 1 + 3x 2 + 4x 3  160 x 1  M y 1, x 2  M y 2, x 3  M y 3 x 1, x 2,, x 3  0, and integer; y 1, y 2,, y 3  0 or 1

10. 9 Either-Or Constraints Dorian Auto is considering manufacturing three types of auto: compact, midsize, large. Resources required and profits obtained from these cars are given below. We have 6,000 tons of steel and 60,000 hours of labor available. If any car is produced, we must produce at least 1,000 units of that car. Find a production plan to maximize the profit.

11. 10 Either-Or Constraints (contd.) Decision Variables: x 1, x 2, x 3 = number of compact, midsize and large cars produced y 1, y 2, y 3 = 1 if compact, midsize and large cars are produced or not Formulation: Maximize z = 2x 1 + 3x 2 + 4x 3 subject to x 1  My 1 ; x 2  My 2 ; x 3  My 3 1000 - x 1  M(1-y 1 ) 1000 - x 2  M(1-y 2 ) 1000 - x 3  M(1-y 3 ) 1.5 x 1 + 3x 2 + 5x 3  6000 30 x 1 + 25x 2 + 40 x 3  60000 x 1, x 2, x 3  0 and integer; y 1, y 2, y 3 = 0 or 1

12. 11 Set Covering Problems Western Airlines has decided to have hubs in USA. Western runs flights between the following cities: Atlanta, Boston, Chicago, Denver, Houston, Los Angeles, New Orleans, New York, Pittsburgh, Salt Lake City, San Francisco, and Seattle. Western needs to have a hub within 1000 miles of each of these cities. Determine the minimum number of hubs

13. 12 Formulation of Set Covering Problems Decision Variables: x i = 1 if a hub is located in city i x i = 0 if a hub is not located in city i Minimize x AT + x BO + x CH + x DE + x HO + x LA + x NO + x NY + x PI + x SL + x SF + x SE subject to

14. 13 Additional Applications Location of fire stations needed to cover all cities Location of fire stations to cover all regions Truck despatching problem Political redistricting Capital investments

15. 14 Branch and Bound Algorithm Branch and bound algorithms are the most popular methods for solving integer programming problems They enumerate the entire solution space but only implicity; hence they are called implicit enumeration algorithms. A general-purpose solution technique which must be specialized for individual IP's. Running time grows exponentially with the problem size, but small to moderate size problems can be solved in reasonable time.

16. 15 An Example Telfa Corporation makes tables and chairs A table requires one hour of labor and 9 square board feet of wood A chair requires one hour of labor and 5 square board feet of wood Each table contributes $8 to profit, and each chair contributes $5 to profit. 6 hours of labor and 45 square board feet is available Find a product mix to maximize the profit Maximize z = 8x 1 + 5x 2 subject to x 1 + x 2  6; 9x 1 + 5x 2  45; x 1, x 2  0; x 1, x 2 integer

17. 16 Feasible Region for Telfa’s Problem Subproblem 1 : The LP relaxation of original Optimal LP Solution: x 1 = 3.75 and x 2 = 2.25 and z = 41.25 Subproblem 2: Subproblem 1 + Constraint x 1  4 Subproblem 3: Subproblem 1 + Constraint x 1  3

18. 17 Feasible Region for Subproblems Branching : The process of decomposing a subproblem into two or more subproblems is called branching. Optimal solution of Subproblem 2: z = 41, x 1 = 4, x 2 = 9/5 = 1.8 Subproblem 4: Subproblem 2 + Constraint x 2  2 Subproblem 5: Subproblem 2 + Constraint x 2  1

19. 18 Feasible Region for Subproblems 4 & 5

20. 19 The Branch and Bound Tree Subproblem 1 z = 41.25 x 1 = 3.75 x 2 = 2.25 Optimal solution of Subproblem 5: z = 40.05, x 1 = 4.44, x 2 = 1 Subproblem 6: Subproblem 5 + Constraint x 1  5 Subproblem 5: Subproblem 5 + Constraint x 1  4 3 Subproblem 2 z = 41 x 1 = 4 x 2 = 1.8 Subproblem 3 Subproblem 4 Infeasible Subproblem 5 x 1  4 x 1  3 x 2  2 x 2  1 1 2 4

21. 20 Feasible Region for Subproblems 6 & 7 Optimal solution of Subproblem 7: z = 37, x 1 = 4, x 2 = 1 Optimal solution of Subproblem 6: z = 40, x 1 = 5, x 2 = 0

22. 21 The Branch and Bound Tree Subproblem 1 z = 41.25 x 1 = 3.75 x 2 = 2.25 Subproblem 2 z = 41 x 1 = 4 x 2 = 1.8 Subproblem 3 z = 3 x 1 = 3 x 2 = 1, LB = 39 Subproblem 4 Infeasible Subproblem 5 z = 40.55 x 1 = 4.44 x 2 = 1 x 1  4 x 1  3 x 2  2 x 2  1 Subproblem 6 z = 40 x 1 = 5 x 2 = 0, LB = 37 Subproblem 7 z = 37 x 1 = 4 x 2 = 1 1 2 3 4 7 6 5

23. 22 Solving Knapsack Problems Max z = 16x 1 + 22x 2 + 12x 3 + 8x 4 subject to 5x 1 + 7x 2 + 4x 3 + 3x 4  14 x i = 0 or 1 for all i = 1, 2, 3, 4 LP Relaxation: Max z = 16x 1 + 22x 2 + 12x 3 + 8x 4 subject to 5x 1 + 7x 2 + 4x 3 + 3x 4  14 0  x i  1 for all i = 1, 2, 3, 4 Soving the LP Relaxation: Order x i ’s in the decreasing order of c i /a i where c i are the cost coefficients and a i ’s are the coefficients in the constraint Select items in this order until the constraint is satisfied with equality

24. 23 The Branch and Bound Tree x 3 = 0 x 3 = 1 x 2 = 0 x 4 = 1 Subproblem 1 z = 44 x 1 = x 2 = 1 x 3 =.5 1 7 2 8 9 Subproblem 5 z = 43.6 x 1 =.6, x 2 =x 3 =1 x 4 = 0, LB = 36 Subproblem 4 z = 36 x 1 = x 3 =1 x 2 = 0, x 4 =1 Subproblem 3 z = 43.7 x 1 =x 3 = 1, x 2 =.7, x 4 =0 Subproblem 6 z = 42 x 1 =0, x 2 =x 3 =1 x 4 = 1, LB = 36 5 Subproblem 7 LB = 42 Infeasible 6 x 2 = 1 x 1 = 0x 1 = 1 Subproblem 2 z = 43.3, LB=42 x 1 = x 2 =1 x 3 = 0, x 4 =.67 Subproblem 8 z = 38, LB=42 x 1 = x 2 =1 x 3 = x 4 = 0 Subproblem 9 z= 42.85, LB=42 x 1 = x 4 =1 x 3 = 0, x 2 =.85 x 4 = 0 3 4

25. 24 Strategies of Branch and Bound The branch and bound algorithm is a divide and conquer algorithm, where a problem is divided into smaller and smaller subproblems. Each subproblem is solved separately, and the best solution is taken. Lower Bound (LB): Objective function value of the best solution found so far. Branching Strategy : The process of decomposing a subproblem into two or more subproblems is called branching.

26. 25 Strategies of Branch and Bound (contd.) Upper Bounding Strategy: The process of obtaining an upper bound (UB) for each subproblem is called an upper bounding strategy. Pruning Strategy: If for a subproblem, UB  LB, then the subproblem need not be explored further. Searching Strategy: The order in which subproblems are examined. Popular search strategies: LIFO and FIFO.