Introduction to Management Science (8th Edition, Bernard W. Taylor III) Chapter 9 Integer Programming. Chapter 9 - Integer Programming 1
|
|
- Emmeline Phelps
- 6 years ago
- Views:
Transcription
1 Introduction to Management Science (8th Edition, Bernard W. Taylor III) Chapter 9 Integer Programming Chapter 9 - Integer Programming 1
2 Chapter Topics Integer Programming (IP) Models Still linear programming models Variables must be integers, and so form a subset of the original, real-number models Integer Programming Graphical Solution Computer Solution of Integer Programming Problems With Excel and QM for Windows Chapter 9 - Integer Programming 2
3 Integer Programming Models Types of Models Total Integer Model: All decision variables required to have integer solution values. 0 1 Integer Model: All decision variables required to have integer values of zero or one. Also referred to as Boolean and True/False Mixed Integer Model: Some of the decision variables (but not all) required to have integer values. Chapter 9 - Integer Programming 3
4 A Total Integer Model (1 of 2) Machine shop obtaining new presses and lathes. Marginal profitability: each press $100/day; each lathe $150/day. Resource constraints: $40,000, 200 sq. ft. floor space. Machine purchase prices and space requirements: Machine Press Lathe Required Floor Space (sq. ft.) Purchase Price $8,000 4,000 Chapter 9 - Integer Programming 4
5 A Total Integer Model (2 of 2) Integer Programming Model: Maximize Z = $100x 1 + $150x 2 subject to: 8,000x 1 + 4,000x 2 $40,000 15x x ft 2 x 1, x 2 0 and integer x 1 = number of presses x 2 = number of lathes Chapter 9 - Integer Programming 5
6 A 0 1 Integer Model (1 of 2) Recreation facilities selection to maximize daily usage by residents. Resource constraints: $120,000 budget; 12 acres of land. Selection constraint: either swimming pool or tennis center (not both). Data: Recreation Facility Expected Usage (people/day) Cost ($) Land Requirement (acres) Swimming pool Tennis Center Athletic field Gymnasium ,000 10,000 25,000 90, Chapter 9 - Integer Programming 6
7 A 0 1 Integer Model (2 of 2) Integer Programming Model: Maximize Z = 300x x x x 4 subject to: $35,000x ,000x ,000x ,000x 4 $120,000 4x 1 + 2x 2 + 7x 3 + 3x 4 12 acres x 1 + x 2 1 facility x 1, x 2, x 3, x 4 = 0 or 1 (either do or don t) x 1 = construction of a swimming pool x 2 = construction of a tennis center x 3 = construction of an athletic field x 4 = construction of a gymnasium Chapter 9 - Integer Programming 7
8 A Mixed Integer Model (1 of 2) $250,000 available for investments providing greatest return after one year. Data: Condominium cost $50,000/unit, $9,000 profit if sold after one year. Land cost $12,000/ acre, $1,500 profit if sold after one year. Municipal bond cost $8,000/bond, $1,000 profit if sold after one year. Only 4 condominiums, 15 acres of land, and 20 municipal bonds available. Chapter 9 - Integer Programming 8
9 A Mixed Integer Model (2 of 2) Integer Programming Model: Maximize Z = $9,000x 1 + 1,500x 2 + 1,000x 3 subject to: 50,000x ,000x 2 + 8,000x 3 $250,000 x 1 4 condominiums x 2 15 acres x 3 20 bonds x 2 0 x 1, x 3 0 and integer x 1 = condominiums purchased x 2 = acres of land purchased x 3 = bonds purchased Chapter 9 - Integer Programming 9
10 Integer Programming Graphical Solution Rounding non-integer solution values up (down) to the nearest integer value can result in an infeasible solution A feasible solution may be found by rounding down (up) non-integer solution values, but may result in a less than optimal (sub-optimal) solution. Whether a variable is to be rounded up or down depends on where the corresponding point is with respect to the constraint boundaries. Chapter 9 - Integer Programming 10
11 Integer Programming Example Graphical Solution of Maximization Model Maximize Z = $100x 1 + $150x 2 subject to: 8,000x 1 + 4,000x 2 $40,000 15x x ft 2 x 1, x 2 0 and integer Optimal Solution: Z = $1, x 1 = 2.22 presses x 2 = 5.55 lathes Both of these may be found by judicious rounding, but the value of the objective function needs to be checked for each. Figure 9.1 Feasible Solution Space with Integer Solution Points Chapter 9 - Integer Programming 11
12 Branch and Bound Method Traditional approach to solving integer programming problems. Based on principle that total set of feasible solutions can be partitioned into smaller subsets of solutions. Smaller subsets evaluated until best solution is found. Method is a tedious and complex mathematical process. Excel and QM for Windows used in this book. See CD-ROM Module C Integer Programming: the Branch and Bound Method for detailed description of method. Chapter 9 - Integer Programming 12
13 Computer Solution of IP Problems 0 1 Model with Excel (1 of 5) Recreational Facilities Example: Maximize Z = 300x x x x 4 subject to: $35,000x ,000x ,000x ,000x 4 $120,000 4x 1 + 2x 2 + 7x 3 + 3x 4 12 acres x 1 + x 2 1 facility x 1, x 2, x 3, x 4 = 0 or 1 Chapter 9 - Integer Programming 13
14 Computer Solution of IP Problems 0 1 Model with Excel (2 of 5) Exhibit 9.2 Chapter 9 - Integer Programming 14
15 Computer Solution of IP Problems 0 1 Model with Excel (3 of 5) Exhibit 9.3 Instead, one could just specify $C$12:$C$15 as binary (= 0 or 1 ). Chapter 9 - Integer Programming 15
16 Computer Solution of IP Problems 0 1 Model with Excel (4 of 5) To constrain a range of variables to be integers, enter: Exhibit 9.4 and note that it doesn t matter what you put in the right-hand side field, but it must not be empty. Instead, one could just specify the bin option (= 0 or 1 ), thus avoiding the additional, 0 and 1 constraints. Chapter 9 - Integer Programming 16
17 Computer Solution of IP Problems 0 1 Model with Excel (5 of 5) Exhibit 9.5 Chapter 9 - Integer Programming 17
18 Computer Solution of IP Problems 0 1 Model with QM for Windows (1 of 3) Recreational Facilities Example: Maximize Z = 300x x x x 4 subject to: $35,000x ,000x ,000x ,000x 4 $120,000 4x 1 + 2x 2 + 7x 3 + 3x 4 12 acres x 1 + x 2 1 facility x 1, x 2, x 3, x 4 = 0 or 1 Chapter 9 - Integer Programming 18
19 Computer Solution of IP Problems 0 1 Model with QM for Windows (2 of 3) Exhibit 9.6 Chapter 9 - Integer Programming 19
20 Computer Solution of IP Problems 0 1 Model with QM for Windows (3 of 3) Exhibit 9.7 Chapter 9 - Integer Programming 20
21 Computer Solution of IP Problems Total Integer Model with Excel (1 of 5) Integer Programming Model: Maximize Z = $100x 1 + $150x 2 subject to: 8,000x 1 + 4,000x 2 $40,000 15x x ft 2 x 1, x 2 0 and integer Chapter 9 - Integer Programming 21
22 Computer Solution of IP Problems Total Integer Model with Excel (2 of 5) Exhibit 9.8 Chapter 9 - Integer Programming 22
23 Computer Solution of IP Problems Total Integer Model with Excel (3 of 5) Exhibit 9.9 and, again, just to note that this field will automatically fill, but Excel wants you to put something in it anyway. Chapter 9 - Integer Programming 23
24 Computer Solution of IP Problems Total Integer Model with Excel (4 of 5) Exhibit 9.10 Chapter 9 - Integer Programming 24
25 Computer Solution of IP Problems Total Integer Model with Excel (5 of 5) Exhibit 9.11 Chapter 9 - Integer Programming 25
26 Computer Solution of IP Problems Mixed Integer Model with Excel (1 of 3) Integer Programming Model: Maximize Z = $9,000x 1 + 1,500x 2 + 1,000x 3 subject to: 50,000x ,000x 2 + 8,000x 3 $250,000 x 1 4 condominiums x 2 15 acres x 3 20 bonds x 2 0 x 1, x 3 0 and integer Chapter 9 - Integer Programming 26
27 Computer Solution of IP Problems Total Integer Model with Excel (2 of 3) Exhibit 9.12 Chapter 9 - Integer Programming 27
28 Computer Solution of IP Problems Solution of Total Integer Model with Excel (3 of 3) Exhibit 9.13 Chapter 9 - Integer Programming 28
29 Computer Solution of IP Problems Mixed Integer Model with QM for Windows (1 of 2) Exhibit 9.14 Chapter 9 - Integer Programming 29
30 Computer Solution of IP Problems Mixed Integer Model with QM for Windows (2 of 2) Exhibit 9.15 Chapter 9 - Integer Programming 30
31 0 1 Integer Programming Modeling Examples Capital Budgeting Example (1 of 4) University bookstore expansion project. Not enough space available for both a computer department and a clothing department. Data: Project NPV Return ($1000) Project Costs per Year ($1000) Website Warehouse Clothing department Computer department ATMs Available funds per year Chapter 9 - Integer Programming 31
32 0 1 Integer Programming Modeling Examples Capital Budgeting Example (2 of 4) x 1 = selection of web site project x 2 = selection of warehouse project x 3 = selection clothing department project x 4 = selection of computer department project x 5 = selection of ATM project x i = 1 if project i is selected, 0 if project i is not selected Maximize Z = $120x 1 + $85x 2 + $105x 3 + $140x 4 + $70x 5 subject to: 55x x x x x x x x x x x x x 4 60 x 3 + x 4 1 x i = 0 or 1 Chapter 9 - Integer Programming 32
33 0 1 Integer Programming Modeling Examples Capital Budgeting Example (3 of 4) Exhibit 9.16 Chapter 9 - Integer Programming 33
34 0 1 Integer Programming Modeling Examples Capital Budgeting Example (4 of 4) Could have chosen bin (= 0 or 1 ) instead! Exhibit 9.17 Chapter 9 - Integer Programming 34
35 0 1 Integer Programming Modeling Examples Fixed Charge and Facility Example (1 of 4) Which of the six farms should be purchased that will meet current production capacity at minimum total cost, including annual fixed costs and shipping costs? Data: Farms Annual Fixed Costs ($1000) Projected Annual Harvest (tons, 1000s) Plant A B C Available Capacity (tons,1000s) Plant 12.8 Farm A B C Chapter 9 - Integer Programming
36 0 1 Integer Programming Modeling Examples Fixed Charge and Facility Example (2 of 4) y i = 0 if farm i is not selected, and 1 if farm i is selected, i = 1,2,3,4,5,6 x ij = potatoes (tons, 1000s) shipped from farm i, i = 1,2,3,4,5,6 to plant j, j = A,B,C. Minimize Z = 18x 1A + 15x 1B + 12x 1C + 13x 2A + 10x 2B + 17x 2C + 16x 3A + 14x 3B + 18x 3C + 19x 4A + 15x 4B + 16x 4C + 17x 5A + 19x 5B + 12x 5C + 14x 6A + 16x 6B + 12x 6C + 405y y y y y y 6 subject to: x 1A + x 1B + x 1C y 1 0 x 2A + x 2B + x 2C -10.5y 2 0 x 3A + x 3B + x 3C y 3 0 x 4A + x 4B + x 4C - 9.3y 4 0 x 5A + x 5B + x 5B y 5 0 x 6A + x 6B + X 6C - 9.6y 6 0 x 1A + x 2A + x 3A + x 4A + x 5A + x 6A =12 x 1B + x 2B + x 3A + x 4B + x 5B + x 6B = 10 x 1C + x 2C + x 3C + x 4C + x 5C + x 6C = 14 The 3 plants capacities. x ij 0 y i = 0 or 1 The 6 farms capacities. Chapter 9 - Integer Programming 36
37 0 1 Integer Programming Modeling Examples Fixed Charge and Facility Example (3 of 4) Exhibit 9.18 Chapter 9 - Integer Programming 37
38 0 1 Integer Programming Modeling Examples Fixed Charge and Facility Example (4 of 4) Exhibit 9.19 Chapter 9 - Integer Programming 38
39 0 1 Integer Programming Modeling Examples Set Covering Example (1 of 4) APS wants to construct the minimum set of new hubs in the following twelve cities such that there is a hub within 300 miles of every city: Cities Cities within 300 miles 1. Atlanta Atlanta, Charlotte, Nashville 2. Boston Boston, New York 3. Charlotte Atlanta, Charlotte, Richmond 4. Cincinnati Cincinnati, Detroit, Nashville, Pittsburgh 5. Detroit Cincinnati, Detroit, Indianapolis, Milwaukee, Pittsburgh 6. Indianapolis Cincinnati, Detroit, Indianapolis, Milwaukee, Nashville, St. Louis 7. Milwaukee Detroit, Indianapolis, Milwaukee 8. Nashville Atlanta, Cincinnati, Indianapolis, Nashville, St. Louis 9. New York Boston, New York, Richmond 10. Pittsburgh Cincinnati, Detroit, Pittsburgh, Richmond 11. Richmond Charlotte, New York, Pittsburgh, Richmond 12. St. Louis Indianapolis, Nashville, St. Louis Chapter 9 - Integer Programming 39
40 0 1 Integer Programming Modeling Examples Set Covering Example (2 of 4) x i = city i, i = 1 to 12, x i = 0 if city is not selected as a hub and x i = 1if it is. Minimize Z = x 1 + x 2 + x 3 + x 4 + x 5 + x 6 + x 7 + x 8 + x 9 + x 10 + x 11 + x 12 subject to: Atlanta: x 1 + x 3 + x 8 1 Boston: x 2 + x 10 1 Charlotte: x 1 + x 3 + x 11 1 Cincinnati: x 4 + x 5 + x 8 + x 10 1 Detroit: x 4 + x 5 + x 6 + x 7 + x 10 1 Indianapolis: x 4 + x 5 + x 6 + x 7 + x 8 + x 12 1 Milwaukee: x 5 + x 6 + x 7 1 Nashville: x 1 + x 4 + x 6 + x 8 + x 12 1 New York: x 2 + x 9 + x 11 1 Pittsburgh: x 4 + x 5 + x 10 + x 11 1 Richmond: x 3 + x 9 + x 10 + x 11 1 St Louis: x 6 + x 8 + x 12 1 x ij = 0 or 1 Chapter 9 - Integer Programming 40
41 0 1 Integer Programming Modeling Examples Set Covering Example (3 of 4) Exhibit 9.20 the decision variables Chapter 9 - Integer Programming 41
42 0 1 Integer Programming Modeling Examples Set Covering Example (4 of 4) Exhibit 9.21 For N7, enter = sumproduct(b7:m7,b$20:m$20) and the down; the last constraint requires that these (hubs within 300 mi) equal at least one. Chapter 9 - Integer Programming 42
43 Total Integer Programming Modeling Example Problem Statement (1 of 3) Textbook company developing two new regions. Planning to transfer some of its 10 salespeople into new regions. Average annual expenses for sales person: Region 1 - $10,000/salesperson Region 2 - $7,500/salesperson Total annual expense budget is $72,000. Sales generated each year: Region 1 - $85,000/salesperson Region 2 - $60,000/salesperson How many salespeople should be transferred into each region in order to maximize increased sales? Chapter 9 - Integer Programming 43
44 Total Integer Programming Modeling Example Model Formulation (2 of 3) Step 1: Formulate the Integer Programming Model Step 2: Maximize Z = $85,000x ,000x 2 subject to: x 1 + x 2 10 salespeople $10,000x 1 + 7,000x 2 $72,000 expense budget x 1, x 2 0 or integer Solve the Model using QM for Windows Chapter 9 - Integer Programming 44
45 Total Integer Programming Modeling Example Solution with QM for Windows (3 of 3) Chapter 9 - Integer Programming 45
46 Chapter 9 - Integer Programming 46
Introduction. Chapter 15. Optimization Modeling: Applications. Integer Programming. Manufacturing Example. Three Types of ILP Models
Chapter 5 Optimization Modeling: Applications Integer Programming Introduction When one or more variables in an LP problem must assume an integer value we have an Integer Linear Programming (ILP) problem.
More informationIntroduction to Management Science (8th Edition, Bernard W. Taylor III) Chapter 12 Network Flow Models. Chapter 12 - Network Flow Models 1
Introduction to Management Science (8th Edition, Bernard W. Taylor III) Chapter 12 Network Flow Models Chapter 12 - Network Flow Models 1 Chapter Topics The Shortest Route Problem The Minimal Spanning
More informationNetwork Flow Models. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall
Network Flow Models Chapter 7 7-1 Chapter Topics The Shortest Route Problem The Minimal Spanning Tree Problem The Maximal Flow Problem 7-2 Network Components A network is an arrangement of paths (branches)
More informationPrepared By. Handaru Jati, Ph.D. Universitas Negeri Yogyakarta.
Prepared By Handaru Jati, Ph.D Universitas Negeri Yogyakarta handaru@uny.ac.id Chapter 8 Using The Excel Solver To Solve Mathematical Programs Chapter Overview 8.1 Introduction 8.2 Formulating Mathematical
More informationThe Islamic University of Gaza Faculty of Commerce Quantitative Analysis - Dr. Samir Safi Midterm #2-28/4/2014
The Islamic University of Gaza Faculty of Commerce Quantitative Analysis - Dr. Samir Safi Midterm #2-28/4/2014 Name TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. 1)
More informationVantage 70 Frederick s Most Visible Location
Vantage 70 Frederick s Most Visible Location The Vantage70 Advantage Located at the intersection of Interstates 70 and 270 just minutes from Frederick, MD s historic downtown, Vantage70 is the most visible
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 5.05 Introduction to Optimization (Spring 005) Problem Set 8, Due April 4, 005 You will need 4.5 points out of 5 to receive a grade of.5.. Integer Programming and
More informationInteger Programming. Xi Chen. Department of Management Science and Engineering International Business School Beijing Foreign Studies University
Integer Programming Xi Chen Department of Management Science and Engineering International Business School Beijing Foreign Studies University Xi Chen (chenxi0109@bfsu.edu.cn) Integer Programming 1 / 42
More information3.1 Graphing Using the First Derivative
3.1 Graphing Using the First Derivative Hartfield MATH 2040 Unit 3 Page 1 Recall that a derivative indicates the instantaneous rate of change at an x-value (or other input value) which is related to the
More informationLesson 08 Linear Programming
Lesson 08 Linear Programming A mathematical approach to determine optimal (maximum or minimum) solutions to problems which involve restrictions on the variables involved. 08 - Linear Programming Applications
More informationChapter 2 - An Introduction to Linear Programming
True / False 1. Increasing the right-hand side of a nonbinding constraint will not cause a change in the optimal solution. TOPICS: Introduction 2. In a linear programming problem, the objective function
More informationUnit.9 Integer Programming
Unit.9 Integer Programming Xiaoxi Li EMS & IAS, Wuhan University Dec. 22-29, 2016 (revised) Operations Research (Li, X.) Unit.9 Integer Programming Dec. 22-29, 2016 (revised) 1 / 58 Organization of this
More informationCh.07 Shortest Route, Minimal Spanning Tree, and Maximal Flow Models. Management Science / Prof. Bonghyun Ahn
Ch.07 Shortest Route, Minimal Spanning Tree, and Maximal Flow Models Management Science / Prof. Bonghyun Ahn Chapter Topics Network Components The Shortest Route Problem The Minimal Spanning Tree Problem
More informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 5, Due: Thursday April 2th, 2013 Problem Set Rules: 1. Each student should hand in an individual problem set. 2. Discussing
More informationOptimization Methods in Management Science
Problem Set Rules: Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 6, Due: Thursday April 11th, 2013 1. Each student should hand in an individual problem set. 2. Discussing
More information56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997
56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997 Answer #1 and any five of the remaining six problems! possible score 1. Multiple Choice 25 2. Traveling Salesman Problem 15 3.
More informationLayout Design Post Woods Apartment Complex
Layout Design Post Woods Apartment Complex Atlanta Zoo Lenox Mall, Atlanta Hospital floor plan 5 Guildcrest Homes Factory floor plan 6 Furniture parts warehouse 7 Cross-dock layout http://www.elogistics0.com/layout/sample-warehouse-layouts-.htm
More informationChapter 2 An Introduction to Linear Programming
Chapter 2 An Introduction to Linear Programming MULTIPLE CHOICE 1. The maximization or minimization of a quantity is the a. goal of management science. b. decision for decision analysis. c. constraint
More informationFinancial Optimization ISE 347/447. Lecture 13. Dr. Ted Ralphs
Financial Optimization ISE 347/447 Lecture 13 Dr. Ted Ralphs ISE 347/447 Lecture 13 1 Reading for This Lecture C&T Chapter 11 ISE 347/447 Lecture 13 2 Integer Linear Optimization An integer linear optimization
More informationFundamentals of Integer Programming
Fundamentals of Integer Programming Di Yuan Department of Information Technology, Uppsala University January 2018 Outline Definition of integer programming Formulating some classical problems with integer
More informationResource Allocation (p. 254)
Linear Optimization 4.2 120 Resource Allocation (p. 254) Determine the linear program corresponding to the following problem. A farmer has set aside 18 acres of land to be used entirely for plots of grapes,
More informationSimulation. Lecture O1 Optimization: Linear Programming. Saeed Bastani April 2016
Simulation Lecture O Optimization: Linear Programming Saeed Bastani April 06 Outline of the course Linear Programming ( lecture) Integer Programming ( lecture) Heuristics and Metaheursitics (3 lectures)
More informationMath 112 Spring 2016 Midterm 2 Review Problems Page 1
Math Spring Midterm Review Problems Page. Solve the inequality. The solution is: x x,,,,,, (E) None of these. Which one of these equations represents y as a function of x? x y xy x y x y (E) y x 7 Math
More informationChapter 9: Integer Programming
Chapter 9: Integer Programming ١ Learning Objectives (see p. 382) After completing this chapter, you should be able to: How Integer Programming (IP) differs from LP Describe how general IP problems arise
More informationNOTATION AND TERMINOLOGY
15.053x, Optimization Methods in Business Analytics Fall, 2016 October 4, 2016 A glossary of notation and terms used in 15.053x Weeks 1, 2, 3, 4 and 5. (The most recent week's terms are in blue). NOTATION
More informationLayout Design Post Woods Apartment Complex
November, 0 Layout Design Some of these slides are courtesy of Professor Paul Griffin Post Woods Apartment Complex November, 0 Atlanta Zoo Lenox Mall, Atlanta November, 0 Hospital floor plan 5 Guildcrest
More informationBCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D.
Linear Programming Module Outline Introduction The Linear Programming Model Examples of Linear Programming Problems Developing Linear Programming Models Graphical Solution to LP Problems The Simplex Method
More informationPITTSBURGH, PENNSYLVANIA
PITTSBURGH, PENNSYLVANIA ACCESSIBLE TO I-80 TO I-80 WEXFORD AMBRIDGE MECHANICSBURG Pittsburgh International Airport Ohio River SEWICKLEY FOX CHAPEL OAKMONT PA Turnpike NEW KENSINGTON Allegheny River FINDLAY
More informationChapter 6 Multicriteria Decision Making
Chapter 6 Multicriteria Decision Making Chapter Topics Goal Programming Graphical Interpretation of Goal Programming Computer Solution of Goal Programming Problems with QM for Windows and Excel The Analytical
More informationChapter 2--An Introduction to Linear Programming
Chapter 2--An Introduction to Linear Programming 1. The maximization or minimization of a quantity is the A. goal of management science. B. decision for decision analysis. C. constraint of operations research.
More informationTransportation Problems
Transportation Problems Transportation is considered as a special case of LP Reasons? it can be formulated using LP technique so is its solution 1 (to p2) Here, we attempt to firstly define what are them
More informationMONROE COMMERCE CENTER
MONROE COMMERCE CENTER Salzman Rd. 35 Acre Development Site Salzman Road at State Route 63 Mark Volkman +1 513 252 2123 mark.volkman@am.jll.com Tom Fairhurst +1 513 297 2511 tom.fairhurst@am.jll.com PROPERTY
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 7 Discrete optimization models and applications; complexity
MVE165/MMG631 Linear and integer optimization with applications Lecture 7 Discrete optimization models and applications; complexity Ann-Brith Strömberg 2019 04 09 Lecture 7 Linear and integer optimization
More information3.1 Graphing Linear Inequalities
3.1 Graphing Linear Inequalities I. Inequalities A. Introduction Many mathematical descriptions of real situations are best expressed as inequalities rather than equations. For example, a firm might be
More information4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 Mathematical programming (optimization) problem: min f (x) s.t. x X R n set of feasible solutions with linear objective function
More informationLinear Programming: Basic Concepts. Chapter 2: Hillier and Hillier
Linear Programming: Basic Concepts Chapter 2: Hillier and Hillier Agenda Define Linear Programming The Case of the Wyndor Glass Co. A Maximization Problem Developing a Mathematical Representation of Wyndor
More informationGraphing Linear Inequalities in Two Variables.
Many applications of mathematics involve systems of inequalities rather than systems of equations. We will discuss solving (graphing) a single linear inequality in two variables and a system of linear
More informationCHAPTER 4 Linear Programming with Two Variables
CHAPTER 4 Linear Programming with Two Variables In this chapter, we will study systems of linear inequalities. They are similar to linear systems of equations, but have inequalitites instead of equalities.
More information: Principles of Automated Reasoning and Decision Making Midterm
16.410-13: Principles of Automated Reasoning and Decision Making Midterm October 20 th, 2003 Name E-mail Note: Budget your time wisely. Some parts of this quiz could take you much longer than others. Move
More information2 is not feasible if rounded. x =0,x 2
Integer Programming Definitions Pure Integer Programming all variables should be integers Mied integer Programming Some variables should be integers Binary integer programming The integer variables are
More informationEcon 172A - Slides from Lecture 2
Econ 205 Sobel Econ 172A - Slides from Lecture 2 Joel Sobel September 28, 2010 Announcements 1. Sections this evening (Peterson 110, 8-9 or 9-10). 2. Podcasts available when I remember to use microphone.
More informationAttachment 1. Adelphia Separation Plan
Attachment 1 Adelphia Separation Plan ADELPHIA SEPARATION PLAN Time Warner Cable will separate the Adelphia system to be divided between us and the consortium of Local Franchise Authorities (the Consortium
More informationINTEGER AND MIXED- INTEGER OPTIMIZATION
34 INTEGER AND MIXED- INTEGER OPTIMIZATION Conceptually, it s the same as linear optimization: Continue formulating everything using linear functions: Minimize/Maximize a linear function Subject to linear
More informationGRAPHING LINEAR INEQUALITIES AND FEASIBLE REGIONS
SECTION 3.1: GRAPHING LINEAR INEQUALITIES AND FEASIBLE REGIONS We start with a reminder of the smart way to graph a Linear Equation for the typical example we see in this course, namely using BOTH X- and
More informationCity of Dunedin, FL Department of Finance Government Services Center Five Year Cost Comparison 8/4/2010
Government Services Center Five Year Cost Comparison Option #1 Option #2 Net Cost Comparison Debt Service Operating Cost Revenue Net Cost/(Revenue) Debt Service Operating Cost Revenue Net Cost/(Revenue)
More informationTIM 206 Lecture Notes Integer Programming
TIM 206 Lecture Notes Integer Programming Instructor: Kevin Ross Scribe: Fengji Xu October 25, 2011 1 Defining Integer Programming Problems We will deal with linear constraints. The abbreviation MIP stands
More informationNETWORK OPTIMIZATION MODELS
NETWORK OPTIMIZATION MODELS Network models Transportation, electrical and communication networks pervade our daily lives. Network representation are widely used in: Production, distribution, project planning,
More informationLINEAR PROGRAMMING INTRODUCTION 12.1 LINEAR PROGRAMMING. Three Classical Linear Programming Problems (L.P.P.)
LINEAR PROGRAMMING 12 INTRODUCTION ou are familiar with linear equations and linear inequations in one and two variables. They can be solved algebraically or graphically (by drawing a line diagram in case
More informationa) Alternative Optima, b) Infeasible(or non existing) solution, c) unbounded solution.
Unit 1 Lesson 5. : Special cases of LPP Learning Outcomes Special cases of linear programming problems Alternative Optima Infeasible Solution Unboundedness In the previous lecture we have discussed some
More informationLinear Programming. Meaning of Linear Programming. Basic Terminology
Linear Programming Linear Programming (LP) is a versatile technique for assigning a fixed amount of resources among competing factors, in such a way that some objective is optimized and other defined conditions
More informationLinear Programming Problems
Linear Programming Problems Linear inequalities are important because we often want to minimize or maximize a quantity (called the objective function) subject to certain constraints (linear inequalities).
More informationPresentation to: ROY SCHLEICHER Sr. Director of Marketing & Trade Development. RAUL ALFONSO Director of Latin America Marketing & Trade Development
Presentation to: ROY SCHLEICHER Sr. Director of Marketing & Trade Development RAUL ALFONSO Director of Latin America Marketing & Trade Development May, 2006 JAXPORT OVERVIEW The Jacksonville Port Authority
More informationLinear Mathematical Programming (LP)
Linear Mathematical Programming (LP) A MP is LP if : The objective function is linear where The set is defined by linear equality or inequality constraints c f T ) = ( ],..., [ n T c c c = = n b A where
More informationCOMP Analysis of Algorithms & Data Structures
COMP 3170 - Analysis of Algorithms & Data Structures Shahin Kamali Approximation Algorithms CLRS 35.1-35.5 University of Manitoba COMP 3170 - Analysis of Algorithms & Data Structures 1 / 30 Approaching
More informationFor Sale or Lease. I-20 Midway Commerce Center 30 Industrial Park Boulevard Trenton, South Carolina ±421,200 s.f. of Class A industrial space
I-20 Midway Commerce Center 30 Industrial Park Boulevard Trenton, South Carolina 29847 For Sale or Lease ±421,200 s.f. of Class A industrial space Expandable footprint: up to +1MM s.f. Minimum divisibility:
More information2016 SAC Task Force. December 1, 2016
2016 SAC Task Force December 1, 2016 Welcome and Introductions Ned Smith, MCES Director of Finance & Revenue Wendy Wulff, Metropolitan Council Member Meeting 1 Overview Charter, Timeline & Meeting Plan,
More informationADMS 3330 FALL 2008 EXAM All Multiple choice Exam (See Answer Key on last page)
MULTIPLE CHOICE. Choose the letter corresponding to the one alternative that best completes the statement or answers the question. 1. Which of the following are assumptions or requirements of the transportation
More informationMULTIMEDIA UNIVERSITY FACULTY OF ENGINEERING PEM2046 ENGINEERING MATHEMATICS IV TUTORIAL
A. Linear Programming (LP) MULTIMEDIA UNIVERSITY FACULTY OF ENGINEERING PEM046 ENGINEERING MATHEMATICS IV TUTORIAL. Identify the optimal solution and value: (a) Maximize f = 0x + 0 x (b) Minimize f = 45x
More informationPiecewise Functions. ACCOUNTING The Internal Revenue Service estimates that taxpayers. Single Individual Income Tax
1-7 BJECTIVE Identify and graph piecewise functions including greatest integer, step, and absolute value functions. Piecewise Functions ACCUNTING The Internal Revenue Service estimates that tapayers who
More informationSBC Investor Update. Merrill Lynch Global Communications Investor Conference March 16, 2004
SBC Investor Update Merrill Lynch Global Communications Investor Conference March 16, 2004 Randall Stephenson Senior Executive Vice President and Chief Financial Officer Cautionary Language Concerning
More informationComparing and Modeling with Functions
Name Date Class 13 Comparing and Modeling with Functions Quiz 1. Which of the following data sets is best described by a linear model? A {(5, 1), (4, 2), (3, 4), (2, 8)} B {(5, 1), (4, 1), (3, 3), (2,
More informationFebruary 19, Integer programming. Outline. Problem formulation. Branch-andbound
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland February 19,
More informationME 391Q Network Flow Programming
ME 9Q Network Flow Programming Final Exam, Summer 00. ( Points) The figure below shows an undirected network. The parameters on the edges are the edge lengths. Find the shortest path tree using Dijkstra
More informationMunicipal Networks. Don Berryman. Executive Vice President & President, Municipal Networks
Municipal Networks Don Berryman Executive Vice President & President, Municipal Networks 1 Executive Summary EarthLink is the leader in this fast growing market Most feasible last mile technology Product
More informationDecorah City Council - January 16, Decorah Power Municipal Electric Utility (MEU) Feasibility Study
Decorah City Council - January 16, 2018 Decorah Power Municipal Electric Utility (MEU) Feasibility Study MEU Feasibility Study Team NewGen Strategies and Solutions Denver, CO Dave Berg Consulting Rosemount,
More informationFreight Industry Outlook
Freight Industry Outlook St. Louis Regional Freightway The Port Working Group Monthly Meeting, April 6, 2016 1 Our conversation today Regions across the United States and North America Peer Metropolitan
More informationOPTIMIZAÇÃO E DECISÃO 09/10
OPTIMIZAÇÃO E DECISÃO 09/10 PL #7 Integer Programming Alexandra Moutinho (from Hillier & Lieberman Introduction to Operations Research, 8 th edition) Problem 1 Pawtucket University is planning to buy new
More informationOSCAR MAYER HEADQUARTERS NOW AVAILABLE FORMER HEAVY POWER 15 MW FROM TWO DIFFERENT SUBSTATIONS SECURITY ONSITE METRO BUS DEPOT ONSITE
910 MAYER AVENUE MADISON, WI FORMER OSCAR MAYER HEADQUARTERS NOW AVAILABLE ENTIRE CAMPUS AVAILABLE FOR SALE OR LEASE INDIVIDUAL BUILDINGS AVAILABLE FOR LEASE BUILD-TO-SUIT(S) FLEXIBLE SIZES & TERMS HEAVY
More informationHandling Indivisibilities. Notes for AGEC 622. Bruce McCarl Regents Professor of Agricultural Economics Texas A&M University
Notes for AGEC 6 Bruce McCarl Regents Professor of Agricultural Econoics Texas A&M University All or None -- Integer Prograing McCarl and Spreen Chapter 5 Many investent and probles involve cases where
More informationCHAPTER 12: LINEAR PROGRAMMING
CHAPTER 12: LINEAR PROGRAMMING Previous Years Board Exam (Important Questions & Answers) MARKS WEIGHTAGE 06 marks 1. A cottage industry manufactures pedestal lamps and wooden shades, each requiring the
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More informationExcel Forecasting Tools Review
Excel Forecasting Tools Review Duke MBA Computer Preparation Excel Forecasting Tools Review Focus The focus of this assignment is on four Excel 2003 forecasting tools: The Data Table, the Scenario Manager,
More informationData Description Measures of central tendency
Data Description Measures of central tendency Measures of average are called measures of central tendency and include the mean, median, mode, and midrange. Measures taken by using all the data values in
More informationSolving NP-hard Problems on Special Instances
Solving NP-hard Problems on Special Instances Solve it in poly- time I can t You can assume the input is xxxxx No Problem, here is a poly-time algorithm 1 Solving NP-hard Problems on Special Instances
More informationWe are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors
We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists 3,500 108,000 1.7 M Open access books available International authors and editors Downloads Our
More informationAlgebra 2 Notes Systems of Equations and Inequalities Unit 03b. Optimization with Linear Programming
Optimization with Linear Programming Big Idea Linear programming is one of the most practical uses of mathematics in the real world. The inequalities of the system represent the constraints in the problem
More information7. Solve the following compound inequality. Write the solution in interval notation.
1. Write an inequality that describes the graph. 0 1. Use words to describe the line graph. 4. Create a line graph of the inequality. x > 4 4. Write an inequality that describes the graph. 0 5. Write an
More informationIncrease uptime with a faster, more reliable, connection
FIXED WIRELESS SELLING GUIDE Key takeaways It s survivable: you ll see improved uptime and redundancy Increase uptime with a faster, more reliable, connection It s cost-efficient: you can specify, and
More informationFOUNDATIONS OF OPERATIONS RESEARCH
Master of Science in Computer Engineering FOUNDATIONS OF OPERATIONS RESEARCH Edoardo Amaldi DEI - Politecnico di Milano amaldi@elet.polimi.it Course website: http://home.dei.polimi.it/amaldi/for-10-11.html
More informationFASgov Asset Accounting Software Topic 4: Changing the FASgov Import File
FASgov Asset Accounting Software Topic 4: Changing the FASgov Import File May 24, 2003 5:22 PM Page 1 of 19 Table of Contents Section A: Preparing the FASgov Import Spreadsheet...3 Section B: Modifying
More informationHomework 3. Constraint Satisfaction Problems, Optimization problems
Homework 3 Constraint Satisfaction Problems, Optimization problems (Max score: 100 - Available points: 120) 15-381-Q: Artificial Intelligence (Fall 2018) OUT: October 6, 2018 DUE: October 14, 2018 at 23:55pm
More information2018 Schedule. Plastics Academy
Plastics Academy 2018 Schedule Our list of Paulson Certification Seminars taught by expert instructors in a city near you. In addition, all Paulson seminars are available for customized instruction at
More informationCHAPTER 3 ADDING AND SUBTRACTING FRACTIONS
3.1 Adding and Subtracting Like Fractions 83 CHAPTER 3 ADDING AND SUBTRACTING FRACTIONS 3.1 Adding and Subtracting Like Fractions 3.1 Margin Exercises 1. (a && The denominators are the same, so & and &
More informationII. Linear Programming
II. Linear Programming A Quick Example Suppose we own and manage a small manufacturing facility that produced television sets. - What would be our organization s immediate goal? - On what would our relative
More informationElectronically Filed - City of St. Louis - May 27, :02 PM
Electronically Filed - City of St. Louis - May 27, 2014-03:02 PM Electronically Filed - City of St. Louis - May 27, 2014-03:02 PM Electronically Filed - City of St. Louis - May 27, 2014-03:02 PM Electronically
More informationSearch Algorithms. IE 496 Lecture 17
Search Algorithms IE 496 Lecture 17 Reading for This Lecture Primary Horowitz and Sahni, Chapter 8 Basic Search Algorithms Search Algorithms Search algorithms are fundamental techniques applied to solve
More informationAlgorithms for Decision Support. Integer linear programming models
Algorithms for Decision Support Integer linear programming models 1 People with reduced mobility (PRM) require assistance when travelling through the airport http://www.schiphol.nl/travellers/atschiphol/informationforpassengerswithreducedmobility.htm
More informationLinear Programming. You can model sales with the following objective function. Sales 100x 50y. x 0 and y 0. x y 40
Lesson 9.7 Objectives Solve systems of linear inequalities. Solving Systems of Inequalities Suppose a car dealer nets $500 for each family car (F) sold and $750 for each sports car (S) sold. The dealer
More informationChapter II. Linear Programming
1 Chapter II Linear Programming 1. Introduction 2. Simplex Method 3. Duality Theory 4. Optimality Conditions 5. Applications (QP & SLP) 6. Sensitivity Analysis 7. Interior Point Methods 1 INTRODUCTION
More informationWarm -Up. 1. Draw a connected graph with 4 vertices and 7 edges. What is the sum of the degrees of all the vertices?
Warm -Up 1. Draw a connected graph with 4 vertices and 7 edges. What is the sum of the degrees of all the vertices? 1. Is this graph a. traceable? b. Eulerian? 3. Eulerize this graph. Warm-Up Eulerize
More information4 Linear Programming (LP) E. Amaldi -- Foundations of Operations Research -- Politecnico di Milano 1
4 Linear Programming (LP) E. Amaldi -- Foundations of Operations Research -- Politecnico di Milano 1 Definition: A Linear Programming (LP) problem is an optimization problem: where min f () s.t. X n the
More informationOPTIMIZATION. joint course with. Ottimizzazione Discreta and Complementi di R.O. Edoardo Amaldi. DEIB Politecnico di Milano
OPTIMIZATION joint course with Ottimizzazione Discreta and Complementi di R.O. Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-16-17.shtml
More informationMathematical Tools for Engineering and Management
Mathematical Tools for Engineering and Management Lecture 8 8 Dec 0 Overview Models, Data and Algorithms Linear Optimization Mathematical Background: Polyhedra, Simplex-Algorithm Sensitivity Analysis;
More informationTRANSPORTATION AND ASSIGNMENT PROBLEMS
TRANSPORTATION AND ASSIGNMENT PROBLEMS Transportation problem Example P&T Company produces canned peas. Peas are prepared at three canneries (Bellingham, Eugene and Albert Lea). Shipped by truck to four
More informationWAREHOUSE/OFFICE BUILDING FOR LEASE
WAREHOUSE/OFFICE BUILDING FOR LEASE 1099 Sullivant Avenue Columbus, Ohio 43223 11,677 +/- SF Building on 0.775 +/- Acre Stephen Tucker stucker@rweiler.com Patrick Miller pmiller@rweiler.com 10 N. High
More informationDefine the problem and gather relevant data Formulate a mathematical model to represent the problem Develop a procedure for driving solutions to the
Define the problem and gather relevant data Formulate a mathematical model to represent the problem Develop a procedure for driving solutions to the problem Test the model and refine it as needed Prepare
More information3. Decision variables are represented in both the objective function and the constraints while formulating a linear program.
Supplement E Supplement E Linear Programming Linear Programming TRUE/FALSE 1. Linear programming is useful for allocating scarce resources among competing demands. Answer: True Reference: Introduction
More informationBuying and Upgrading Your Computer System. Developing Your Own Microcomputer System. Get Started the Right Way. Analyzing Needs.
Get Started the Right Way Buying and Upgrading Your Computer System The Right Way Determine your needs Make sure the computer will run the software you plan to use The Wrong Way Buying a computer based
More informationCHAPTER 3 LINEAR PROGRAMMING: SIMPLEX METHOD
CHAPTER 3 LINEAR PROGRAMMING: SIMPLEX METHOD Linear programming is optimization problem where the objective function is linear and all equality and inequality constraints are linear. This problem was first
More informationOPTIMUM DESIGN. Dr. / Ahmed Nagib Elmekawy. Lecture 3
OPTIMUM DESIGN Dr. / Ahmed Nagib Elmekawy Lecture 3 1 Graphical Solution 1. Sketch coordinate system 2. Plot constraints 3. Determine feasible region 4. Plot f(x) contours 5. Find opt solution x* & opt
More information