An Introduction to Linear Programming (LP)
|
|
- Marshall Freeman
- 5 years ago
- Views:
Transcription
1 An Introduction to Linear Programming (LP) How to optimally allocate scarce resources! 1 Please hold your applause until the end.
2 What is a Linear Programming A linear program (LP) is an optimization problem consisting of a function to be maximized or minimized subject to one or more limitations (called constraints) on the variables of the function. Both the optimization function (called the objective function) and the constraints have only linear relationships. 2
3 George Dantzig Inventor of linear programming and the simplex algorithm Born: 8 Nov 1914 Died: 13 May 2005 In 1947 Dantzig made the contribution to mathematics for which he is most famous, the simplex method of optimisation. It grew out of his work with the U.S. Air Force known as "programming", a military term that, at that time, referred to plans or schedules for training, logistical supply or deployment of men. Dantzig mechanised the planning process by introducing "programming in a linear structure" 3
4 The Road Ahead Example LP The Graphical Solution LP Defined Application and Examples Solving a LP The Computer Way The Algebraic Way The Simplex Way 4
5 Our Very First Example The Opti Mize Company manufactures two products that compete for the same (limited) resources. Relevant information is: Product A B Available resources Labor-hrs/unit hrs/day Machine hrs/unit hrs/day Cost/unit $6 $20 $180/day Profit/unit $5 $15 5
6 The Model Let X = number of units of product A to manufacture Y = number of units of product B to manufacture Max Profit = z = 5 X + 15 Y subject to: X + 2 Y <= 20 (labor-hours) 2 X + 2 Y <= 30 (machine hours) 6 X + 20Y <= 180 ($ - budget) X >= 0, Y >= 0 6
7 The Graphical Solution Y X + 2 Y = X
8 The Graphical Solution Y X + 20Y = 180 X + 2 Y = X
9 The Graphical Solution Y 20 2X + 2Y = X + 20Y = 180 X + 2 Y = X
10 The Graphical Solution Y X + 2Y = 30 The feasible region X + 20Y = 180 X + 2 Y = X
11 The Graphical Solution (continued) Y Z = 5X + 15Y = X
12 The Graphical Solution (continued) Y Z = 5X + 15Y = Z = 5X + 15Y = X
13 The Graphical Solution (continued) Y 20 Z = 5 (5) + 15 (7.5) = (5, 7.5) Z = 5X + 15Y = Z = 5X + 15Y = X
14 The Graphical Solution Alternate Approach Y 20 Z = 5X + 15Y 15 (x = 5, y = 7.5; z = 137.5) (x = 10, y = 5; z = 125) (x = 0, y = 0; z = 0) (x = 0, y = 9; z = 135) (x = 15, y = 0; z = 75) X
15 This is powerful stuff! Can we see another example followed by a description of the general model? Sure can.. 15
16 The Classical Diet Problem A Minimization Problem 16
17 The Problem Mr. U. R. Fatte has been placed on a diet by his Doctor (Dr. Ima Quack) consisting of the foods shown below. The doctor warned him to insure proper consumption of nutrients to sustain life. Relevant information is: 17 Nutrients Beer Pizza Monthly Requirement Vitamin A 2 mg/oz 3 mg/oz 3500 mg (min rqmt) Protein 6 mg/oz 2 mg/oz 7000 mg (min rqmt) Fat 4g/oz 2g/oz 8000 grams (max rqmt) cost/oz $0.50 $0.20
18 The Mathematical Model Let X = ounces of beer consumed per week Y = ounces of pizza consumed per week Min cost = z = 0.5X + 0.2Y subject to: 2X + 3Y >= X + 2Y >= X + 2Y <= 8000 X, Y >= 0 18
19 The Boundary Equations Y x + 2y = 7,000 4x + 2y = 8,000 2X + 3Y >= X + 2Y >= X + 2Y <= x + 3y = 3, X 19
20 Feasible Region Y X 20
21 Feasible Region with Objective Function Y z =.5X +.2Y z =.5X +.2Y = $800 (0,4000) and (1600,0) X 21
22 Optimal Solution Y x 2y 7, 000 2x 3y 3,500 6x 2y 7, 000 6x 9y 10,500 7y 3,500 or y* 500 7, 000 2y x* 1, z*.5 x.2 y $ X 22
23 Optimal Solution alternate approach Y (x = 0, y = 4000, z = $800) 4000 (x = 0, y = 3500, z = $700) 3000 z =.5X +.2Y 2000 (x = 1000, y = 500, z = $600) 1000 (x = 1,750, y = 0, z = $875) (x =2000, y = 0, z = $1,000) X 23
24 Surgeon General s Warning The minimum cost diet found in solving this problem is illustrative only. One should not attempt to follow this diet for any prolonged period of time. 24
25 The General Diet Problem Minimize the "cost of the menu" subject to the nutrition requirements: eat enough but not too much of Vitamin A.. eat enough but not too much Vitamin C Eat at least a certain minimum number of servings of beef but not more than the maximum number of servings of beef you want... Eat at least a certain minimum number of servings of carrots but not more than the maximum number of servings of carrots you want 25 Special student exercise: solve the diet problem found on The supplement homework list of the course website!
26 The General LP Model Max or Min z = c 1 x 1 + c 2 x c n x n subject to: A 11 x 1 + A 12 x A 1n x n <= b 1 A 21 x 1 + A 22 x A 2n x n <= b 2.. A m1 x 1 + A m2 x A mn x n <= b m Objective Function Constraints x 1, x 2,... x n >= 0 26 x j = decision variables or activity levels c j = profit or cost coefficient A ij = technology coefficient b i = resource capacities (right hand side values)
27 27 Assumptions Deterministic all input data (parameters) are known and constant no statistical uncertainty Linear cost or profit is additive and proportional to the activity levels output or resources consumed are additive and proportional to the activity levels Non-integer variables (activity levels) are continuous
28 Solution Procedures Graphical two or three variables only Algebraic solve systems of equations for corner points Simplex algorithm numerical, iterative approach Ellipsoid theoretical importance more than applied 28
29 Can we see more examples of this LP thing? Please!!!!! Let s do it. 29
30 A Blending Problem The B. A. Nutt Company sells mixed nuts of two quality levels. The expensive mix should not contain more than 25% peanuts nor less than 40% cashews. The cheap mix should not have more than 60% peanuts and no less than 20% cashews. Cashews cost 50 cents a pound and peanuts cost 20 cents a pound. The expensive mix sells for 80 cents a pound and the cheap mix for 40 cents a pound. What should the blend of each mix be in order to maximize profit. The company has $100 a day with which to purchase nuts. 30
31 The Model Let x 1 = pounds of cashews in expensive mix x 2 = pounds of peanuts in expensive mix y 1 = pounds of cashews in cheap mix y 2 = pounds of peanuts in cheap mix Max z =.80 (x 1 + x 2 ) +.40 (y 1 + y 2 ) -.5(x 1 +y 1 ) -.2(x 2 + y 2 ) subject to:.5 (x 1 + y 1 ) +.2(x 2 + y 2 ) <= 100 x 2 / (x 1 +x 2 ) <=.25 y 2 /(y 1 + y 2 ) <=.6 31 x 1 / (x 1 +x 2 ) >=.40 y 1 /(y 1 + y 2 ) >=.20
32 Re-formulate the Model Max z = =.3x 1 +.6x 2 -.1y 1 +.2y 2 subject to:.5x 1 +.2x 2 +.5y y 2 <= x x 2 <= y y 2 <= 0.60x x 2 >= 0.80y y 2 >= 0 32
33 A Marketing Example The I. B. Adman Advertising Company is planning a large media blitz covering television, radio, and magazines to sell management science to the public. The company s objective is to reach as many people as possible. Results of a market survey show: Television Day time Prime Time Radio Magazines cost per unit $40,000 75,000 30,000 15,000 # people 400, , , ,000 # business 300, , , , The company has a budget of $800,000 to spend on the campaign. It requires at least two million exposures among the business community. Television must be limited to $500,000, and at least 3 units of day time and 2 units of prime time must be purchased. Advertising units on both radio and magazines should be between 5 and 10.
34 The Model Let x 1, x 2, x 3, and x 4 be the number of advertising units bought in daytime TV, primetime TV, radio and magazines. Max z = 400x x x x 4 (in thousands) subject to: 40,000x ,000x ,000x ,000x 4 <= 800, ,000x ,000x ,000x ,000x 4 >= 2,000,000 40,000x ,000x 2 <= 500, x 1 >= 3; x 2 >= 2; 5 <= x 3 <= 10; 5 <= x 4 <= 10
35 The Transportation Problem A company manufactures a single product at each of m factories. Factory i has a capacity of S i per month. There are n warehouses receiving this product. The demand at warehouse j is D j. It cost factory i, c ij dollars to ship one unit to warehouse j. How many units should each factory send to each warehouse in order to minimize the total transportation costs? This is a really neat problem. 35
36 The LP Formulation Let x ij = the number of units sent from factory i to warehouse j 36 Min z m i 1 subject to: n j 1 m i 1 n j 1 c x x S i 1, 2,..., m x D j 1, 2,..., n x ij ij ij ij ij i 0 j
37 Job-Training The Never-Say-Die Life Insurance Company hires and trains a large number of salespersons each month to replace those who have departed. Trained salespersons must be used to train new salespersons. Training takes one month and there is a 20 percent attrition rate by the end of the month. While a salesperson is training a new employee, that person cannot be used in the field selling insurance. The monthly demand for experienced salespeople is: Month Demand (in the field) January 100 February 150 March 200 April 225 May Trainees receive $400 per month while it costs the company $850 per month for an experienced salesperson. Ten percent of all experienced salespeople will leave the company by the end of each month.
38 The Model Let x i = the number of trainees during month i y i = the number of experienced salespeople in month i Min z = 1250 (x 1 + x 2 + x 3 + x 4 + x 5 ) subj to: y 1 - x 1 >= 100 y 2 - x 2 >= 150 y 3 - x 3 >= 200 y 4 - x 4 >= 225 y 5 - x 5 >= 175 y i =.9y i-1 +.8x i-1 for i = 1, 2, 3, 4, 5 38 example: y feb =.9 y jan +.8x jan
39 A Large Department Store Somewhere in the Midwest Problem Set 2.3F 6 Store operates 7 days a week Min number of salespersons required is 12 for Mon., 18 for Tues., 20 for Wed., 28 for Thurs., 32 for Fri., 40 for Sat. and Sun. Each salesperson works 5 days a week with 2 consecutive days off What is the minimum number of salespersons and how should their days off be allocated?
40 The Formulation Let x i = the number of salesperson that start their week on day i (i = M, T, W, Th, F, Sa, Su) Min z x x x x x x x M T W TH F Sa Su s. t. x x x x x 12 M TH F Sa Su x x x x x 18 M T F Sa Su x x x x x M T W Sa Su x x x x x M T W Th Su x x x x x M T W Th F x x x x x T W Th F Sa x x x x x W Th F Sa Su Monday Tuesday Wednesday Thursday Friday Saturday Sunday
41 Urban Renewal ORsville has severe budget shortage City council votes to improve the tax base condemning inner-city housing replacing with new development Up to 300 substandard houses may be demolished each house occupies.25 acre lot and cost $2,000 to demolish Lot sizes for single, double, triple, and quadruple family unit are.18,.28,.4, and.5 acre respectively 15% of available acreage need for utilities, streets, green space, etc. Triple and quadruple units must be at least 25% of total, single at least 20%, and double at least 10% Tax levied per single, double, triple, and quadruple is $1,000, $1,900, $2,700, and $3,400 respectively Construction costs per single, double, triple, and quadruple is $50,000, $70,000, $130,000, and $160,000 respectively Max of $15 million available for construction 41
42 The Decision Variables x 1 = number of units of single-family homes x 2 = number of units of double-family homes x 3 = number of units of triple-family homes x 4 = number of units of quadruple-family homes x 5 = number of old homes to be demolished 42 A city council member tosses a coin to see if a particular house is to be demolished.
43 The Model 43 Max z 1000x 1900x 2700x 3400x subject to : x.28 x.4 x.5 x x x x.2 x x x x x.1 x x x x x x.25 x x x x x 70x 130x 160x 2x 15, x, x, x, x, x tax collection available acreage max nbr to demolish minimum nbr of each home type budget in $1,000
44 The Model s Solution x 1 = x 2 = x 3 = x 4 = 0 x 5 = z = $343,965 I will not live in a house that is only.83 complete! 44
45 Is it okay if we work more of these on our own? Gee, this LP stuff can solve just about any problem.
46 Computer Solutions LINDO LINGO Excel Solver What s Best (Excel add-on) AMPL TORA Can you show us how the computer solves these LP problems? 46
47 Don t touch that drop card! Next More LP The Simplex Algorithm The fun never stops! 47
Chapter 2 Linear programming... 2 Chapter 3 Simplex... 4 Chapter 4 Sensitivity Analysis and duality... 5 Chapter 5 Network... 8 Chapter 6 Integer
目录 Chapter 2 Linear programming... 2 Chapter 3 Simplex... 4 Chapter 4 Sensitivity Analysis and duality... 5 Chapter 5 Network... 8 Chapter 6 Integer Programming... 10 Chapter 7 Nonlinear Programming...
More information56:171 Operations Research Midterm Examination October 25, 1991 PART ONE
56:171 O.R. Midterm Exam - 1 - Name or Initials 56:171 Operations Research Midterm Examination October 25, 1991 Write your name on the first page, and initial the other pages. Answer both questions of
More informationMathematics for Management Science Notes 06 prepared by Professor Jenny Baglivo
Mathematics for Management Science Notes 0 prepared by Professor Jenny Baglivo Jenny A. Baglivo 00. All rights reserved. Integer Linear Programming (ILP) When the values of the decision variables in a
More informationIntroduction to Operations Research
Introduction to Operations Research Unit 1: Linear Programming Terminology and formulations LP through an example Terminology Additional Example 1 Additional example 2 A shop can make two types of sweets
More informationNon-negativity: negativity:
Chapter 3 Linear Programming Applications The process of problem formulation Marketing and media applications Financial Applications Transportation Problem The process of problem formulation 1. Provide
More informationLecture 3: Common Business Applications and Excel Solver
Lecture 3: Common Business Applications and Excel Solver Common Business Applications Linear Programming (LP) can be used for many managerial decisions: - Product mix - Media selection - Marketing research
More informationChapter 2 Linear Programming: Basic Concepts. Review Questions
Introduction to Management Science A Modeling and Case Studies Approach with Spreadsheets th Edition Hillier Solutio Full Download: http://testbanklive.com/download/introduction-to-management-science-a-modeling-and-case-studies-approach-wit
More informationOptimizing the service of the Orange Line
Optimizing the service of the Orange Line Overview Increased crime rate in and around campus Shuttle-UM Orange Line 12:00am 3:00am late night shift A student standing or walking on and around campus during
More informationCSCI 1951-G Optimization Methods in Finance Part 00: Course Logistics Introduction to Finance Optimization Problems
CSCI 1951-G Optimization Methods in Finance Part 00: Course Logistics Introduction to Finance Optimization Problems January 26, 2018 1 / 24 Basic information All information is available in the syllabus
More informationProduct Mix Problem: Fifth Avenue Industries. Linear Programming (LP) Can Be Used for Many Managerial Decisions:
Linear Programming (LP) Can Be Used for Many Managerial Decisions: Product mix Make-buy Media selection Marketing research Portfolio selection Shipping & transportation Multiperiod scheduling For a particular
More informationAssignment 2 Answers Introduction to Management Science 2003
Assignment Answers Introduction to Management Science 00. a. Top management will need to know how much to produce in each quarter. Thus, the decisions are the production levels in quarters,,, and. The
More informationPERT 12 Quantitative Tools (1)
PERT 12 Quantitative Tools (1) Proses keputusan dalam operasi Fundamental Decisin Making, Tabel keputusan. Konsep Linear Programming Problem Formulasi Linear Programming Problem Penyelesaian Metode Grafis
More informationINTERNATIONAL UNIVERSITY OF JAPAN Public Management and Policy Analysis Program Graduate School of International Relations
Hun Myoung Park (4/18/2018) LP Interpretation: 1 INTERNATIONAL UNIVERSITY OF JAPAN Public Management and Policy Analysis Program Graduate School of International Relations DCC5350 (2 Credits) Public Policy
More informationContinuing Education Course #287 Engineering Methods in Microsoft Excel Part 2: Applied Optimization
1 of 6 Continuing Education Course #287 Engineering Methods in Microsoft Excel Part 2: Applied Optimization 1. Which of the following is NOT an element of an optimization formulation? a. Objective function
More informationEcon 172A - Slides from Lecture 7
Econ 172A Sobel Econ 172A - Slides from Lecture 7 Joel Sobel October 18, 2012 Announcements Be prepared for midterm room/seating assignments. Quiz 2 on October 25, 2012. (Duality, up to, but not including
More informationThe homework is due on Wednesday, September 7. Each questions is worth 0.8 points. No partial credits.
Homework : Econ500 Fall, 0 The homework is due on Wednesday, September 7. Each questions is worth 0. points. No partial credits. For the graphic arguments, use the graphing paper that is attached. Clearly
More informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 15.053, Spring 013 Problem Set (Second Group of Students) Students with first letter of surnames I Z Due: February 1, 013 Problem Set Rules: 1. Each student
More informationProduction Planning. Basic Inventory Model Workforce Scheduling. Enhance Modeling Skills Dynamic Models Spring 03 Vande Vate 1
Production Planning Basic Inventory Model Workforce Scheduling Enhance Modeling Skills Dynamic Models 15.057 Spring 03 Vande Vate 1 Dynamic Inventory Model Modeling Time Modeling Inventory Unusual Network
More informationISE 330 Introduction to Operations Research: Linear Programming Review Deterministic Models limited resources competing activities optimal Any
ISE 0 Introduction to Operations Research: Deterministic Models www-scf.usc.edu/~ise0/007 September, 007 Lecture Linear Programming Examples (Sec..4.) Linear Programming Review Linear Programming provides
More informationCHAPTER 13: A PROFIT MAXIMIZING HARVEST SCHEDULING MODEL
CHAPTER 1: A PROFIT MAXIMIZING HARVEST SCHEDULING MODEL The previous chapter introduced harvest scheduling with a model that minimized the cost of meeting certain harvest targets. These harvest targets
More informationDUALITY AND SENSITIVITY ANALYSIS
DUALITY AND SENSITIVITY ANALYSIS Understanding Duality No learning of Linear Programming is complete unless we learn the concept of Duality in linear programming. It is impossible to separate the linear
More informationQuestion #1: Snacks and foods that will be part of my low cost diet: Table 1: Nutritional information Description Milk 1% fat with calcium added (250 ml) 1 2 3 4 5 6 7 8 9 10 30 g Appletropical 2 slices
More informationSCHOOL OF BUSINESS, ECONOMICS AND MANAGEMENT. BF360 Operations Research
SCHOOL OF BUSINESS, ECONOMICS AND MANAGEMENT BF360 Operations Research Unit 3 Moses Mwale e-mail: moses.mwale@ictar.ac.zm BF360 Operations Research Contents Unit 3: Sensitivity and Duality 3 3.1 Sensitivity
More informationOperations Research I: Deterministic Models
AMS 341 (Spring, 2010) Estie Arkin Operations Research I: Deterministic Models Exam 1: Thursday, March 11, 2010 READ THESE INSTRUCTIONS CAREFULLY. Do not start the exam until told to do so. Make certain
More informationC R E A T I V E W O R K B O O K / / J U N E / / S E T Y O U R G O A L S A N D A C H I E V E T H E M!
C R E A T I V E W O R K B O O K / / J U N E 2 0 1 8 / / O IT prioritize your life S E T Y O U R G O A L S A N D A C H I E V E T H E M! How to prioritize your life in 3 simple steps. 1. Plan a life you
More information4. Introduction to Prescriptive Analytics. BIA 674 Supply Chain Analytics
4. Introduction to Prescriptive Analytics BIA 674 Supply Chain Analytics Why is Decision Making difficult? The biggest sources of difficulty for decision making: Uncertainty Complexity of Environment or
More informationEcon 172A, W2002: Final Examination, Solutions
Econ 172A, W2002: Final Examination, Solutions Comments. Naturally, the answers to the first question were perfect. I was impressed. On the second question, people did well on the first part, but had trouble
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 informationHomework. Part 1. Computer Implementation: Solve Wilson problem by the Lindo and compare the results with your graphical solution.
Homework. Part 1. Computer Implementation: Solve Wilson problem by the Lindo and compare the results with your graphical solution. Graphical Solution is attached to email. Lindo The results of the Wilson
More information1. Find the slope and y-intercept for
MA 0 REVIEW PROBLEMS FOR THE FINAL EXAM This review is to accompany the course text which is Finite Mathematics for Business, Economics, Life Sciences, and Social Sciences, th Edition by Barnett, Ziegler,
More informationExercise 1 Modelling and Convexity
TMA947 / MMG621 Nonlinear optimization Exercise 1 Modelling and Convexity Emil Gustavsson, Michael Patriksson, Adam Wojciechowski, Zuzana Šabartová September 16, 2014 E1.1 (easy) To produce a g. of cookies
More informationTUFTS UNIVERSITY DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ES 152 ENGINEERING SYSTEMS Spring Lesson 16 Introduction to Game Theory
TUFTS UNIVERSITY DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ES 52 ENGINEERING SYSTEMS Spring 20 Introduction: Lesson 6 Introduction to Game Theory We will look at the basic ideas of game theory.
More informationDennis L. Bricker Dept. of Industrial Engineering The University of Iowa
Dennis L. Bricker Dept. of Industrial Engineering The University of Iowa 56:171 Operations Research Homework #1 - Due Wednesday, August 30, 2000 In each case below, you must formulate a linear programming
More informationChapter Two: Linear Programming: Model Formulation and Graphical Solution
Chapter Two: Linear Programming: Model Formulation and Graphical Solution PROBLEM SUMMARY 1. Maximization (1 28 continuation), graphical solution 2. Minimization, graphical solution 3. Sensitivity analysis
More information56:171 Operations Research Midterm Exam Solutions October 22, 1993
56:171 O.R. Midterm Exam Solutions page 1 56:171 Operations Research Midterm Exam Solutions October 22, 1993 (A.) /: Indicate by "+" ="true" or "o" ="false" : 1. A "dummy" activity in CPM has duration
More informationProblem B.1, HR7E Solve the following LP graphically R. Saltzman
Problem B.1, HR7E Solve the following LP graphically R. Saltzman Maximize 4X + 6Y = Z subject to: (1) X + 2Y = Note: There is a typograhpical error in the book regarding
More informationSensitivity Analysis with Data Tables. 10% annual interest now =$110 one year later. 10% annual interest now =$121 one year later
Sensitivity Analysis with Data Tables Time Value of Money: A Special kind of Trade-Off: $100 @ 10% annual interest now =$110 one year later $110 @ 10% annual interest now =$121 one year later $100 @ 10%
More informationOverview Definitions Mathematical Properties Properties of Economic Functions Exam Tips. Midterm 1 Review. ECON 100A - Fall Vincent Leah-Martin
ECON 100A - Fall 2013 1 UCSD October 20, 2013 1 vleahmar@uscd.edu Preferences We started with a bundle of commodities: (x 1, x 2, x 3,...) (apples, bannanas, beer,...) Preferences We started with a bundle
More informationSolving Examples of Linear Programming Models
Solving Examples of Linear Programming Models Chapter 4 Copyright 2013 Pearson Education 4-1 Chapter Topics 1. A Product Mix Example 2. A Diet Example 3. An Investment Example 4. A Marketing Example 5.
More informationECONOMICS 100A: MICROECONOMICS
ECONOMICS 100A: MICROECONOMICS Fall 2013 Tues, Thur 2:00-3:20pm Center Hall 101 Professor Mark Machina Office: Econ Bldg 217 Office Hrs: Wed 9am-1pm ( See other side for Section times & locations, and
More informationHomework #2 Graphical LP s.
UNIVERSITY OF MASSACHUSETTS Isenberg School of Management Department of Finance and Operations Management FOMGT 353-Introduction to Management Science Homework #2 Graphical LP s. Show your work completely
More informationCOMM 290 MIDTERM REVIEW SESSION ANSWER KEY BY TONY CHEN
COMM 290 MIDTERM REVIEW SESSION ANSWER KEY BY TONY CHEN TABLE OF CONTENTS I. Vocabulary Overview II. Solving Algebraically and Graphically III. Understanding Graphs IV. Fruit Juice Excel V. More on Sensitivity
More informationOptimization for Chemical Engineers, 4G3. Written midterm, 23 February 2015
Optimization for Chemical Engineers, 4G3 Written midterm, 23 February 2015 Kevin Dunn, kevin.dunn@mcmaster.ca McMaster University Note: No papers, other than this test and the answer booklet are allowed
More informationGraphical Sensitivity Analysis
What if there is uncertainly about one or more values in the LP model? Sensitivity analysis allows us to determine how sensitive the optimal solution is to changes in data values. This includes analyzing
More informationAdvanced Operations Research Prof. G. Srinivasan Dept of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Dept of Management Studies Indian Institute of Technology, Madras Lecture 23 Minimum Cost Flow Problem In this lecture, we will discuss the minimum cost
More informationHomework solutions, Chapter 8
Homework solutions, Chapter 8 NOTE: We might think of 8.1 as being a section devoted to setting up the networks and 8.2 as solving them, but only 8.2 has a homework section. Section 8.2 2. Use Dijkstra
More informationLinear Programming: Sensitivity Analysis and Interpretation of Solution
8 Linear Programming: Sensitivity Analysis and Interpretation of Solution MULTIPLE CHOICE. To solve a linear programming problem with thousands of variables and constraints a personal computer can be use
More informationChapter 21. Dynamic Programming CONTENTS 21.1 A SHORTEST-ROUTE PROBLEM 21.2 DYNAMIC PROGRAMMING NOTATION
Chapter 21 Dynamic Programming CONTENTS 21.1 A SHORTEST-ROUTE PROBLEM 21.2 DYNAMIC PROGRAMMING NOTATION 21.3 THE KNAPSACK PROBLEM 21.4 A PRODUCTION AND INVENTORY CONTROL PROBLEM 23_ch21_ptg01_Web.indd
More informationFinancial Optimization ISE 347/447. Lecture 15. Dr. Ted Ralphs
Financial Optimization ISE 347/447 Lecture 15 Dr. Ted Ralphs ISE 347/447 Lecture 15 1 Reading for This Lecture C&T Chapter 12 ISE 347/447 Lecture 15 2 Stock Market Indices A stock market index is a statistic
More informationLP OPTIMUM FOUND AT STEP 2 OBJECTIVE FUNCTION VALUE
The Wilson Problem: Graph is at the end. LP OPTIMUM FOUND AT STEP 2 1) 5520.000 X1 360.000000 0.000000 X2 300.000000 0.000000 2) 0.000000 1.000000 3) 0.000000 2.000000 4) 140.000000 0.000000 5) 200.000000
More information56:171 Operations Research Midterm Exam Solutions October 19, 1994
56:171 Operations Research Midterm Exam Solutions October 19, 1994 Possible Score A. True/False & Multiple Choice 30 B. Sensitivity analysis (LINDO) 20 C.1. Transportation 15 C.2. Decision Tree 15 C.3.
More informationFormulating Linear Programming Models
Session # Page 1 Some Examples: Product Mix (Session #2) Cash Flow (Session #) Diet / Blending Scheduling Transportation / Distribution Assignment Steps for Developing an Algebraic LP Model 1. What decisions
More information56:171 Operations Research Midterm Exam Solutions Fall 1994
56:171 Operations Research Midterm Exam Solutions Fall 1994 Possible Score A. True/False & Multiple Choice 30 B. Sensitivity analysis (LINDO) 20 C.1. Transportation 15 C.2. Decision Tree 15 C.3. Simplex
More informationDeterministic Dynamic Programming
Deterministic Dynamic Programming Dynamic programming is a technique that can be used to solve many optimization problems. In most applications, dynamic programming obtains solutions by working backward
More informationm
Chapter 1: Linear Equations a. Solving this problem is equivalent to finding an equation of a line that passes through the points (0, 24.5) and (30, 34). We use these two points to find the slope: 34 24.5
More informationMathematics for Management Science Notes 07 prepared by Professor Jenny Baglivo
Mathematics for Management Science Notes 07 prepared by Professor Jenny Baglivo Jenny A. Baglivo 2002. All rights reserved. Calculus and nonlinear programming (NLP): In nonlinear programming (NLP), either
More informationProblem Set 2: Answers
Economics 623 J.R.Walker Page 1 Problem Set 2: Answers The problem set came from Michael A. Trick, Senior Associate Dean, Education and Professor Tepper School of Business, Carnegie Mellon University.
More informationLINEAR PROGRAMMING. Homework 7
LINEAR PROGRAMMING Homework 7 Fall 2014 Csci 628 Megan Rose Bryant 1. Your friend is taking a Linear Programming course at another university and for homework she is asked to solve the following LP: Primal:
More informationMODULE-1 ASSIGNMENT-2
MODULE-1 ASSIGNMENT-2 An investor has Rs 20 lakhs with her and considers three schemes to invest the money for one year. The expected returns are 10%, 12% and 15% for the three schemes per year. The third
More informationOperations Research I: Deterministic Models
AMS 341 (Spring, 2009) Estie Arkin Operations Research I: Deterministic Models Exam 1: Thursday, March 12, 2009 READ THESE INSTRUCTIONS CAREFULLY. Do not start the exam until told to do so. Make certain
More informationThe application of linear programming to management accounting
The application of linear programming to management accounting After studying this chapter, you should be able to: formulate the linear programming model and calculate marginal rates of substitution and
More informationOperation Research II
Operation Research II Johan Oscar Ong, ST, MT Grading Requirements: Min 80% Present in Class Having Good Attitude Score/Grade : Quiz and Assignment : 30% Mid test (UTS) : 35% Final Test (UAS) : 35% No
More informationFinancial Literacy Money Trek Program Module 1: Workbook Introduction to Money Management AAUW California Financial Literacy Committee
Financial Literacy Money Trek Program Module 1: Workbook Introduction to Money Management AAUW California Financial Literacy Committee 1 Module 1: Introduction to Money Management Discussion What are the
More informationLecture 2. A Telephone Staffing Problem TransportCo Distribution Problem Shelby Shelving Case Summary and Preparation for next class
Decision Models Lecture 2 1 Lecture 2 A Telephone Staffing Problem TransportCo Distribution Problem Shelby Shelving Case Summary and Preparation for next class Decision Models Lecture 2 2 A Telephone Staffing
More informationTHE APPLICATION OF MANAGEMENT SCIENCE IN DECISION MAKING AND FORECASTING IN MANUFACTURING COMPANIES (PZ CUSSONS AS CASE STUDY)
874 THE APPLICATION OF MANAGEMENT SCIENCE IN DECISION MAKING AND FORECASTING IN MANUFACTURING COMPANIES (PZ CUSSONS AS CASE STUDY) Akintoye Oluwasegun Ogundiya 1, Usman Jibril Wushishi 2 1 (Department
More informationLinear Programming Formulations
Linear Programming Formulations For these problems you need to answer sensitivity analysis questions using excel. These questions appear in italic fonts. The excel files are available on the course website.
More informationOptimization Models one variable optimization and multivariable optimization
Georg-August-Universität Göttingen Optimization Models one variable optimization and multivariable optimization Wenzhong Li lwz@nju.edu.cn Feb 2011 Mathematical Optimization Problems in optimization are
More informationCost Estimation as a Linear Programming Problem ISPA/SCEA Annual Conference St. Louis, Missouri
Cost Estimation as a Linear Programming Problem 2009 ISPA/SCEA Annual Conference St. Louis, Missouri Kevin Cincotta Andrew Busick Acknowledgments The author wishes to recognize and thank the following
More informationEconomics 101 Fall 2013 Homework 5 Due Thursday, November 21, 2013
Economics 101 Fall 2013 Homework 5 Due Thursday, November 21, 2013 Directions: The homework will be collected in a box before the lecture. Please place your name, TA name and section number on top of the
More informationENGG OPT TECHNIQUES Fall 2008 SOLVED EXAMPLES
EXAMPLE 1 HILLIARD Electronics produces specially coded chips for laser surgery in 256MB and 512MB (MB stands for megabyte; where one megabyte is roughly equal to one million characters of information).
More informationSAMPLE PULSE REPORT. For the month of: February 2013 STR # Date Created: April 02, 2013
STR Analytics 4940 Pearl East Circle Suite 103 Boulder, CO 80301 Phone: +1 (303) 396-1641 Fax: +1 (303) 449 6587 www.stranalytics.com PULSE REPORT For the month of: February 2013 STR # Date Created: April
More informationInteger Programming Models
Integer Programming Models Fabio Furini December 10, 2014 Integer Programming Models 1 Outline 1 Combinatorial Auctions 2 The Lockbox Problem 3 Constructing an Index Fund Integer Programming Models 2 Integer
More informationQuantitative Analysis for Management Linear Programming Models:
Quantitative Analysis for Management Linear Programming Models: 7-000 by Prentice Hall, Inc., Upper Saddle River, Linear Programming Problem. Tujuan adalah maximize or minimize variabel dependen dari beberapa
More informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 1.3 Recitation 1 TAs: Giacomo Nannicini, Ebrahim Nasrabadi Problem 1 You create your own start-up company that caters high-quality organic food directly to
More information3.3 - One More Example...
c Kathryn Bollinger, September 28, 2005 1 3.3 - One More Example... Ex: (from Tan) Solve the following LP problem using the Method of Corners. Kane Manufacturing has a division that produces two models
More informationECONOMICS 100A: MICROECONOMICS
ECONOMICS 100A: MICROECONOMICS Summer Session II 2011 Tues, Thur 8:00-10:50am Center Hall 214 Professor Mark Machina Office: Econ Bldg 217 Office Hrs: Tu/Th 11:30-1:30 TA: Michael Futch Office: Sequoyah
More informationFebruary 24, 2005
15.053 February 24, 2005 Sensitivity Analysis and shadow prices Suggestion: Please try to complete at least 2/3 of the homework set by next Thursday 1 Goals of today s lecture on Sensitivity Analysis Changes
More informationLinear Programming: Simplex Method
Mathematical Modeling (STAT 420/620) Spring 2015 Lecture 10 February 19, 2015 Linear Programming: Simplex Method Lecture Plan 1. Linear Programming and Simplex Method a. Family Farm Problem b. Simplex
More informationDM559/DM545 Linear and integer programming
Department of Mathematics and Computer Science University of Southern Denmark, Odense May 22, 2018 Marco Chiarandini DM559/DM55 Linear and integer programming Sheet, Spring 2018 [pdf format] Contains Solutions!
More informationy 3 z x 1 x 2 e 1 a 1 a 2 RHS 1 0 (6 M)/3 M 0 (3 5M)/3 10M/ / /3 10/ / /3 4/3
AMS 341 (Fall, 2016) Exam 2 - Solution notes Estie Arkin Mean 68.9, median 71, top quartile 82, bottom quartile 58, high (3 of them!), low 14. 1. (10 points) Find the dual of the following LP: Min z =
More informationSetting Up Linear Programming Problems
Setting Up Linear Programming Problems A company produces handmade skillets in two sizes, big and giant. To produce one big skillet requires 3 lbs of iron and 6 minutes of labor. To produce one giant skillet
More informationLesson Topics. B.3 Integer Programming Review Questions
Lesson Topics Rounding Off (5) solutions in continuous variables to the nearest integer (like 2.67 rounded off to 3) is an unreliable way to solve a linear programming problem when decision variables should
More informationOptimize (Maximize or Minimize) Z=C1X1 +C2X2+..Cn Xn
Linear Programming Problems Formulation Linear Programming is a mathematical technique for optimum allocation of limited or scarce resources, such as labour, material, machine, money, energy and so on,
More informationTHE UNIVERSITY OF BRITISH COLUMBIA
Be sure this eam has pages. THE UNIVERSITY OF BRITISH COLUMBIA Sessional Eamination - June 12 2003 MATH 340: Linear Programming Instructor: Dr. R. Anstee, section 921 Special Instructions: No calculators.
More informationTo Lend or to Borrow Directions: Read the story and answer the questions that follow.
EXERCISE 13.1 THE ME 3 Lesson 13: Buddy, Can You Spare a Dime? To Lend or to Borrow Directions: Read the story and answer the questions that follow. Tia s mom dropped Tia and Tia s friend, Morgan, off
More informationThe Optimization Process: An example of portfolio optimization
ISyE 6669: Deterministic Optimization The Optimization Process: An example of portfolio optimization Shabbir Ahmed Fall 2002 1 Introduction Optimization can be roughly defined as a quantitative approach
More informationComparative Study between Linear and Graphical Methods in Solving Optimization Problems
Comparative Study between Linear and Graphical Methods in Solving Optimization Problems Mona M Abd El-Kareem Abstract The main target of this paper is to establish a comparative study between the performance
More informationAGRICULTURE POTFOLIO MODEL MODEL TWO. Keywords: Decision making under uncertainty, efficient portfolio, variance analysis, MOTAD
AGRICULTURE POTFOLIO MODEL MODEL TWO Keywords: Decision making under uncertainty, efficient portfolio, variance analysis, MOTAD DATA Net income from three crops per acre of land (Income in thousand dollar
More informationHomework 2 ECN205 Spring 2011 Wake Forest University Instructor: McFall
Homework 2 ECN205 Spring 2011 Wake Forest University Instructor: McFall Instructions: Answer the following problems and questions carefully. Just like with the first homework, I ll call names randomly
More informationA simple wealth model
Quantitative Macroeconomics Raül Santaeulàlia-Llopis, MOVE-UAB and Barcelona GSE Homework 5, due Thu Nov 1 I A simple wealth model Consider the sequential problem of a household that maximizes over streams
More informationTHE INSTITUTE OF CHARTERED ACCOUNTANTS (GHANA)
THE INSTITUTE OF CHARTERED ACCOUNTANTS (GHANA) MAY 22 EXAMINATIONS (PROFESSIONAL) PART 2 QUANTITATIVE TOOLS IN BUSINESS (Paper 2.) Attempt five (5) Questions in ALL TIME ALLOWED: Reading & Planning - 5
More informationLinear Programming: Exercises
Linear Programming: Exercises 1. The Holiday Meal Turkey Ranch is considering buying two different brands of turkey feed and blending them to provide a good, low-cost diet for its turkeys. Each brand of
More informationCOMP331/557. Chapter 6: Optimisation in Finance: Cash-Flow. (Cornuejols & Tütüncü, Chapter 3)
COMP331/557 Chapter 6: Optimisation in Finance: Cash-Flow (Cornuejols & Tütüncü, Chapter 3) 159 Cash-Flow Management Problem A company has the following net cash flow requirements (in 1000 s of ): Month
More informationLecture 3. Understanding the optimizer sensitivity report 4 Shadow (or dual) prices 4 Right hand side ranges 4 Objective coefficient ranges
Decision Models Lecture 3 1 Lecture 3 Understanding the optimizer sensitivity report 4 Shadow (or dual) prices 4 Right hand side ranges 4 Objective coefficient ranges Bidding Problems Summary and Preparation
More informationMath Models of OR: More on Equipment Replacement
Math Models of OR: More on Equipment Replacement John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA December 2018 Mitchell More on Equipment Replacement 1 / 9 Equipment replacement
More informationMaximizing Operations Processes of a Potential World Class University Using Mathematical Model
American Journal of Applied Mathematics 2015; 3(2): 59-63 Published online March 20, 2015 (http://www.sciencepublishinggroup.com/j/ajam) doi: 10.11648/j.ajam.20150302.15 ISSN: 2330-0043 (Print); ISSN:
More informationDepartment of Economics ECO 204 Microeconomic Theory for Commerce Test 2
Department of Economics ECO 204 Microeconomic Theory for Commerce 2013-2014 Test 2 IMPORTANT NOTES: Proceed with this exam only after getting the go-ahead from the Instructor or the proctor Do not leave
More informationb) [3 marks] Give one more optimal solution (different from the one computed in a). 2. [10 marks] Consider the following linear program:
Be sure this eam has 5 pages. THE UNIVERSITY OF BRITISH COLUMBIA Sessional Eamination - April 21 200 MATH 340: Linear Programming Instructors: Dr. R. Anstee, Section 201 Dr. Guangyue Han, Section 202 Special
More information36106 Managerial Decision Modeling Sensitivity Analysis
1 36106 Managerial Decision Modeling Sensitivity Analysis Kipp Martin University of Chicago Booth School of Business September 26, 2017 Reading and Excel Files 2 Reading (Powell and Baker): Section 9.5
More informationx x x1
Mathematics for Management Science Notes 08 prepared by Professor Jenny Baglivo Graphical representations As an introduction to the calculus of two-variable functions (f(x ;x 2 )), consider two graphical
More information