Integer Programming Operational Research -Level 4

1. Integer ProgrammingOperational Research -Level 4 Prepared by T.M.J.A.Cooray Department of Mathematics Integer programming, MA-4020-Operational Research

2. Introduction • In LP problems ,decision variables are non negative values, i.e. they are restricted to be zero or more than zero. • It demonstrates one of the properties of LP namely, continuity, which means that fractional values of the decision variables are possible in the solution of a LP model. • For some problems like: product mix , balanced diet (nutrition) etc. the assumption of continuity may be valid . Integer programming, MA-4020-Operational Research

3. Ctd.. • Further ,in some problems such as , production of different fertilizers (in kilograms or tonnages ),usage of different amounts of food items (in grams) etc. may satisfy the continuity assumption. • But some items cannot be produced in fractions. Say ship,cranes,tables,chairs etc. Integer programming, MA-4020-Operational Research

4. Ctd.. • If we round off the production volume of such products: • Corresponding solution may be different from the optimal solution. • There would be a significant difference in the total profit, if the profit per unit of each of the products is very high. Integer programming, MA-4020-Operational Research

5. There are problems where it is also necessary to assign people , machines, vehicles to activities in integer quantities. • That means these variables should take integer values. • Hence there is a need for Integer programming methods. • The mathematical model for IP or more precisely ILP is the LP model with one additional restriction/constraint: “variables must have integer values”. Integer programming, MA-4020-Operational Research

6. Ctd.. • If only some of the variables of the problem should be integers then they are called “Mixed IP problems” • If all the variables should take integer values then we have “Pure IP problems”. • There is another area of application,namely problems involving a number of interrelated “yes no decisions” . In such decisions,the only two possible choices are yes or no. Integer programming, MA-4020-Operational Research

7. For example, should we undertake a particular project? Should we make a particular fixed investment? Should we locate a facility in a particular site etc. • with just two choices ,we can represent such decisions by decision variables that are restricted to just two values.say 0 or 1. • Thus xj =1 if decision j is yes =0 if decision j is no Integer programming, MA-4020-Operational Research

8. such variables are binary variables or 0-1 variables • IP problems that contain only binary variables are called binary integer programming problems. (BIP problems) Integer programming, MA-4020-Operational Research

9. Consider the following ILP problem Maximize Z=7x1+10x2 Subject to : - x1+3x2 ≤6 7x1+x2 ≤35 x1,x2≥ 0 and integer Integer programming, MA-4020-Operational Research

10. Cutting plane algorithm: The general procedure for Gomory’s cutting plane method is as follows: Step1:find the original LP solution (using the simplex method) ignoring the integer constraint. Step 2:if the solution is integer stop. Otherwise , construct a “cut” derived from the row that has a non integer variable with the largest fractional value and add to the current final tableau. If there is a tie select any row arbitrarily. Step 3:solve the augmented LP problem ,and return to step 2. Integer programming, MA-4020-Operational Research

11. Consider the problem shown in slide 15. • The optimum tableau is given as Integer programming, MA-4020-Operational Research

12. The information in the optimum tableau can be written explicitly as • Z+63/22 S1+31/22 S2 =66 ½ • X2+ 7/22 S1+1/22 S2 =3 ½ • X1 -1/22 S1 + 3/22 S2=4 ½ • First ,factor out all the non integer coefficients into an integer value and a strictly positivefractional component. • A constraint row with a non integer value, can be used as a source row for generating a cut. Integer programming, MA-4020-Operational Research

13. Factoring the x2 row, since s1 and s2 are non negative and the corresponding coefficients are positive fractions middle term is 1/2. since the LHS is all integer values we can say it is 0 Integer programming, MA-4020-Operational Research

14. Any cut can be used in the first iteration of the cutting plane algorithm. This is the constraint , that is added as an additional constraint which is also known as the cut, to the LP optimum tableau. Resulting tableau is: Integer programming, MA-4020-Operational Research

15. We get the following optimal ,but infeasible tableau. Ratio -9 -31 Smallest absolute value Integer programming, MA-4020-Operational Research

16. Applying the dual simplex method to recover feasibility, yields, This solution is still non integer in x1 and s1.selecting x1 arbitrarily as the next source row the associated cut is Integer programming, MA-4020-Operational Research

17. Ratio -7 -31/2 Smallest absolute value Integer programming, MA-4020-Operational Research

18. The dual simplex method yields the following tableau which is optimal, feasible and integer. Integer programming, MA-4020-Operational Research

19. It is important to note that the fractional cut assumes that all the variables including the slack and the surplus variables are integer. • This means that the cut deals with pure integer problems only. Integer programming, MA-4020-Operational Research

20. Consider the following problem . • Maximize Z=2x1+x2 • subject to: x1+x2  5 • -x1+x2 0 • 6x1+2x2 21 • x1, x2 are non negative integers. Integer programming, MA-4020-Operational Research