Zahra_Mohaghegh_April%201th

# Zahra_Mohaghegh_April%201th - Engineering Management...

This preview shows pages 1–9. Sign up to view the full content.

1 Engineering Management & Systems Engineering The George Washington University EMSE 102 EMSE 102 - - 202 202 Survey of Operations Research Methods Survey of Operations Research Methods Zahra Mohaghegh [email protected] Post-Doctoral Research Associate Center For Risk and Reliability University of Maryland April 01, 2008

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Engineering Management & Systems Engineering The George Washington University Integer Programming Integer Programming
3 Engineering Management & Systems Engineering The George Washington University Outline Outline ± Integer Programming Concept ± Geometrical Interpretation of IPs ± Formulating IP problems ± Personnel scheduling (solving with LINDO) ± The Knapsack Problem ± One-time Decision problems ± Set-covering Problems ± Fixed Charge problems: ± Modeling Gandhi Clothing Fixed Costs ± Lockbox problem ± Either-or logic ± If-then Logic ± Techniques for solving Integer Programs ( Branch and Bound Method)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4 Engineering Management & Systems Engineering The George Washington University Introduction Introduction ± An integer program is a linear program that requires some decision variables to take integer values. ± Example: assignment problems seen earlier, (fractional values have no useful meaning). ± Dramatically improves the modeling capability. Examples: ± Economic indivisibilities ± Logical constraints ± classical problems in capital budgeting and in supply chain management ± Disadvantages! ± More difficult to model ± Can be much more difficult to solve ± Integer programming is an active area of research
5 Engineering Management & Systems Engineering The George Washington University Types of Types of IPs IPs ± IP : A pure integer program is one where all decisions variables are required to take integer values. ± MIP : A mixed integer program is one where some, but not all, decision variables are required to take integer values. ± BIP : A binary integer program or 0-1 integer program requires decision variables to take values in the set {0,1}. ± The LP relaxation of an IP is the LP that results when the integer or 0-1 constraints are removed.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
6 Engineering Management & Systems Engineering The George Washington University max z = 3 x 1 + 2 x 2 s . t . x 1 + x 2 6, x 1 , x 2 0, x 1 , x 2 integer max z = 3 x 1 + 2 x 2 s . t x 1 + x 2 x 1 , x 2 0, x 1 integer max z = x 1 x 2 s . t x 1 + 2 x 2 2, 2 x 1 x 2 1, x 1 , x 2 = 0 or 1 A pure integer program (IP): A mixed integer program (MIP): A 0-1 Integer program (BIP): Examples Examples
7 Engineering Management & Systems Engineering The George Washington University Outline Outline ± Integer Programming Concept ± Geometrical Interpretation of IPs ± Formulating IP problems ± Personnel scheduling (solving with LINDO) ± The Knapsack Problem ± One-time Decision problems ± Set-covering Problems ± Fixed Charge problems: ± Modeling Gandhi Clothing Fixed Costs ± Lockbox problem ± Either-or logic ± If-then Logic ± Techniques for solving Integer Programs ( Branch and Bound Method)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
8 Engineering Management & Systems Engineering
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/02/2010 for the course EMSE 202 taught by Professor Mohaghegh,abeledo during the Spring '07 term at GWU.

### Page1 / 100

Zahra_Mohaghegh_April%201th - Engineering Management...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online