Integer programming Branch & bound algorithm ( B&B )

Slides:



Advertisements
Similar presentations
Integer Optimization Basic Concepts Integer Linear Program(ILP): A linear program except that some or all of the decision variables must have integer.
Advertisements

Branch-and-Bound Technique for Solving Integer Programs
1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.
Solving IPs – Cutting Plane Algorithm General Idea: Begin by solving the LP relaxation of the IP problem. If the LP relaxation results in an integer solution,
1 Chapter 11 Here we see cases where the basic LP model can not be used.
Nonlinear Programming
Pure, Mixed-Integer, Zero-One Models
Branch-and-Bound In this handout,  Summary of branch-and-bound for integer programs Updating the lower and upper bounds for OPT(IP) Summary of fathoming.
DMOR Branch and bound. Integer programming Modelling logical constraints and making them linear: – Conjuction – Disjunction – Implication – Logical constraints.
1 Cutting Plane Technique for Solving Integer Programs.
Lecture 10: Integer Programming & Branch-and-Bound
Water Resources Development and Management Optimization (Integer Programming) CVEN 5393 Mar 11, 2013.
Branch & Bound Algorithms
Introduction to Linear and Integer Programming
Solving Integer Programs. Natural solution ideas that don’t work well Solution idea #1: Explicit enumeration: Try all possible solutions and pick the.
Dealing with NP-Complete Problems
Computational Methods for Management and Economics Carla Gomes
Linear Programming Integer Linear Models. When Variables Have To Be Integers Example – one time production decisions –Fractional values make no sense.
Branch and Bound Algorithm for Solving Integer Linear Programming
1 Contents college 3 en 4 Book: Appendix A.1, A.3, A.4, §3.4, §3.5, §4.1, §4.2, §4.4, §4.6 (not: §3.6 - §3.8, §4.2 - §4.3) Extra literature on resource.
LP formulation of Economic Dispatch
Daniel Kroening and Ofer Strichman Decision Procedures An Algorithmic Point of View Deciding ILPs with Branch & Bound ILP References: ‘Integer Programming’
(Not in text).  An LP with additional constraints requiring that all the variables be integers is called an all-integer linear program (IP).  The LP.
Decision Procedures An Algorithmic Point of View
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.
Linear Programming – Simplex Method
Exact methods for ALB ALB problem can be considered as a shortest path problem The complete graph need not be developed since one can stop as soon as in.
MILP algorithms: branch-and-bound and branch-and-cut
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 11-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 11.
WOOD 492 MODELLING FOR DECISION SUPPORT
15.053Tuesday, April 9 Branch and Bound Handouts: Lecture Notes.
Column Generation By Soumitra Pal Under the guidance of Prof. A. G. Ranade.
1 Branch and Bound Searching Strategies Updated: 12/27/2010.
Integer Linear Programming Terms Pure integer programming mixed integer programming 0-1 integer programming LP relaxation of the IP Upper bound O.F. Lower.
Integer Programming Li Xiaolei. Introduction to Integer Programming An IP in which all variables are required to be integers is called a pure integer.
Gomory Cuts Updated 25 March Example ILP Example taken from “Operations Research: An Introduction” by Hamdy A. Taha (8 th Edition)“Operations Research:
Divide and Conquer Optimization problem: z = max{cx : x  S}
Steiner tree LP x e = 1 if edge e is included in the Steiner tree. Min.  e c e x e (primal) s.t.  e   (S) x e ≥ 1  S  V: S  T≠ , T\S≠  x e 
Integer LP In-class Prob
M Tech Project – First Stage Improving Branch-And-Price Algorithms For Solving 1D Cutting Stock Problem Soumitra Pal [ ]
Branch and Bound Algorithms Present by Tina Yang Qianmei Feng.
5-1 Copyright © 2013 Pearson Education Integer Programming: The Branch and Bound Method Module C.
5.3 Mixed Integer Nonlinear Programming Models. A Typical MINLP Model.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Integer Programming, Branch & Bound Method
Chapter 6 Optimization Models with Integer Variables.
1 Chapter 6 Reformulation-Linearization Technique and Applications.
0 Integer Programming Introduction to Integer Programming (IP) Difficulties of LP relaxation IP Formulations Branch and Bound Algorithms Reference: Chapter.
Solving IPs – Implicit Enumeration Similar to Binary IP Branch and Bound General Idea: Fixed variables – those for which a value has been fixed. Free Variable.
Water Resources Development and Management Optimization (Integer and Mixed Integer Programming) CVEN 5393 Mar 28, 2011.
Nonlinear Programming Prepared by Lee Revere and John Large
Signal processing and Networking for Big Data Applications: Lecture 9 Mix Integer Programming: Benders decomposition And Branch & Bound NOTE: To change.
5.3 Mixed-Integer Nonlinear Programming (MINLP) Models
Introduction to Operations Research
Gomory Cuts Updated 25 March 2009.
5.3 Mixed Integer Nonlinear Programming Models
Integer Programming Set up the mathematical programming problem to choose the set of capital investments to make that will maximize the Net Present Value.
MIP Tools Branch and Cut with Callbacks Lazy Constraint Callback
Integer Linear Programming
ENGM 435/535 Integer Programming.
Linear Programming Integer Linear Models.
EMIS 8373: Integer Programming
1.6 Linear Programming Pg. 30.
We have the following incomplete B&B tree:
Branch-and-Bound Algorithm for Integer Program
Integer LP: Algorithms
Branch-and-Bound Technique for Solving Integer Programs
Presentation transcript:

Integer programming Branch & bound algorithm ( B&B )

Integer programming problems All integer programming problemsMixed integer programming problems

Relax the integer restriction ( try to solve it as a linear programming) Max Z = 5x 1 + 4x 2 s.t. x 1 + x 2  5 10x 1 + 6x 2  45 x 1, x 2 ≥ 0 integer

Max Z = 5x 1 + 4x 2 s.t. x 1 + x 2  5 10x 1 + 6x 2  45 x 1, x 2 ≥ 0 integer x1x1 x2x x 1 =3.75 x 2 = 1.25 z = Which none of them is integer !

Dividing the problem in every node into 2 subproblems to district the feasible region for getting to the optimal solution which is integer. x1x1 x2x x 1 ≥ 4 x 1  3

x 1 =3.75 x 2 = 1.25 z = x 1  3 x 1 ≥ 4 x 1 =3 x 2 = 2 z = 23 Fathomed : dont need to be investigated any further LOWER BOUND

x 1 =3.75 x 2 = 1.25 z = x 1  3 x 1 ≥ 4 x 1 =3 x 2 = 2 z = 23 Fathomed x 1 =4 x 2 = 0.83 z = x 2  0 x 2 ≥ 1 x 1 =4.5 x 2 = 0 z = 22.5 No solution Fathomed x 1 =4 x 2 = 0 z = 20 No solution x 1  4 x 1 ≥ 5 LOWER BOUND

1) fathoming (bounding) Z cannot yield a better objective value than the lower bound Z yields a better objective value than the lower bound Subproblem has no feasible solution Update the lower bound

2)Branching Fractional part [x] < x < [x] +1 [x] ≤ xx ≤ [x] +1

In Minimization problems, we just replace lower bound with upper bound