Homework #2 Graphical LP s.

Similar documents
The homework is due on Wednesday, September 7. Each questions is worth 0.8 points. No partial credits.

MgtOp 470 Business Modeling with Spreadsheets Washington State University Sample Final Exam

6.4 Solving Linear Inequalities by Using Addition and Subtraction

Optimization Methods in Management Science

Chapter 7 An Introduction to Linear Programming

Solutions to Midterm Exam. ECON Financial Economics Boston College, Department of Economics Spring Tuesday, March 19, 10:30-11:45am

Linear Programming: Exercises

Optimization Methods in Management Science

Part 1 Examination Paper 1.2. Section A 10 C 11 C 2 A 13 C 1 B 15 C 6 C 17 B 18 C 9 D 20 C 21 C 22 D 23 D 24 C 25 C

Homework. Part 1. Computer Implementation: Solve Wilson problem by the Lindo and compare the results with your graphical solution.

Lesson Topics. B.3 Integer Programming Review Questions

Optimization Models one variable optimization and multivariable optimization

2016 EXAMINATIONS ACCOUNTING TECHNICIAN PROGRAMME PAPER TC 3: BUSINESS MATHEMATICS & STATISTICS

Continuing Education Course #287 Engineering Methods in Microsoft Excel Part 2: Applied Optimization

ECON 200 EXERCISES. (b) Appeal to any propositions you wish to confirm that the production set is convex.

Consumption, Investment and the Fisher Separation Principle

Instantaneous rate of change (IRC) at the point x Slope of tangent

Econ Homework 4 - Answers ECONOMIC APPLICATIONS OF CONSTRAINED OPTIMIZATION. 1. Assume that a rm produces product x using k and l, where

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Advanced Operations Research Prof. G. Srinivasan Dept of Management Studies Indian Institute of Technology, Madras

Math Models of OR: More on Equipment Replacement

Linear Modeling Business 5 Supply and Demand

Chapter Two: Linear Programming: Model Formulation and Graphical Solution

DM559/DM545 Linear and integer programming

Operation Research II

= quantity of ith good bought and consumed. It

ENGG OPT TECHNIQUES Fall 2008 SOLVED EXAMPLES

Homework solutions, Chapter 8

Step 2: Determine the objective and write an expression for it that is linear in the decision variables.

Setting Up Linear Programming Problems

POMDPs: Partially Observable Markov Decision Processes Advanced AI

Introducing nominal rigidities. A static model.

Consumer Theory. The consumer s problem: budget set, interior and corner solutions.

3. a) Recall that slope is calculated with formula:

Graphical Sensitivity Analysis

Solutions to Problem Set 1

Lecture 3. Understanding the optimizer sensitivity report 4 Shadow (or dual) prices 4 Right hand side ranges 4 Objective coefficient ranges

Setting Up Linear Programming Problems

INTERNATIONAL UNIVERSITY OF JAPAN Public Management and Policy Analysis Program Graduate School of International Relations

OPTIMIZAÇÃO E DECISÃO 10/11

Lecture 10: The knapsack problem

Thursday, March 3

CHAPTER 13: A PROFIT MAXIMIZING HARVEST SCHEDULING MODEL

5.2 Partial Variation

Introduction to Operations Research

Problem Set VI: Edgeworth Box

Section 2 Solutions. Econ 50 - Stanford University - Winter Quarter 2015/16. January 22, Solve the following utility maximization problem:

Consumer Budgets, Indifference Curves, and Utility Maximization 1 Instructional Primer 2

Topic 7. Nominal rigidities

Econ 101A Final exam May 14, 2013.

Online Appendix: Extensions

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India October 2012

The application of linear programming to management accounting

Problem Set 1 Answer Key. I. Short Problems 1. Check whether the following three functions represent the same underlying preferences

February 24, 2005

1. Introduction of another instrument of savings, namely, capital

The Lagrangian method is one way to solve constrained maximization problems.

3.3 - One More Example...

Penalty Functions. The Premise Quadratic Loss Problems and Solutions

PORTFOLIO OPTIMIZATION AND EXPECTED SHORTFALL MINIMIZATION FROM HISTORICAL DATA

