1.224J Recitation #2 Integer Programs. Topics Questions & office hrs Sensitivity analysis review Importance of linear IP formulation –Branch and bound.

Slides:



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

IEOR 4004 Final Review part II.
1 Material to Cover  relationship between different types of models  incorrect to round real to integer variables  logical relationship: site selection.
BU Decision Models Integer_LP1 Integer Optimization Summer 2013.
Understanding optimum solution
Linear programming: lp_solve, max flow, dual CSC 282 Fall 2013.
Solving Linear Programming Models. Topics Computer Solution Sensitivity Analysis.
Transportation, Transshipment and Assignment Models and Assignment Models.
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Operations Management Linear Programming Module B - Part 2
Water Resources Development and Management Optimization (Integer Programming) CVEN 5393 Mar 11, 2013.
Integer Programming 3 Brief Review of Branch and Bound
Math443/543 Mathematical Modeling and Optimization
Approximation Algorithms
Review of Reservoir Problem OR753 October 29, 2014 Remote Sensing and GISc, IST.
AMPL Presentation 1 By Raymond Kleinberg Outline AMPL - Ugh! - What is it good for? Basics Starting a Problem Running the Problem Example.
1 Integrality constraints Integrality constraints are often crucial when modeling optimizayion problems as linear programs. We have seen that if our linear.
LP formulation of Economic Dispatch
0 Integer Programming Introduction to Integer Programming (IP) Difficulties of LP relaxation IP Formulations Branch and Bound Algorithms.
1 Lecture 4 Maximal Flow Problems Set Covering Problems.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Branch & Bound UPPER =  LOWER = 0.
Chapter Topics Computer Solution Sensitivity Analysis
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Notes 6IE3121 Knapsack Model Intuitive idea: what is the most valuable collection of items that can be fit into a backpack?
Spring 03 Vande Vate1 Practice Final: Linear? param T; param Demand{1..T}; var InitialLevel; var GrowthRate; var Estimate{1..T}; minimize TotalError:
Operational Research & ManagementOperations Scheduling Workforce Scheduling 1.Days-Off Scheduling 2.Shift Scheduling 3. Cyclic Staffing Problem (& extensions)
Notes 5IE 3121 Knapsack Model Intuitive idea: what is the most valuable collection of items that can be fit into a backpack?
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
Chapter 24 – Multicriteria Capital Budgeting and Linear Programming u Linear programming is a mathematical procedure, usually carried out by computer software,
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
1 1 Slide © 2005 Thomson/South-Western Simplex-Based Sensitivity Analysis and Duality n Sensitivity Analysis with the Simplex Tableau n Duality.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Integer Linear Programming Terms Pure integer programming mixed integer programming 0-1 integer programming LP relaxation of the IP Upper bound O.F. Lower.
CPS Brief introduction to linear and mixed integer programming
CPS 173 Linear programming, integer linear programming, mixed integer linear programming
8/14/04 J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 6 – Integer Programming Models Topics.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
Management Science 461 Lecture 3 – Covering Models September 23, 2008.
Chapter 8 of Quantitative Methods for Business by Anderson, Sweeney and Williams Read sections 8.1, , 8.4 (omitting “Simultaneous Changes”), 8.5,
IE 312 Review 1. The Process 2 Problem Model Conclusions Problem Formulation Analysis.
Anytime Planning of Optimal Schedules for a Mobile Sensing Robot JINGJIN YU JAVED ASLAM SERTAC KARAMAN DANIELA RUS SPEAKER: SANKALP ARORA.
1.3 Modeling with exponentially many constr. Integer Programming
Linear Programming Wyndor Glass Co. 3 plants 2 new products –Product 1: glass door with aluminum framing –Product 2: 4x6 foot wood frame window.
Chapter 9 Integer Programming to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
Discrete Optimization MA2827 Fondements de l’optimisation discrète Material from P. Van Hentenryck’s course.
0 Integer Programming Introduction to Integer Programming (IP) Difficulties of LP relaxation IP Formulations Branch and Bound Algorithms Reference: Chapter.
Airport Gate Scheduling
CPS Brief introduction to linear and mixed integer programming
Water Resources Development and Management Optimization (Integer and Mixed Integer Programming) CVEN 5393 Mar 28, 2011.
integer linear programming, mixed integer linear programming
Air France Reservations Phone Number
Traveling Salesman Problem
Integer Programming II
1.3 Modeling with exponentially many constr.
MIP Tools Branch and Cut with Callbacks Lazy Constraint Callback
Integer Programming (정수계획법)
Sensitivity.
1.3 Modeling with exponentially many constr.
Brief introduction to linear and mixed integer programming
Linear Programming Applications in Services
Linear Programming Example: Maximize x + y x and y are called
Integer Programming (정수계획법)
EMIS 8373: Integer Programming
Lecture 6 – Integer Programming Models
REVIEW FOR EXAM 1 Chapters 3, 4, 5 & 6.
Integer Programming Chapter 5.
Presentation transcript:

1.224J Recitation #2 Integer Programs

Topics Questions & office hrs Sensitivity analysis review Importance of linear IP formulation –Branch and bound Modeling power of IP Two examples –Pure IP –MIP

Sensitivity analysis for LPs Reduced Costs –Associated with OBJECTIVE FUNCTION –Tells when a non- basic variable becomes “attractive” Shadow Prices –Associated with CONSTRAINTS –Also called dual vars – Tells how important each constraint is

Linear IP formulations IPs are solved using linear programming as the underlying strategy. At the blackboard: –Relaxation –Branch and bound Note: no difference in compuational difficulty between IPs and MIPs.

Extra modeling power of IPs Fixed costs Range constraints for x Overtime pay

Example 1 (an IP): TSP Traveling salesman problem (TSP): find the shortest through all cities.

Example 2 (a MIP): The Political coverage or Coffee seller or Missionary problem Which cities to visit, starting from your base city, and how long to stay there, to maximize converts (to your political party, coffee brand, or religion) subject to budget and time constraints. Time in the air is time not converting people!

One more constraint… How to model the following? Due to airline flight deals, the person must stay at each destination city 1/2, 3, or 7 days.