Integer Programming II

Slides:



Advertisements
Similar presentations
Thursday, April 11 Some more applications of integer
Advertisements

In the LP models The decision variables are allowed to have fractional values. There is a unique objective function. All mathematical expression (objective.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 16 Integer Programming.
1 Material to Cover  relationship between different types of models  incorrect to round real to integer variables  logical relationship: site selection.
IP modeling techniques I In this handout, Modeling techniques:  Using binary variables  Restrictions on number of options  Contingent decisions  Variables.
1 Chapter 11 Here we see cases where the basic LP model can not be used.
Pure, Mixed-Integer, Zero-One Models
Linear Programming Problem
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.
Linear Programming Models & Case Studies
B-1 Operations Management Linear Programming Module B - New Formulations.
Introduction to Linear and Integer Programming
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Integer Programming.
5-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Integer Programming Chapter 5.
Introduction to Management Science
Computational Methods for Management and Economics Carla Gomes
Integer Programming Integer programming is a solution method for many discrete optimization problems Programming = Planning in this context Origins go.
Linear Programming Integer Linear Models. When Variables Have To Be Integers Example – one time production decisions –Fractional values make no sense.
Integer Programming Integer Linear Programming A ll-Integer Linear Program AA ll variables must be integers Mixed-Integer Linear Program SSome, but.
Chapter 5 Integer Programming. What is an integer program (IP)? IP is a linear program in which all or some variables can only take integral values. A.
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.
Introduction to Mathematical Programming OR/MA 504 Chapter 5 Integer Linear Programming.
DECISION MODELING WITH MICROSOFT EXCEL Copyright 2001 Prentice Hall Publishers and Ardith E. Baker IntegerOptimization Chapter 6.
Integer programming Branch & bound algorithm ( B&B )
Introduction to Management Science
Decision Procedures An Algorithmic Point of View
1 1 Slide Integer Linear Programming Professor Ahmadi.
1 1 Slide Integer Linear Programming Professor Ahmadi.
Introduction to Management Science
Integer Programming Integer programming is a solution method for many discrete optimization problems Programming = Planning in this context Origins go.
Spreadsheet Modeling & Decision Analysis:
Chapter 9 Integer Programming
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.
Spreadsheet Modeling and Decision Analysis, 3e, by Cliff Ragsdale. © 2001 South-Western/Thomson Learning. 6-1 Integer Linear Programming Chapter 6.
Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.
Integer Programming Each year CrossChek decides which lines of golf clubs and clothing it will market. Consider that each line of golf clubs is expected.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
WOOD 492 MODELLING FOR DECISION SUPPORT
15.053Tuesday, April 9 Branch and Bound Handouts: Lecture Notes.
Integer Programming Li Xiaolei. Introduction to Integer Programming An IP in which all variables are required to be integers is called a pure integer.
Sensitivity analysis continued… BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12 th edition – some slides are directly.
Integer LP In-class Prob
Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.
8/14/04 J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 6 – Integer Programming Models Topics.
Integer Programming Definition of Integer Programming If requiring integer values is the only way in which a problem deviates from.
1 Chapter 9 Mixed-Integer Programming. 2 Chapter 9 Enumeration approach for 20 objects (0,1): 2 20 possibilities, evaluate each case for satisfying constraint.
Integer Programming, Branch & Bound Method
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
IE 312 Review 1. The Process 2 Problem Model Conclusions Problem Formulation Analysis.
Chapter 6 Optimization Models with Integer Variables.
0 Integer Programming Introduction to Integer Programming (IP) Difficulties of LP relaxation IP Formulations Branch and Bound Algorithms Reference: Chapter.
Integer Programming An integer linear program (ILP) is defined exactly as a linear program except that values of variables in a feasible solution have.
Business Department SPRING FINAL EXAM/REVISION.
Chapter 5 Linear Inequalities and Linear Programming
Introduction to Operations Research
1.3 Modeling with exponentially many constr.
Heuristics Definition – a heuristic is an inexact algorithm that is based on intuitive and plausible arguments which are “likely” to lead to reasonable.
Integer Programming Set up the mathematical programming problem to choose the set of capital investments to make that will maximize the Net Present Value.
Integer Programming (정수계획법)
Integer Linear Programming
1.3 Modeling with exponentially many constr.
ENGM 435/535 Integer Programming.
Linear Programming Integer Linear Models.
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
REVIEW FOR EXAM 1 Chapters 3, 4, 5 & 6.
Integer Linear Programming
Integer Programming (IP)
Presentation transcript:

Integer Programming II ENGM 435/535 Integer Programming II

Prototype Problem Consider an investment problem in a firm is planning construction of new buildings at 4 sites in the city. These sites are designated 1, 2, 3, and 4. At each site there are three possible designs designated A, B, C. The OR Analyst is to model the problem to help management decide on which sites to build and which design to use at the selected sites.

Prototype Problem Consider an investment problem in a firm is planning construction of new buildings at 4 sites in the city. These sites are designated 1, 2, 3, and 4. At each site there are three possible designs designated A, B, C. The OR Analyst is to model the problem to help management decide on which sites to build and which design to use at the selected sites. The table below shows alternatives, investment required and annual income. Option A1 B1 C1 A2 B2 C2 A3 B3 C3 A4 B4 C4 Investment 12 20 24 30 39 45 10 -- 28 42 50 55 Return 2 4 6 5 7 11 16 19 22 The company has a total investment budget of 80. Our objective is to maximize yearly income.

Prototype Formulation Let Max Z=2yA1+4yB1+6yC1+5yA2+7yB2+11yC2+ 5yA3+--+12yC3+ 16yA4+19yB4+22yC4 Subject to 12yA1+20yB1+24yC1+30yA2+39yB2+45yC2+10yA3+28yC3+42yA4+50yB4+55yC4 < 80 In addition to the budget constraint, we have several logical constraints. For example we will not put more than one design on a site.

Prototype Formulation Let Max Z=2yA1+4yB1+6yC1+5yA2+7yB2+11yC2+ 5yA3+--+12yC3+ 16yA4+19yB4+22yC4 Subject to 12yA1+20yB1+24yC1+30yA2+39yB2+45yC2+10yA3+28yC3+42yA4+50yB4+55yC4 < 80 yA1+yB1+yC1 < 1 yA2+yB2+yC2 < 1 yA3+ yC3 < 1 yA4+yB4+yC4 < 1

Prototype Formulation Contingent: Plan A will only be available for sites 1, 2, 3 if it is used at site 4 Max Z=2yA1+4yB1+6yC1+5yA2+7yB2+11yC2+ 5yA3+--+12yC3+ 16yA4+19yB4+22yC4 Subject to 12yA1+20yB1+24yC1+30yA2+39yB2+45yC2+10yA3+28yC3+42yA4+50yB4+55yC4 < 80 yA1+yB1+yC1 < 1 yA2+yB2+yC2 < 1 yA3+ yC3 < 1 yA4+yB4+yC4 = 1 yA1+yA2+yA3 < 3yA4 yA1+yA2+yA3 - 3yA4 < 0

Prototype Formulation B1, B2, and C4 cannot all be built because of competitive bids Max Z=2yA1+4yB1+6yC1+5yA2+7yB2+11yC2+ 5yA3+--+12yC3+ 16yA4+19yB4+22yC4 Subject to 12yA1+20yB1+24yC1+30yA2+39yB2+45yC2+10yA3+28yC3+42yA4+50yB4+55yC4 < 80 yA1+yB1+yC1 < 1 yA2+yB2+yC2 < 1 yA3+ yC3 < 1 yA4+yB4+yC4 = 1 yA1+yA2+yA3 - 3yA4 < 0 yB1+yB2+yC4 < 2

Standard Form This may require rearranging variables Max in standard form equally valid

Non-binary Problems Max Z = 4x1 + 3x2 s.t. 9x1+ 6x2 < 54 x1 , x2 integer valued

Relaxed Feasible Region 7X1+8X2 = 56 9X1+6X2 = 54 X2 = 5 b c X1 = 5 d e f a 0 1 2 3 4 5 6

Real Feasible Region 7X1+8X2 = 56 9X1+6X2 = 54 X2 = 5 X1 = 5 0 1 2 3 4 5 6

Solution Techniques Optimization Complete Enumeration

Real Feasible Region 7X1+8X2 = 56 9X1+6X2 = 54 X2 = 5 15 12 9 6 3 22 22 16 13 10 7 4 26 20 17 14 11 8 24 21 18 15 12 25 22 19 16 23 20 X1 = 5 0 1 2 3 4 5 6

Solution Techniques Optimization Complete Enumeration Branch and Bound Not very practical Branch and Bound

Example Branching Tree Z=25.12 X1=3 Z=25.4 All Z=25 X1 X2 Answer Profit Coefficients $4 $3 Constraint Coefficients Used Right Side C1 9 6 54 < C2 7 8 52 56 C3 1 4 5 C3b > C4 3 Variables (Produced) 3.000000014 Total Profit $25.00 X1=4 Integer Solution

Example Branching Tree Z=24.14 X1<3 X2=5 Z=25.12 X1<3 NI Z=25.4 Z=24 All X2=4 Z=25 X1=4 Integer Solution Integer Solution

Example Branching Tree Z=23 X1<2 X2=5 Z=24.14 X1<3 X2=5 Z=25.12 X1<3 NI Z=25.4 Z=24 All X2=4 Z=25 X1=4 Integer Solution Integer Solution

Example Branching Tree Z=23 X1<2 X2=5 Z=24.14 X1<3 X2=5 Z=25.12 X1<3 NI X1=3 X2=5 No Feasible Z=25.4 Z=24 All X2=4 Z=25 X1=4 Integer Solution Integer Solution

Example Branching Tree Z=23 X1<2 X2=5 Z=24.14 X1<3 X2=5 Z=25.12 X1<3 NI X1=3 X2=5 No Feasible Z=25.4 Z=24 All X2=4 Z=25 X1=4 Integer Solution Optimal

Solution Techniques Optimization Heuristics Complete Enumeration Not very practical Branch and Bound Can be complicated, particularly for non-binary Heuristics Rounding

Non-binary Problems Max Z = 4x1 + 3x2 s.t. 9x1+ 6x2 < 54 x1 , x2 integer valued

Non-binary Problems Max Z = 4x1 + 3x2 s.t. 9x1+ 6x2 < 54

Non-binary Problems Max Z = 4x1 + 3x2 s.t. 9x1+ 6x2 < 54 X1=4, X2=3 Optimal but would we round to here?

Solution Techniques Optimization Heuristics Complete Enumeration Not very practical Branch and Bound Can be complicated, particularly for non-binary Heuristics Rounding Nearest Neighbor

Traveling Salesman Problem Let

Traveling Salesman Problem

Traveling Example Nearest Neighbor Start with any city From all cities not yet on the path, find the closest city Connect these two; find next closes Complete loop by connecting last to first

Traveling Example

Traveling Example

Traveling Example

Traveling Example

Solution Techniques Optimization Complete Enumeration Not very practical Branch and Bound Can be complicated, particularly for non-binary Heuristics (Optimality is not guaranteed) Rounding Nearest Neighbor

Classic IP Problems Plant Location Capital Budgeting Traveling Salesman Assembly Line Balancing

Plant Location

Capital Budgeting

Traveling Salesman Problem

Line Balancing