Homework 2 ECN205 Spring 2011 Wake Forest University Instructor: McFall

Game Theory Tutorial 3 Answers

Econ 101A Final exam May 14, 2013.

Department of Economics The Ohio State University Final Exam Answers Econ 8712

d. Find a competitive equilibrium for this economy. Is the allocation Pareto efficient? Are there any other competitive equilibrium allocations?

True_ The Lagrangian method is one way to solve constrained maximization problems.

Cost Estimation as a Linear Programming Problem ISPA/SCEA Annual Conference St. Louis, Missouri

Week 6: Sensitive Analysis

Haiyang Feng College of Management and Economics, Tianjin University, Tianjin , CHINA

9. Real business cycles in a two period economy

LINEAR PROGRAMMING. Homework 7

The supply function is Q S (P)=. 10 points

Chapter 21. Dynamic Programming CONTENTS 21.1 A SHORTEST-ROUTE PROBLEM 21.2 DYNAMIC PROGRAMMING NOTATION

EconS Constrained Consumer Choice

Sensitivity Analysis with Data Tables. 10% annual interest now =$110 one year later. 10% annual interest now =$121 one year later

x x x1

EconS 301 Intermediate Microeconomics Review Session #4

(Note: Please label your diagram clearly.) Answer: Denote by Q p and Q m the quantity of pizzas and movies respectively.

Column generation to solve planning problems

SOLUTION QUANTITATIVE TOOLS IN MANAGEMENT MAY (x) 5000 ( ) ( )

MA 162: Finite Mathematics - Chapter 1

DUALITY AND SENSITIVITY ANALYSIS

SOLVING ROBUST SUPPLY CHAIN PROBLEMS

JEFF MACKIE-MASON. x is a random variable with prior distrib known to both principal and agent, and the distribution depends on agent effort e

Risk-neutral Binomial Option Valuation

Question 1: Productivity, Output and Employment (30 Marks)

EC 202. Lecture notes 14 Oligopoly I. George Symeonidis

COMP331/557. Chapter 6: Optimisation in Finance: Cash-Flow. (Cornuejols & Tütüncü, Chapter 3)

Reuben Gronau s Model of Time Allocation and Home Production

COMM 290 MIDTERM REVIEW SESSION ANSWER KEY BY TONY CHEN

Essays on Some Combinatorial Optimization Problems with Interval Data

Homework 1 Due February 10, 2009 Chapters 1-4, and 18-24

FUNCTIONS. Revenue functions and Demand functions

Linear Programming: Simplex Method

Intro to Economic analysis

Fall Midterm Examination Solutions Monday 10 November 2014

Chapter 7 Pricing with Market Power SOLUTIONS TO EXERCISES

Advanced Microeconomic Theory EC104

Problem Set 2: Answers

1 A tax on capital income in a neoclassical growth model

Transcription:

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 and in an organized manner to receive maximum credit. Correct answers without supporting calculations or diagrams will not receive credit. Incorrect answers using the correct method and a good presentation will receive substantial credit. My name is: 1. Consider the following linear program: Maximize x + 2y Subject to x <= 5 (1) y <= 4 (2) 2x + 2y = 12 (3) x => 0, y => 0 a. Graph the constraints and bounds. Work out the size of the graph to make it easier to draw! Constraints (1) and (2) are easy. Setting x = 0 in (3) gives 2y = 12 or y = 6. Similarly setting y = 0 in (3) gives 2x = 12 or x = 6. Max x is 6 and Max y is 6 1

7 y 6 5 4 b (2): y <= 4 3 2 1 (1): x <= 5 (3): 2x + 2y = 12 a x 1 1 2 3 4 5 6 7 1 b. Identify the feasible region. The line segment on constraint (3) between point a (x=5, y=2) and point b (x=2, y=4). c. What are the extreme points of the feasible region? The extreme points of the feasible region are points a and b. d. Find the optimal solution using the graphical procedure. 2

