MODELING (Integer Programming Examples)
|
|
- Joy Hutchinson
- 5 years ago
- Views:
Transcription
1 MODELING (Integer Programming Eamples)
2 IE 400 Principles of Engineering Management Integer Programming: Set 5
3
4
5
6
7 Integer Programming: So far, we have considered problems under the following assumptions: i. Proportionality & Additivity ii. Divisibility iii. Certainty While many problems satisfy these assumptions, there are other problems in which we will need to either rela these assumptions. For eample, consider the following bus scheduling problem:
8 Integer Programming : Bus Scheduling: Periods Hours 0-4 AM 4-8 AM 8 AM 2 PM 2-4 PM 4 8 PM 8 PM-0AM Min. # of buses required Each bus starts to operate at the beginning of a period and operates for 8 consecutive hours and then receives 6 hours off. For eample, a bus operating from 4 AM to 2 PM must be off between 2 PM and 4 AM. Find the minimum # of busses to provide the required service.
9 Integer Programming : Bus Scheduling: Periods Hours 0-4 AM 4-8 AM 8 AM 2 PM 2-4 PM 4 8 PM 8 PM-0AM Min. # of buses required How do you define your decision variables here? a) i : # of busses operating in period i, i=,2,,6 or b) i : # of busses starting to operate in period i, i=,2,,6
10 Integer Programming : The alternative b makes modeling of this problem much easier. It is not possible to keep track of the total number of busses under alternative a. (WHY?) The model is as follows:
11 Integer Programming : The alternative b makes modeling of this problem much easier. It is not possible to keep track of the total number of busses under alternative a. (WHY?) The model is as follows: min s.t ³ ³ ³ ³ ³ ³ i ³ 0, i integer, i =,
12 Integer Programming : Note that each decision variable represents the number of busses. Clearly, it does not make sense to talk about 3.5 busses because busses are not divisible. Hence, we should impose the additional condition that each of,..., 6 can only take integer values. If some or all of the variables are restricted to be integer valued, we call it an integer program (IP). This last eample is hence an IP problem.
13 Work Scheduling: Burger Queen would like to determine the min # of kitchen employees. Each employee works si days a week and takes the seventh day off. Days Mon Tue Wed Thu Fri Sat Sun Min. # of workers How do you formulate this problem? The objective function? The constraints?
14 Work Scheduling: Burger Queen would like to determine the min # of kitchen employees. Each employee works si days a week and takes the seventh day off. Days Mon Tue Wed Thu Fri Sat Sun Min. # of workers i : # of workers who are not working on day i, i =,..., 7 (: Mon, 7: Sun)
15 Work Scheduling: Decision Variables: IP Model:
16 The Assignment Problem : There are n people and n jobs to carry out. Each person is assigned to carry out eactly one job. If person i is assigned to job j, then the cost is c ij. P P 2 J J 2 Find an assignment of n people to n jobs with minimum total cost. P n J n
17 The Assignment Problem : ij = ì í î, 0, person i isassigned to otherwise job j P P 2 J J 2 i =,2,!, n ; j =,2,!, n Such variables are called BINARY VARIABLES and offer great fleibility in modeling. They are ideal for YES/NO decisions. P n J n So how is the problem formulated?
18 The Assignment Problem : The problem is formulated as follows: min n n åå i= j= c ij ij s.t. n å j= ij =, i =,...,n (person i is assigned to eactly one job) n å i= ij =, j =,...,n (job j is assigned to eactly one person) ij Î{0,}, i =,...n; j =,... n This is still an eample of an IP problem since ij can only take one of the two integer values 0 and.
19 The 0- Knapsack Problem You are going on a trip. Your Suitcase has a capacity of b kg s. You have n different items that you can pack into your suitcase,..., n. Item i has a weight of a i and gives you a utility of c i. How should you pack your suitcase to maimize total utility?
20 The 0- Knapsack Problem Decision Variables: IP Model:
21 Workforce Scheduling Monthly demand for a shoe company Month A pair of shoes requires 4 hours of labor and $5 worth of raw materials 50 pairs of shoes in stock Monthly inventory cost is charged for shoes in stock at the end of each month at $30/pair Currently 3 workers are available Salary $500/month Each worker works 60 hours/month Hiring a worker costs $600 Firing a worker costs $ Demand
22 Workforce Scheduling Monthly demand for a shoe company Month A pair of shoes requires 4 hours of labor and $5 worth of raw materials 50 pairs of shoes in stock Monthly inventory cost is charged for shoes in stock at the end of each month at $30/pair Currently 3 workers are available How to meet demand with Salary $500/month minimum total cost? Each worker works 60 hours/month Hiring a worker costs $600 Firing a worker costs $ Demand
23 IP Model For Workforce Scheduling Decision Variables: LP Model: 23
24 The Cutting Stock Problem: A paper company manufactures and sells rolls of paper of fied width in 5 standard lengths: 5, 8, 2, 5 and 7 m. Demand for each size is given below. It produces 25 m length rolls and cuts orders from its stock of this size. What is the min # of rolls to be used to meet the total demand? Length (meters) Demand
25 The Cutting Stock Problem: First, identify the cutting patterns:
26 The Cutting Stock Problem: Then how do you define the decision variable? j : # of rolls cut according to pattern j.
27 The Cutting Stock Problem: Then how do you define the decision variable? j : # of rolls cut according to pattern j. What about the constraints? i.e. How do you write the constraint for the demand of 2 m rolls of paper? We look at the patterns that contain 2 m pieces, and then write the constraint based on j. Length (meters) Demand
28 The Cutting Stock Problem: The cutting patterns:
29 The Cutting Stock Problem: The cutting patterns: ³ Why do we have sign?
30 The Cutting Stock Problem: Then how do you define the decision variable? j : # of rolls cut according to pattern j. What about the constraints? i.e. What about demand for 5 m? Length (meters) Demand
31 The Cutting Stock Problem: The cutting patterns:
32 The Cutting Stock Problem: The cutting patterns: ³
33 The Cutting Stock Problem: The problem is formulated as follows: min s.t. j= ³ ³ ³ j ³ 0, j =,...,, integer. j å ³ ³ j
34 Project Selection A manager should choose from among 0 different projects: p j : profit if we invest in project j, j =,..., 0 c j : cost of project j, j =,..., 0 q: total budget available There are also some additional requirements: i. Projects 3 and 4 cannot be chosen together ii. Eactly 3 projects are to be selected iii. If project 2 is selected, then so is project iv. If project is selected, then project 3 should not be selected v. Either project or project 2 is chosen, but not both vi. Either both projects and 5 are chosen or neither are chosen vii. At least two and at most four projects should be chosen from the set {, 2, 7, 8, 9, 0} viii. Neither project 5 nor 6 can be chosen unless either 3 or 4 is chosen i. At least two of the investments, 2, 3 are chosen, or at most three of the investments 4, 5, 6, 7, 8 are chosen.. If both and 2 are chosen, then at least one of 9 and 0 should also be chosen.
35 Project Selection Under these requirements, the objective is to maimize the Profit. Decision Variables j ì, if project = í î 0, otherwise j =,...,0 j is chosen
36 Project Selection Objective function is: ma 0 å j= p j j
37 Project Selection Objective function is: ma å j= First the budget constraint: 0 p j j
38 Project Selection Objective function is: ma å j= First the budget constraint: 0 å j= 0 c j j p j q j
39 Project Selection Objective function is: ma å j= First the budget constraint: 0 å j= 0 p j c j j q i. Projects 3 and 4 cannot be chosen together: j
40 Project Selection Objective function is: ma å j= First the budget constraint: 0 å j= 0 p j c j j q i. Projects 3 and 4 cannot be chosen together: 3 4 j
41 Project Selection ii Eactly 3 projects are to be chosen: = 3 iii. If project 2 is chosen then so is project : 2
42 Project Selection iv If project is selected, then project 3 should not be selected - 3 v. Either project or project 2 is chosen, but not both 2 =
43 Project Selection vi. Either both projects and 5 are chosen or neither are chosen 0 or 5 5 = - = vii. At least two and at most four projects should be chosen from the set {, 2, 7, 8, 9, 0}: ³
44 Project Selection viii. Neither project 5 nor 6 can be chosen unless either 3 or 4 is chosen: Equivalently, = 0 then = 0 If = Another possibility, 5 6 2( 3 4)
45 Project Selection i. At least two of the investments, 2, 3 are chosen, or at most three of the investments 4, 5, 6, 7, 8 are chosen: It is more difficult to epress this requirement in mathematical terms due to or! 2 3 ³ 2 or ( I) ( II) 3 So we want to ensure that at least one of (I) and (II) is satisfied.
46 Either-Or Constraints The following situation commonly occurs in mathematical programming problems. We are given two constraints of the form, (, 2,... n ) 0 ( I) (,,... ) 0 ( II) f g 2 n
47 Either-Or Constraints The following situation commonly occurs in mathematical programming problems. We are given two constraints of the form, (, 2,... n ) 0 ( I) (,,... ) 0 ( II) f g 2 n We want to make sure that at least one of (I) and (II) is satisfied. These are often called either-or constraints.
48 Either-Or Constraints The following situation commonly occurs in mathematical programming problems. We are given two constraints of the form, (, 2,... n ) 0 ( I) (,,... ) 0 ( II) f g 2 n We want to make sure that at least one of (I) and (II) is satisfied. These are often called either-or constraints. Adding two new constraints as below to the formulation will ensure that at least one of (I) or (II) is satisfied, (, 2,... n ) ( I ) (, 2,... n ) ( - ) ( II ) y Î{ } f My g M y where 0,.
49 Either-Or Constraints M is a number chosen large enough to ensure that f (, 2,..., n ) M and g(, 2,..., n ) M are satisfied for all values of, 2,..., n that satisfy the other constraints in the problem.
50 Either-Or Constraints (, 2,... n ) ( I ) (, 2,... n ) ( - ) ( II ) y Î{ } f My g M y where 0,.
51 Either-Or Constraints (, 2,... n ) ( I ) (, 2,... n ) ( - ) ( II ) y Î{ } f My g M y where 0,. a) If y=0, then (I ) and (II ) becomes: f (, 2,..., n ) 0, and g (, 2,..., n ) M. Hence, this means that (I) must be satisfied, and possibly (II) is satisfied.
52 Either-Or Constraints (, 2,... n ) ( I ) (, 2,... n ) ( - ) ( II ) y Î{ } f My g M y where 0,.
53 Either-Or Constraints (, 2,... n ) ( I ) (, 2,... n ) ( - ) ( II ) y Î{ } f My g M y where 0,. b) If y=, then (I ) and (II ) becomes: f (, 2,..., n ) M, and g (, 2,..., n ) 0. Hence, this means that (II) must be satisfied, and possibly (I) is satisfied.
54 Either-Or Constraints f,,... My I ( ) ( ) 2 g,,... M - y II ( ) ( ) ( ) 2 where y Î 0,. n n { } Therefore whether y=0 or y=, (I ) and (II ) ensure that at least one of (I) and (II) is satisfied.. f,,... 0 I ( ) ( ) 2 g,,... 0 II ( ) ( ) 2 n n
55 Project Selection Now, let us return to our problem: i. At least two of the investments, 2, 3 are chosen, or at most three of the investments 4, 5, 6, 7, 8 are chosen: 2 3 ³ 2 or ( I) ( II) This is an eample of either-or constraint. Hence by defining the f(.) and g(.) functions, (I) and (II) becomes: ( ) g(.) f(.) 0 3
56 Project Selection Now, let us return to our problem: i. At least two of the investments, 2, 3 are chosen, or at most three of the investments 4, 5, 6, 7, 8 are chosen: 2 3 ³ 2 or ( I) ( II) Hence by defining a binary variable y, the formulation becomes: ( -3 4 yî{0,} ) M y M ( - y) M=2 works! We have to find M large enough to ensure that f(.) M and g(.) M for all values of,, n.
57 Project Selection Now, let us return to our problem: i. At least two of the investments, 2, 3 are chosen, or at most three of the investments 4, 5, 6, 7, 8 are chosen: 2 3 ³ 2 or ( I) ( II) Putting M=2 and rearranging the terms, we have: yî{0,} 3 6 ³ 2( - y) y
58 Project Selection. If both and 2 are chosen, then at least one of 9 and 0 should also be chosen. Both projects and 2 are chosen if 2 = 2. At least one of projects 9 and 0 is chosen if 9 0 Hence, we have 2 = 2 Þ 9 0 ³ So, how to epress this as a linear constraint?
59 If-Then Constraints The following situation commonly occurs in mathematical programming problems. We want to ensure that: If a constraint f(,, n )>0 is satisfied, then g(,, n ) 0 must be satisfied; while if a constraint f(,, n )>0 is not satisfied, then g(,, n ) 0 may or may not be satisfied.
60 If-Then Constraints In other words, we want to ensure that f(,, n )>0 implies g(,, n ) 0. Logically, this is equivalent to: f ( g(,, 2 or 2,...,,..., n n ) 0 ) 0 ( I) ( II)
61 If-Then Constraints f ( g(,, 2 or 2,...,,..., n n ) 0 ) 0 ( I) ( II) Now, these are either-or type constraints and we can handle them as before by defining a binary variable, say z: f ( g(,, 2 2,...,,..., ) ) where z Î{0,} n n M ( - Where as before M is a large enough number such that f(.) M and g(.) M holds for all values,, n. Mz z)
62 Project Selection Now, let us return to our problem:. If both and 2 are chosen, then at least one of 9 and 0 should also be chosen. 2 = 2 Þ 9 0 ³ We need to define f(.)>0 and g(.) 0 constraints: equivalently 2 > Þ 9 0 ³ 2 - > 0 Þ - ( 9 0) 0 f(.) g(.)
63 Project Selection. If both and 2 are chosen, then at least one of 9 and 0 should also be chosen. 2 = 2 Þ 9 0 ³ 2 - > 0 Þ - ( 9 0) 0 f(.) g(.) Now converting to either-or, we have: or - ( ) 0 (I) (II)
64 Project Selection To linearize the above constraints, define a binary variable, say z and a large enough value M: (II) 0 ) ( r (I) o M= works and after rearranging we have: {0,} ) M( ) ( Î z z Mz {0,} Î ³ z z z
65 Project Selection. If both and 2 are chosen, then at least one of 9 and 0 should also be chosen z Î{0,} ³ z z
66 Project Selection Finally our integer programming model with linear constraints becomes: ma 0 å j= 0 å p j j c j j j= 3 4 (i) = 2 q (iii) 3 (ii) = - 2 = 0 (iv) (v) (vi)
67 Project Selection Model cont. (vii) þ ý ü ³ (viii) þ ý ü (i) 2 5 y) 2( þ ý ü - - ³ y () þ ý ü ³ z z {0,} y,z {0,},...,, 0 2 Î Î
68 Modeling Fied Costs A set of potential warehouses:,...,m A set of clients :,..., n If warehouse i is used, then there is a fied cost of f i, i =,,m c ij : unit cost of transportation from warehouse i to client j, i =,...,m ; j =,...,n a i : capacity of warehouse i in terms of # of units, i =,,m d j : # of units demanded by client j, j =,,n Note: More than one warehouse can supply the client.
69 Modeling Fied Costs How to formulate the mathematical model in order to minimize total fied costs and transportation costs while meeting the demand and capacity constraints? Decision Variables: IP Model:
70 The Set Covering Problem You wish to decide where to locate hospitals in a city. Suppose that there are 5 different towns in the city. Town Potential Location Travel Time Travel time between each town and the nearest hospital should not be more than 0 minutes. What is the minimum number of hospitals?
71 The Set Covering Problem Decision Variables: IP Model:
72 Location Problems (Cover, Center, Median) Ankara municipality is providing service to 6 regions. The travel times (in minutes) between these regions, say t ij values are: R R2 R3 R4 R5 R6 R R R R R R
73 Location Problems (Cover, Center, Median) a) Cover: The municipality wants to build fire stations in some of these regions. Find the minimum number of fire stations required if the municipality wants to ensure that there is a fire station within 5 minute drive time from each region. (Similar to??) Decision Variables: IP Model:
74 Location Problems (Cover, Center, Median) b) Median: The municipality now wants to build 2 post offices. There is going to be a back and forth trip each day from each post office to each one of the regions assigned to this post office. Formulate a model which will minimize the total trip time. Decision Variables: IP Model:
75 Location Problems (Cover, Center, Median) c) What if additional to part (b), you have the restriction that a post office cannot provide service to more than 4 regions including itself? Add the following constraint to above model:
76 Location Problems (Cover, Center, Median) d) Center: The municipality wants to build 2 fire stations so that the time to reach the farthest region is kept at minimum. Decision Variables: IP Model:
77 Location Problems (Cover, Center, Median) e) Consider the median problem in part (b). Assume that in addition to the back and forth trips between the post offices and the assigned regions, there will be a trip between the two post offices. The municipality wants to locate the offices in such a way that the total trip time is minimized. Decision Variables: IP Model:
78 Traveling Salesman Problem (TSP): A sales person lives in city. He has to visit each of the cities 2,,n eactly once and return home. Let c ij be the travel time from city i to city j, i =,..., n; j =,..., n. What is the order in which she should make her tour to finish as quickly as possible? What should be the decision variables here?
79 Traveling Salesman Problem (TSP): A sales person lives in city. He has to visit each of the cities 2,,n eactly once and return home. Let c ij be the travel time from city i to city j, i =,..., n; j =,..., n. What is the order in which she should make her tour to finish as quickly as possible? What should be the decision variables here? ij ì = í î, if he goes directly from city i to city 0, otherwise i=,2, K, n ; j =,2, K, n j
80 Traveling Salesman Problem (TSP): Since each city has to be visited only once, the formulation is: min st.. n å j= n å i= n n i= j= =, i =,..., n ij =, j =,..., n ij = 0, i =,..., n ii { } ij ij Î 0,, " i, j =,..., n ij åå c
81 Traveling Salesman Problem (TSP): With this formulation, a feasible solution is: = = =, = = But this is a subtour! How can we eliminate subtours? We need to impose the constraints: åå iîs jïs ij ³ " S Í N, S ¹Æ
82 Traveling Salesman Problem (TSP): For eample, for n=5 and S={,2,3} this constraint implies: ³ The difficulty is that there are a total of 2 n such constraints. And that is a lot! For n = 00, 2 n How about the total number of valid tours? That is (n )! For n = 00, (n )! TSP is one of the hardest problems. But several efficient algorithms eist that can find good solutions.
83 Class Eercises (Blending problem revisited with binary variables): A company produces animal feed miture. The mi contains 2 active ingredients and a filler material. kg of feed mi must contain a minimum quantity of each of the following 4 nutrients: Nutrients A B C D Required amount (in grams) in kg of mi The ingredients have the following nutrient values and costs: A B C D Cost/kg Ingredient (gram/kg) $40 Ingredient2 (gram/kg) N/A $60
84 Class Eercises (Blending problem revisited with binary variables): a) What should be the amount of active ingredients and filler material in kg of feed mi in order to satisfy the nutrient requirements at minimum total cost? Decision Variables: Model (LP or IP?)
85 Class Eercises (Blending problem revisited with binary variables): b) Suppose now that we have the following additional limitations i. If we use any of ingredient 2, we incur a fied cost of $5 (in addition to the $60 unit cost). ii. It is enough to only satisfy 3 of the nutrition requirements rather than 4. Decision Variables (Additional to those for Part a) : Model: (LP or IP?)
86 Some Comments on Integer Programming : There are often multiple ways of modeling the same integer program. Solvers for integer programs are etremely sensitive to the formulation (not true for LPs). Not as easy to model. Not as easy to solve.
Chapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Sito web: http://home.deib.polimi.it/amaldi/ott-13-14.shtml A.A. 2013-14 Edoardo
More informationWhat is an integer program? Modelling with Integer Variables. Mixed Integer Program. Let us start with a linear program: max cx s.t.
Modelling with Integer Variables jesla@mandtudk Department of Management Engineering Technical University of Denmark What is an integer program? Let us start with a linear program: st Ax b x 0 where A
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-16-17.shtml Academic year 2016-17
More information21. Set cover and TSP
CS/ECE/ISyE 524 Introduction to Optimization Spring 2017 18 21. Set cover and TSP ˆ Set covering ˆ Cutting problems and column generation ˆ Traveling salesman problem Laurent Lessard (www.laurentlessard.com)
More informationSpring 2018 IE 102. Operations Research and Mathematical Programming Part 2
Spring 2018 IE 102 Operations Research and Mathematical Programming Part 2 Graphical Solution of 2-variable LP Problems Consider an example max x 1 + 3 x 2 s.t. x 1 + x 2 6 (1) - x 1 + 2x 2 8 (2) x 1,
More informationTravelling Salesman Problem
Travelling Salesman Problem Fabio Furini November 10th, 2014 Travelling Salesman Problem 1 Outline 1 Traveling Salesman Problem Separation Travelling Salesman Problem 2 (Asymmetric) Traveling Salesman
More informationUNIVERSITY of LIMERICK
UNIVERSITY of LIMERICK OLLSCOIL LUIMNIGH Department of Mathematics & Statistics Faculty of Science and Engineering END OF SEMESTER ASSESSMENT PAPER MODULE CODE: MS4303 SEMESTER: Spring 2018 MODULE TITLE:
More informationMVE165/MMG630, Applied Optimization Lecture 6 Integer linear programming: models and applications; complexity. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming: models and applications; complexity Ann-Brith Strömberg 2011 04 01 Modelling with integer variables (Ch. 13.1) Variables Linear programming (LP) uses continuous
More informationInteger Linear Programming Modeling
DM554/DM545 Linear and Lecture 9 Integer Linear Programming Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. Assignment Problem Knapsack Problem
More informationLinear Programming. Formulating and solving large problems. H. R. Alvarez A., Ph. D. 1
Linear Programming Formulating and solving large problems http://academia.utp.ac.pa/humberto-alvarez H. R. Alvarez A., Ph. D. 1 Recalling some concepts As said, LP is concerned with the optimization of
More informationIntroduction to optimization and operations research
Introduction to optimization and operations research David Pisinger, Fall 2002 1 Smoked ham (Chvatal 1.6, adapted from Greene et al. (1957)) A meat packing plant produces 480 hams, 400 pork bellies, and
More information15.081J/6.251J Introduction to Mathematical Programming. Lecture 24: Discrete Optimization
15.081J/6.251J Introduction to Mathematical Programming Lecture 24: Discrete Optimization 1 Outline Modeling with integer variables Slide 1 What is a good formulation? Theme: The Power of Formulations
More informationWorkforce Scheduling. Outline DM87 SCHEDULING, TIMETABLING AND ROUTING. Outline. Workforce Scheduling. 1. Workforce Scheduling.
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 17 Workforce Scheduling 2. Crew Scheduling and Roering Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Workforce Scheduling
More informationAM 121: Intro to Optimization Models and Methods Fall 2018
AM 121: Intro to Optimization Models and Methods Fall 2018 Lecture 11: Integer programming Yiling Chen SEAS Lesson Plan Integer programs Examples: Packing, Covering, TSP problems Modeling approaches fixed
More informationMATH 445/545 Homework 1: Due February 11th, 2016
MATH 445/545 Homework 1: Due February 11th, 2016 Answer the following questions Please type your solutions and include the questions and all graphics if needed with the solution 1 A business executive
More informationMEP Y7 Practice Book B
8 Quantitative Data 8. Presentation In this section we look at how vertical line diagrams can be used to display discrete quantitative data. (Remember that discrete data can only take specific numerical
More informationApplication 1 - People Allocation in Line Balancing
Chapter 9 Workforce Planning Introduction to Lecture This chapter presents some applications of Operations Research models in workforce planning. Work force planning would be more of a generic application
More information2. Linear Programming Problem
. Linear Programming Problem. Introduction to Linear Programming Problem (LPP). When to apply LPP or Requirement for a LPP.3 General form of LPP. Assumptions in LPP. Applications of Linear Programming.6
More informationCHAPTER 11 Integer Programming, Goal Programming, and Nonlinear Programming
Integer Programming, Goal Programming, and Nonlinear Programming CHAPTER 11 253 CHAPTER 11 Integer Programming, Goal Programming, and Nonlinear Programming TRUE/FALSE 11.1 If conditions require that all
More informationDeterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions
Deterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions 11. Consider the following linear program. Maximize z = 6x 1 + 3x 2 subject to x 1 + 2x 2 2x 1 + x 2 20 x 1 x 2 x
More informationFURTHER MATHEMATICS Units 3 & 4 - Written Examination 2
THIS BOX IS FOR ILLUSTRATIVE PURPOSES ONLY 2016 Examination Package - Trial Examination 4 of 5 Figures STUDENT NUMBER Letter Words FURTHER MATHEMATICS Units 3 & 4 - Written Examination 2 (TSSM s 2014 trial
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Stud Guide for Test II Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Graph the linear inequalit. 1) 3 + -6 1) - - - - A) B) - - - - - - - -
More informationInteger Programming and Branch and Bound
Courtesy of Sommer Gentry. Used with permission. Integer Programming and Branch and Bound Sommer Gentry November 4 th, 003 Adapted from slides by Eric Feron and Brian Williams, 6.40, 00. Integer Programming
More informationGraphical and Computer Methods
Chapter 7 Linear Programming Models: Graphical and Computer Methods Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna 2008 Prentice-Hall, Inc. Introduction Many management
More informationModeling with Integer Programming
Modeling with Integer Programg Laura Galli December 18, 2014 We can use 0-1 (binary) variables for a variety of purposes, such as: Modeling yes/no decisions Enforcing disjunctions Enforcing logical conditions
More informationThe Traveling Salesman Problem: An Overview. David P. Williamson, Cornell University Ebay Research January 21, 2014
The Traveling Salesman Problem: An Overview David P. Williamson, Cornell University Ebay Research January 21, 2014 (Cook 2012) A highly readable introduction Some terminology (imprecise) Problem Traditional
More informationReview Questions, Final Exam
Review Questions, Final Exam A few general questions 1. What does the Representation Theorem say (in linear programming)? 2. What is the Fundamental Theorem of Linear Programming? 3. What is the main idea
More informationModelling linear and linear integer optimization problems An introduction
Modelling linear and linear integer optimization problems An introduction Karen Aardal October 5, 2015 In optimization, developing and analyzing models are key activities. Designing a model is a skill
More informationThe questions listed below are drawn from midterm and final exams from the last few years at OSU. As the text book and structure of the class have
The questions listed below are drawn from midterm and final eams from the last few years at OSU. As the tet book and structure of the class have recently changed, it made more sense to list the questions
More informationMATH 112 Final Exam Study Questions
MATH Final Eam Study Questions Spring 08 Note: Certain eam questions have been more challenging for students. Questions marked (***) are similar to those challenging eam questions.. A company produces
More informationTransportation Problem
Transportation Problem. Production costs at factories F, F, F and F 4 are Rs.,, and respectively. The production capacities are 0, 70, 40 and 0 units respectively. Four stores S, S, S and S 4 have requirements
More informationIE 5112 Final Exam 2010
IE 5112 Final Exam 2010 1. There are six cities in Kilroy County. The county must decide where to build fire stations. The county wants to build as few fire stations as possible while ensuring that there
More informationLogic-based Benders Decomposition
Logic-based Benders Decomposition A short Introduction Martin Riedler AC Retreat Contents 1 Introduction 2 Motivation 3 Further Notes MR Logic-based Benders Decomposition June 29 July 1 2 / 15 Basic idea
More informationThe Review has 16 questions. Simplify all answers, include all units when appropriate.
Math 1 Midterm Eam Review with Answers Name Date The Review has 16 questions. Simplify all answers, include all units when appropriate. 1. [Sec. 1.] Solve the following problems. a. A company s profit
More informationI. ORDER OF OPERATIONS
ALGEBRA II HONORS REVIEW PACKET NAME This packet contains all of the material that you should have mastered in Algebra I. You are responsible for reviewing this material over the summer and expect an assessment
More informationArithmetic and Geometric Sequences and their Summation
4 Arithmetic and Geometric Sequences and their Summation O-FOUDATIO 4F 4.4 Series 4.5 Arithmetic Series ame : Date : Mark : Key Concepts and Formulae Sum of the first n terms of an arithmetic series: na
More informationAgenda today. Introduction to prescriptive modeling. Linear optimization models through three examples: Beyond linear optimization
Agenda today Introduction to prescriptive modeling Linear optimization models through three examples: 1 Production and inventory optimization 2 Distribution system design 3 Stochastic optimization Beyond
More informationOfek Quantitative Test 1
016 Ofek Quantitative Test 1 For more FREE prep materials visit ofekgmat.com B 5 C A 9 D 1. Point D is between points A and E (not shown). The area of triangle ABE is equal to the area of trapezoid ABCD.
More informationComputational Integer Programming. Lecture 2: Modeling and Formulation. Dr. Ted Ralphs
Computational Integer Programming Lecture 2: Modeling and Formulation Dr. Ted Ralphs Computational MILP Lecture 2 1 Reading for This Lecture N&W Sections I.1.1-I.1.6 Wolsey Chapter 1 CCZ Chapter 2 Computational
More informationLinear Functions, Equations, and Inequalities
CHAPTER Linear Functions, Equations, and Inequalities Inventory is the list of items that businesses stock in stores and warehouses to supply customers. Businesses in the United States keep about.5 trillion
More information2. Which of the following expressions represents the product of four less than three times x and two more than x?
Algebra Topics COMPASS Review You will be allowed to use a calculator on the COMPASS test. Acceptable calculators are: basic calculators, scientific calculators, and graphing calculators up through the
More informationAsymmetric Traveling Salesman Problem (ATSP): Models
Asymmetric Traveling Salesman Problem (ATSP): Models Given a DIRECTED GRAPH G = (V,A) with V = {,, n} verte set A = {(i, j) : i V, j V} arc set (complete digraph) c ij = cost associated with arc (i, j)
More informationCalculation exercise 1 MRP, JIT, TOC and SOP. Dr Jussi Heikkilä
Calculation exercise 1 MRP, JIT, TOC and SOP Dr Jussi Heikkilä Problem 1: MRP in XYZ Company fixed lot size Item A Period 1 2 3 4 5 6 7 8 9 10 Gross requirements 71 46 49 55 52 47 51 48 56 51 Scheduled
More informationSection #2: Linear and Integer Programming
Section #2: Linear and Integer Programming Prof. Dr. Sven Seuken 8.3.2012 (with most slides borrowed from David Parkes) Housekeeping Game Theory homework submitted? HW-00 and HW-01 returned Feedback on
More informationMath 20 Final Review. Factor completely. a x bx a y by. 2x 162. from. 10) Factor out
Math 0 Final Review Factor completely ) 6 ) 6 0 ) a b a y by ) n n ) 0 y 6) y 6 7) 6 8 y 6 yz 8) 9y 0y 9) ( ) ( ) 0) Factor out from 6 0 ) Given P ( ) 6 a) Using the Factor Theorem determine if is a factor
More informationIS703: Decision Support and Optimization. Week 5: Mathematical Programming. Lau Hoong Chuin School of Information Systems
IS703: Decision Support and Optimization Week 5: Mathematical Programming Lau Hoong Chuin School of Information Systems 1 Mathematical Programming - Scope Linear Programming Integer Programming Network
More informationMath 112 Fall 2015 Midterm 2 Review Problems Page 1. has a maximum or minimum and then determine the maximum or minimum value.
Math Fall 05 Midterm Review Problems Page f 84 00 has a maimum or minimum and then determine the maimum or minimum value.. Determine whether Ma = 00 Min = 00 Min = 8 Ma = 5 (E) Ma = 84. Consider the function
More informationMidterm: Wednesday, January 23 rd at 8AM Midterm Review
Name: Algebra 1 CC Period: Midterm: Wednesday, January 23 rd at 8AM Midterm Review Unit 1: Building Blocks of Algebra Number Properties (Distributive, Commutative, Associative, Additive, Multiplicative)
More informationEquations and Inequalities
Equations and Inequalities Figure 1 CHAPTER OUTLINE 1 The Rectangular Coordinate Systems and Graphs Linear Equations in One Variable Models and Applications Comple Numbers Quadratic Equations 6 Other Types
More informationLinear Functions. Unit 3
Linear Functions Unit 3 Standards: 8.F.1 Understand that a function is a rule that assigns to each input exactly one output. The graph of a function is the set of ordered pairs consisting of an input and
More information5 Integer Linear Programming (ILP) E. Amaldi Foundations of Operations Research Politecnico di Milano 1
5 Integer Linear Programming (ILP) E. Amaldi Foundations of Operations Research Politecnico di Milano 1 Definition: An Integer Linear Programming problem is an optimization problem of the form (ILP) min
More informationModern Logistics & Supply Chain Management
Modern Logistics & Supply Chain Management As gold which he cannot spend will make no man rich, so knowledge which he cannot apply will make no man wise. Samuel Johnson: The Idler No. 84 Production Mix
More informationΣ w j. Σ v i KNAPSACK. for i = 1, 2,..., n. and an positive integers K and W. Does there exist a subset S of {1, 2,..., n} such that: and w i
KNAPSACK Given positive integers v i and w i for i = 1, 2,..., n. and an positive integers K and W. Does there exist a subset S of {1, 2,..., n} such that: Σ w j W i S and Σ v i K i S A special case: SUBSET
More informationLinear Programming. H. R. Alvarez A., Ph. D. 1
Linear Programming H. R. Alvarez A., Ph. D. 1 Introduction It is a mathematical technique that allows the selection of the best course of action defining a program of feasible actions. The objective of
More informationMath Applications 544
Math Applications The applications that follow are like the ones you will encounter in many workplaces. Use the mathematics you have learned in this chapter to solve the problems. Wherever possible, use
More informationDiscussion 03 Solutions
STAT Discussion Solutions Spring 8. A new flavor of toothpaste has been developed. It was tested by a group of people. Nine of the group said they liked the new flavor, and the remaining indicated they
More informationReady for TAKS? Benchmark Tests Benchmark Pre-Test (7.1)(A)
Benchmark Pre-Test (7.)(A). Which is between and 5? A C 5 B D. Which statement is true? F G H 5. Which list of numbers is in order from greatest to least? A, 7,, B,,, 7 C,, 7, D 6, 5,, 6. Barney used the
More informationCS Analysis of Recursive Algorithms and Brute Force
CS483-05 Analysis of Recursive Algorithms and Brute Force Instructor: Fei Li Room 443 ST II Office hours: Tue. & Thur. 4:30pm - 5:30pm or by appointments lifei@cs.gmu.edu with subject: CS483 http://www.cs.gmu.edu/
More informationChapter 5: Systems of Equations
Chapter : Sstems of Equations Section.: Sstems in Two Variables... 0 Section. Eercises... 9 Section.: Sstems in Three Variables... Section. Eercises... Section.: Linear Inequalities... Section.: Eercises.
More informationMATH 135 Sample Review for the Final Exam
MATH 5 Sample Review for the Final Eam This review is a collection of sample questions used by instructors of this course at Missouri State University. It contains a sampling of problems representing the
More informationLesson 5.1 Solving Systems of Equations
Lesson 5.1 Solving Sstems of Equations 1. Verif whether or not the given ordered pair is a solution to the sstem. If it is not a solution, eplain wh not. a. (, 3) b. (, 0) c. (5, 3) 0.5 1 0.5 2 0.75 0.75
More informationIn this section we want to apply what we have learned about functions to real world problems, a.k.a. word problems.
9.7 Applications of Functions In this section we want to apply what we have learned about functions to real world problems, a.k.a. word problems. There are two primary types of application problems we
More informationLooking Ahead to Chapter 4
Looking Ahead to Chapter Focus In Chapter, you will learn about functions and function notation, and you will find the domain and range of a function. You will also learn about real numbers and their properties,
More informationMath Want to have fun with chapter 4? Find the derivative. 1) y = 5x2e3x. 2) y = 2xex - 2ex. 3) y = (x2-2x + 3) ex. 9ex 4) y = 2ex + 1
Math 160 - Want to have fun with chapter 4? Name Find the derivative. 1) y = 52e3 2) y = 2e - 2e 3) y = (2-2 + 3) e 9e 4) y = 2e + 1 5) y = e - + 1 e e 6) y = 32 + 7 7) y = e3-1 5 Use calculus to find
More informationMath Summer Packet Grade 7
2018-2019 Math Summer Packet Grade 7 Name: 6 th Grade Math Teacher: 7 th Grade Math Teacher: Part 1: Multiple Choice Directions: Answer every question. (1) Which integer makes this statement true? 8 +?
More informationPractice Questions for Math 131 Exam # 1
Practice Questions for Math 131 Exam # 1 1) A company produces a product for which the variable cost per unit is $3.50 and fixed cost 1) is $20,000 per year. Next year, the company wants the total cost
More informationST. JOSEPH S COLLEGE OF ARTS & SCIENCE (AUTONOMOUS) CUDDALORE-1
ST. JOSEPH S COLLEGE OF ARTS & SCIENCE (AUTONOMOUS) CUDDALORE-1 SUB:OPERATION RESEARCH CLASS: III B.SC SUB CODE:EMT617S SUB INCHARGE:S.JOHNSON SAVARIMUTHU 2 MARKS QUESTIONS 1. Write the general model of
More informationIntroduction to Operations Research
Introduction to Operations Research Linear Programming Solving Optimization Problems Linear Problems Non-Linear Problems Combinatorial Problems Linear Problems Special form of mathematical programming
More informationIntroduction to Mathematical Programming IE406. Lecture 21. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 21 Dr. Ted Ralphs IE406 Lecture 21 1 Reading for This Lecture Bertsimas Sections 10.2, 10.3, 11.1, 11.2 IE406 Lecture 21 2 Branch and Bound Branch
More informationName. Unit 1 Worksheets Math 150 College Algebra and Trig
Name Unit 1 Worksheets Math 10 College Algebra and Trig Revised: Fall 009 Worksheet 1: Integral Eponents Simplify each epression. Write all answers in eponential form. 1. (8 ). ( y). (a b ). y 6. (7 8
More informationAlgorithms and Complexity theory
Algorithms and Complexity theory Thibaut Barthelemy Some slides kindly provided by Fabien Tricoire University of Vienna WS 2014 Outline 1 Algorithms Overview How to write an algorithm 2 Complexity theory
More informationMaterials for assessing adult numeracy
Materials for assessing adult numeracy Number Task Write this number in figures. Two hundred and seventy two thousand four hundred and twenty nine. In which of these numbers is the 7 worth seventy? Write
More informationInteger Programming Introduction. C, T int (3) 6C +7T 21 (1) Maximize : 12C +13T Subject to
Integer Programming Introduction Divisibility assumption of LP allows for fractions: Produce 7.8 units of a product, buy 12500.33 liters of oil, hire 12.123 people for full time. Clearly some activities
More informationSystems Optimization and Analysis Optimization Project. Labor Planning for a Manufacturing Line
15.066 Systems Optimization and Analysis Optimization Project Labor Planning for a Manufacturing Line Team 1 The Tek Team Lane Ballard Christine Cheung Justin Ging Omur Kaya David Jackson Alyson Naughton
More informationSolving Equations and Inequalities
Solving Equations and Inequalities Secondary Mathematics 3 Page Jordan School District Unit 4 Cluster (A.CED., A.SSE., and A.CED.4): Writing and Solving Equations and Inequalities in One Variable Cluster
More informationAlgebra II Honors. Midterm Review
Algebra II Honors Midterm Review Simplify the following epressions. 1. 5 { [ ( )]}. ( y) y( y) Solve in the given domain.. ( 5)( 9) 0 {positive reals}. 1 10 {positive reals} 5. 16 {integers} 5a. 6 1 {reals}
More informationDecision Mathematics D1
Pearson Edexcel International Advanced Level Decision Mathematics D1 Advanced/Advanced Subsidiary Thursday 19 January 2017 Afternoon Time: 1 hour 30 minutes Paper Reference WDM01/01 You must have: D1 Answer
More informationIntroduction to Systems of Equations
Systems of Equations 1 Introduction to Systems of Equations Remember, we are finding a point of intersection x 2y 5 2x y 4 1. A golfer scored only 4 s and 5 s in a round of 18 holes. His score was 80.
More informationOptimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur. Lecture - 20 Travelling Salesman Problem
Optimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur Lecture - 20 Travelling Salesman Problem Today we are going to discuss the travelling salesman problem.
More informationAlgebra II. Note workbook. Chapter 2. Name
Algebra II Note workbook Chapter 2 Name Algebra II: 2-1 Relations and Functions The table shows the average lifetime and maximum lifetime for some animals. This data can be written as. The ordered pairs
More informationDM559/DM545 Linear and integer programming
Department of Mathematics and Computer Science University of Southern Denmark, Odense March 26, 2018 Marco Chiarandini DM559/DM545 Linear and integer programming Sheet 1, Spring 2018 [pdf format] This
More informationC.6 Normal Distributions
C.6 Normal Distributions APPENDIX C.6 Normal Distributions A43 Find probabilities for continuous random variables. Find probabilities using the normal distribution. Find probabilities using the standard
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture 11: Integer Programming Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/ School of Mathematical
More informationQ3 Algebra Review Pre-calculus Name. Solve using sign patterning. Write your answer in algebraic form.
Q3 Algebra Review Pre-calculus Name If the sum of the roots of a quadratic equation is b a and the product of the roots is a c. Find a quadratic equation (with integral coefficients) with the following
More informationQUADRATIC FUNCTIONS. ( x 7)(5x 6) = 2. Exercises: 1 3x 5 Sum: 8. We ll expand it by using the distributive property; 9. Let s use the FOIL method;
QUADRATIC FUNCTIONS A. Eercises: 1.. 3. + = + = + + = +. ( 1)(3 5) (3 5) 1(3 5) 6 10 3 5 6 13 5 = = + = +. ( 7)(5 6) (5 6) 7(5 6) 5 6 35 4 5 41 4 3 5 6 10 1 3 5 Sum: 6 + 10+ 3 5 ( + 1)(3 5) = 6 + 13 5
More informationMath 1 Variable Manipulation Part 4 Word Problems
Math 1 Variable Manipulation Part 4 Word Problems 1 TRANSLATING FROM ENGLISH INTO ALGEBRA (PLUG IN) The next part of variable manipulation problems is to figure out the problem from real life situations.
More informationMATH FOR LIBERAL ARTS FINAL REVIEW
MATH FOR LIBERAL ARTS FINAL REVIEW Find the value of the annuity. Round to the nearest cent. A = P 1 + r n r n nt - 1 P = A r n 1 + r n nt - 1 1) Periodic Deposit: $100 at the end of each year Rate: 5%
More informationBachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.)
AOR-01 ASSIGNMENT BOOKLET Bachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.) It is compulsory to submit the assignment before filling in the exam form.
More informationIntroduction to Bin Packing Problems
Introduction to Bin Packing Problems Fabio Furini March 13, 2015 Outline Origins and applications Applications: Definition: Bin Packing Problem (BPP) Solution techniques for the BPP Heuristic Algorithms
More information3. If a forecast is too high when compared to an actual outcome, will that forecast error be positive or negative?
1. Does a moving average forecast become more or less responsive to changes in a data series when more data points are included in the average? 2. Does an exponential smoothing forecast become more or
More informationChapter Four. Chapter Four
Chapter Four Chapter Four CHAPTER FOUR 99 ConcepTests for Section 4.1 1. Concerning the graph of the function in Figure 4.1, which of the following statements is true? (a) The derivative is zero at two
More informationIntroduction to Operations Research. Linear Programming
Introduction to Operations Research Linear Programming Solving Optimization Problems Linear Problems Non-Linear Problems Combinatorial Problems Linear Problems Special form of mathematical programming
More informationMS-E2140. Lecture 1. (course book chapters )
Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters 1.1-1.4) Linear programming problems and examples Problem manipulations and standard form Graphical representation
More informationFunctions. Introduction CHAPTER OUTLINE
Functions,00 P,000 00 0 970 97 980 98 990 99 000 00 00 Figure Standard and Poor s Inde with dividends reinvested (credit "bull": modification of work b Praitno Hadinata; credit "graph": modification of
More informationSHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.
Math 132 Eam 2 Review (.1 -.5, 7.1-7.5) SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Determine whether the given ordered set of numbers is a solution
More informationMini-Lecture 6.1 Rational Functions and Multiplying and Dividing Rational Expressions
Learning Objectives: Mini-Lecture 6. Rational Functions and Multiplying and Dividing Rational Epressions. Find the domain of a rational function.. Simplify rational epressions.. Multiply rational epressions.
More informationx 2 + x + x 2 x 3 b. x 7 Factor the GCF from each expression Not all may be possible. 1. Find two numbers that sum to 8 and have a product of 12
Factor the GCF from each expression 4 5 1. 15x 3x. 16x 4 Name: a. b. 4 7 3 6 5 3. 18x y 36x y 4x y 5 4. 3x x 3 x 3 c. d. Not all may be possible. 1. Find two numbers that sum to 8 and have a product of
More information6. Graph each of the following functions. What do you notice? What happens when x = 2 on the graph of b?
Pre Calculus Worksheet 1. Da 1 1. The relation described b the set of points {(-,5,0,5,,8,,9 ) ( ) ( ) ( )} is NOT a function. Eplain wh. For questions - 4, use the graph at the right.. Eplain wh the graph
More informationEquations and Inequalities in One Variable
Name Date lass Equations and Inequalities in One Variable. Which of the following is ( r ) 5 + + s evaluated for r = 8 and s =? A 3 B 50 58. Solve 3x 9= for x. A B 7 3. What is the best first step for
More information