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.

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

BU Decision Models Integer_LP1 Integer Optimization Summer 2013.
LIAL HORNSBY SCHNEIDER
OPSM 301 Operations Management
Linear Programming.
Approximation Algorithms Chapter 14: Rounding Applied to Set Cover.
Introduction to Management Science
1 Lecture 3 MGMT 650 Sensitivity Analysis in LP Chapter 3.
Chapter 5 Linear Inequalities and Linear Programming
Learning Objectives for Section 5.3
Chapter 5 Linear Inequalities and Linear Programming Section 3 Linear Programming in Two Dimensions: A Geometric Approach.
8/27: Linear Programming Lecture: LP Small Groups Homework.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Kerimcan OzcanMNGT 379 Operations Research1 Integer Linear Programming Chapter 8.
1 Maximum matching Max Flow Shortest paths Min Cost Flow Linear Programming Mixed Integer Linear Programming Worst case polynomial time by Local Search.
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.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Review of Reservoir Problem OR753 October 29, 2014 Remote Sensing and GISc, IST.
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.
Linear Programming Example 2 Alternate Optimal Solutions.
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’
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.
Linear Programming David Kauchak cs161 Summer 2009.
Decision Procedures An Algorithmic Point of View
Production and Operations Management An area of management concerned with overseeing, designing, and controlling the production of goods or services It.
Chapter 11: Hillier and Lieberman Dr. Hurley’s AGB 328 Course
Decision Making via Linear Programming: A simple introduction Fred Phillips
1 1 Slide © 2005 Thomson/South-Western Chapter 8 Integer Linear Programming n Types of Integer Linear Programming Models n Graphical and Computer Solutions.
1 1 Slide Integer Linear Programming Professor Ahmadi.
1 1 Slide Integer Linear Programming Professor Ahmadi.
Optimization Models Mathematical optimization models usually contain an objective (what to do) constraints (the rules that must be followed). Also referred.
CrossChek Sporting Goods CrossChek Sporting Goods is a manufacturer of sporting goods, including golf clubs, hockey equipment, bats, balls and all things.
Chapter 12 Discrete Optimization Methods
Integer Programming Integer programming is a solution method for many discrete optimization problems Programming = Planning in this context Origins go.
Spreadsheet Modeling & Decision Analysis:
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.
To accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Fourth Edition  1996 Addison-Wesley Publishing Company, Inc. All rights.
Range of Feasibility For phase 2 of manufacturing, the allowable increase is 40 (LINDO) Thus the dual price of $125 is valid for any increase in the allowable.
Goal Seek and Solver. Goal seeking helps you n Find a specific value for a target cell by adjusting the value of one other cell whose value is allowed.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
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.
Chapter 8 Integer Linear Programming n Types of Integer Linear Programming Models n Graphical and Computer Solutions for an All- Integer Linear Program.
Integer Programming Definition of Integer Programming If requiring integer values is the only way in which a problem deviates from.
5-1 Copyright © 2013 Pearson Education Integer Programming: The Branch and Bound Method Module C.
OPSM 301 Operations Management Class 11: Linear Programming using Excel Koç University Zeynep Aksin
Integer Programming, Branch & Bound Method
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
1 Geometrical solution of Linear Programming Model.
1 Simplex algorithm. 2 The Aim of Linear Programming A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear.
Chapter 9 Integer Programming to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
Integer Programming An integer linear program (ILP) is defined exactly as a linear program except that values of variables in a feasible solution have.
Linear Programming – Introduction
Chapter 5 Linear Inequalities and Linear Programming
Integer Programming II
Chapter 9 Integer Programming
Linear Programming A potter wants to make and sell serving bowls and plates. A bowl uses 5 pounds of clay. A plate uses 4 pounds of clay. The potter has.
Integer Linear Programming
ENGM 435/535 Optimization Adapting to Non-standard forms.
ENGM 435/535 Integer Programming.
Linear Programming Integer Linear Models.
Linear Programming Integer Linear Models.
Integer Linear Programming
Presentation transcript:

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 to generate $400K profit for the year, while each new line of golf clothing generates $300K profit for the year. Each new offering requires time for marketing (clubs 50 hrs, clothing 60 hrs), which is limited to 300 hrs, as well as storage space (clubs 900 sq ft, clothes 400 sq ft), which is limited to 3600 sq ft. CrossChek will not consider marketing any more than 4 lines of clothing. How many new lines of golf clubs and clothing should be offered? 1