7 y 6 5 Solution lies at x = 2 and y = 4 4 3 2 1 x 1 1 2 3 4 5 6 7 1 We can read the Optimal Values of the decision variables off the Graph in this case. However we can solve the simultaneous equations (2) y = 4 and (3) 2x + 2y = 12. Clearly y = 4 which is substituted into (3) giving 2x + 2(4) = 12 2x = 12 8 x = 4/2 = 2 We obtain the Objective Function Value by substituting these values into the Objective Function x + 2y giving 2 + 2(4) = 2 + 8 = 10 2. Embassy Motorcycles (EM) manufacturers two lightweight motorcycles designed for easy handling and safety. The EZ-Rider model has a new engine and a low profile that make it easy to balance. The Lady-Sport model is slightly larger, uses a more traditional engine and is specifically designed to appeal to women riders. Embassy produces the engines for both models at its Des Moines, Iowa, plant. Each EZ-Rider engine requires 6 hours of manufacturing time and each Lady-Sport engine requires 3 hours of manufacturing time. The Des Moines plant has 2100 hours of engine manufacturing time available for the next production period. Embassy's motorcycle frame supplier can supply as many EZ-Rider frames as needed. However, the Lady-Sport frame is more complex 3

and the supplier can only provide up to 280 Lady-Sport frames for the next production period. Final assembly and testing requires 2 hours for each EZ-Rider model and 2.5 hours for each Lady-Sport model. A maximum of 1000 hours of assembly and testing time are available for the next production period. The company's accounting department projects a profit contribution of $2400 for each EZ-Rider produced and $1800 for each Lady-Sport produced. a. Formulate a linear programming model that can be used to determine the number of units of each model that should be produced in order to maximize the total contribution to profit. Let x1 be number of EZ-Riders produced. Let x2 be number of Lady-Sports produced The Objective is to maximize the profit contribution: Max 2,400 x1 + 1,800 x2 The Constraints are: Engine Manufacturing Time <= 2100 hours Lady-Sport Frames <= 280 frames Assembly & Test <= 1000 hours 6 x1 + 3 x2 <= 2100 (Engine Manufacturing) x2 <= 280 (Lady-Sport Frames) 2 x1 + 2.5 x2 <= 1000 (Assembly & Test) We also need bounds x1 and x2 => 0. So the full model is: Max 2,400 x1 + 1,800 x2 Subject to 6 x1 + 3 x2 <= 2100 (Engine Manufacturing) x2 <= 280 (Lady-Sport Frames) 2 x1 + 2.5 x2 <= 1000 (Assembly & Test) x1 => 0, x2 =>0 4

2 b. Solve the problem graphically. What is the optimal solution? x1 is 350 if x2 = 0 and x2 = 700 if x1 = 0 in Engine Manufacturing x1 is max 280 in Lady-Sports Frames x1 is 500 if x2 = 0 and x2 = 400 if x1 = 0 in Assembly & Test So we need to allow up to 800 for x2 and up to 500 for x1 on our graph. 900 x2 Engine Assembly: 6 x1 + 3 x2 <= 2100 800 700 Objective Function: 2400 x1 + 1800 x2 = M 600 LadySportFrames: x2<= 280 500 400 300 200 Assembly & Test 1: 2x1 + 2.5x2 <= 1000 100 100 200 300 400 500 600 700 800 900 x1 100 5

So the solution occurs where: a. 2 x1 + 2.5 x2 = 1000 and b. 6 x1 + 3 x2 = 2100 So we solve these simultaneous equations: Set x2 = (2100/3) (6/3) x1 from equation b. Substitute into equation a. 2 x1 + (5/2) *( (2100/3) ( 2 x1) ) =1000 2 x1 + (10500/6) 5 x1 = 1000-3 x1 =1000 1750 3 x1 = 750 x1 = 250 Substitute into equation b. (6 * 250) + 3 x2 = 2100 3 x2 = 2100 1500 x2 = 200 The Objective Function value is 2400 x1 + 1800 x2 = (2400 * 250) + (1800 * 200) = 600,000 + 360,000 = 960,000 So the solution is: x1 = 250, x2 = 200 and the Objective Function value Z= 960,000 c. Which constraints are binding? Assembly & Test and Engine Manufacturing are the binding constraints. 6