Integer Programming Solution: 2.82 lines of golf clubs 2.65 lines of golf clothing Profit: $1,923,529 2

Integer Programming Solution: 2.82 lines of golf clubs 2.65 lines of golf clothing Could round down: 2 lines of golf clubs 2 lines of golf clothing Profit = $1.4 million Feasible. But optimal? 3

Integer Programming in LINDO Max 400x x2 st 50x1 + 60x2 < x x2 < 3600 x2 < 4 x1 > 0 x2 > 0 END GIN x1 GIN x2 4

ILP Notes Removing the integer specifications for an integer linear programming problem gives the LP relaxation The value of an LP relaxation for a maximization ILP is an upper bound on the value of the ILP Meaning that the value of the objective function for the optimal integer solution is no higher than that for the LP relaxation For a minimizing ILP, the LP relaxation gives a lower bound 5

ILP Notes An integer linear programming problem in which all variables must be integers is referred to as an All Integer Linear Program (AILP) An integer linear programming problem in which some variables must be integers is referred to as a Mixed Integer Linear Program (MILP) 6

ILP with 0-1 Variables CrossChek is considering expanding its retail outlets. Possible locations for such outlets are Toronto, Vancouver, Montreal and Fredericton. A maximum of one outlet would exist in each city. Startup costs, advertising and marketing costs, and time required to get each outlet in operation are as follows, as well as expected first-year profits (all dollar values in thousands; all times in number of days). The objective is to maximize first-year profits. Into which cities should CrossChek expand? CityStart-up costsTimeAdvertising costsFirst-year profits Toronto Vancouver Montreal Fredericton Limit

Defining 0-1 Variables in LINDO Max 50x1 + 45x2 + 35x3 + 5x4 st 100x1 + 80x2 + 90x3 + 70x4 < x1 + 40x2 + 35x3 + 25x4 < x1 + 80x2 + 25x3 + 20x4 < 100 END INT x1 INT x2 INT x3 INT x4 8

k-out-of-n Alternatives Constraints Considering the same problem, add each of the following constraints: CrossChek would like to ensure that: a) Exactly one outlet is added b) At least one outlet goes in Montreal or Fredericton c) Exactly three outlets are added d) Two of Montreal, Fredericton and Vancouver are added e) One of Toronto or Vancouver are added but not both 9

Conditional Constraints Considering the same problem, add each of the following constraints: CrossChek would like to ensure that: a) If an outlet in Toronto is added, then an outlet in Fredericton is added b) If an outlet in Fredericton is not added, then one in Vancouver must be added c) If an outlet in Toronto is added then we cannot add one in Vancouver d) If an outlet in Vancouver is added, then at least one outlet in Montreal or Fredericton must be added 10

Multiple Choice Constraints Considering the same problem, consider that there are three possible sites for the Vancouver option: downtown, midtown, uptown. We’ve decided to develop in Vancouver for sure. How do we model this choice as a constraint? Let v1 be equal to 1 if the downtown location is chosen Let v2 be equal to 1 if the midtown location is chosen Let v3 be equal to 1 if the uptown location is chosen What if development in Vancouver is not a certainty? 11

Fixed Cost Problems Returning to the CrossChek golf clubs/clothing strategy example. Suppose there is a fixed cost for licensing fees associated with venturing into the golf clothing market of $200K. That is, it will cost an extra $200K if it chooses to sell any golf clothing. What is the optimal course of action? What if the fixed cost were $100K? 12

Solution Max 400x x d st 50x1 + 60x2 < x x2 < 3600 x2 - 4d < 0 x1 > 0 x2 > 0 END GIN x1 GIN x2 INT d 13

Fixed Cost Problems Returning to the original CrossChek golf clubs/clothing strategy example. Suppose there are two different marketing companies from which to choose. Marketing company 1 costs $70K, requires 50 hrs for each line of clubs and 60 hrs for each line of clothing, which is limited to 300 hrs, and marketing company 2 costs $80K, requires 40 hrs for each line of clubs and 45 hrs for each line of clothing, which is limited to 270 hrs. CrossCheck will go with either one marketing company or the other. What is the optimal course of action? 14

Solution Max 400x x2 - 70d1 - 80d2 st 50x1 + 60x d1 < x1 + 45x d2 < x x2 < 3600 d1 + d2 = 1 x2 < 4 x1 > 0 x2 > 0 END GIN x1 GIN x2 INT d1 INT d2 15