ISyE 2030 Test 2 Solutions

Similar documents
The Newsvendor Model

Math 120 Final Exam Practice Problems, Form: A

Chapter 5. Linear Inequalities and Linear Programming. Linear Programming in Two Dimensions: A Geometric Approach

Systems of Linear Equations in Three Variables

Queuing Theory. Long Term Averages. Assumptions. Interesting Values. Queuing Model

Linear Programming Supplement E

Math 461 Fall 2006 Test 2 Solutions

Introductory Notes on Demand Theory

PART A: For each worker, determine that worker's marginal product of labor.

Chapter 5. Decimals. Use the calculator.

Microeconomics Sept. 16, 2010 NOTES ON CALCULUS AND UTILITY FUNCTIONS

FREE ENTERPRISE TEST

Part 1 Expressions, Equations, and Inequalities: Simplifying and Solving

3.3 Applications of Linear Functions

Solution of the System of Linear Equations: any ordered pair in a system that makes all equations true.

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

Reorder level = demand during lead time = lead time x demand per unit time ROL = LT x D

Learning Objectives for Section 1.1 Linear Equations and Inequalities

Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab

Algebra EOC Practice Test #4

Tenth Problem Assignment

Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment 2-3, Probability and Statistics, March Due:-March 25, 2015.

Queuing Theory II 2006 Samuel L. Baker

12.5: CHI-SQUARE GOODNESS OF FIT TESTS

UNIT 2 QUEUING THEORY

Math Questions & Answers

Word Problems Involving Systems of Linear Equations

Operation Research. Module 1. Module 2. Unit 1. Unit 2. Unit 3. Unit 1

INTEGRATED OPTIMIZATION OF SAFETY STOCK

3.1 Solving Systems Using Tables and Graphs

Lesson 7 - The Aggregate Expenditure Model

Stochastic Models for Inventory Management at Service Facilities

Let s explore the content and skills assessed by Heart of Algebra questions.

4 The M/M/1 queue. 4.1 Time-dependent behaviour

Forward exchange rates

Basic Components of an LP:

Chapter 13 Waiting Lines and Queuing Theory Models - Dr. Samir Safi

The Marginal Cost of Capital and the Optimal Capital Budget

Chapter 6 Competitive Markets

The Mathematics 11 Competency Test Percent Increase or Decrease

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

By: ATEEKH UR REHMAN 12-1

ANSWERS TO END-OF-CHAPTER QUESTIONS

Quiz Chapter 7 - Solution

1 Mathematical Models of Cost, Revenue and Profit

Investment Appraisal INTRODUCTION

Problems 1-21 could be on the no Derive part. Sections 1.2, 2.2, 2.3, 3.1, 3.3, 3.4, 4.1, 4.2

Math 1314 Lesson 8 Business Applications: Break Even Analysis, Equilibrium Quantity/Price

Economics 335, Spring 1999 Problem Set #7

A Detailed Price Discrimination Example

(AA11) FINANCIAL ACCOUNTING BASICS

Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method

3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max

TOPIC 4: DERIVATIVES

Douglas, Spring 2008 February 21, 2008 PLEDGE: I have neither given nor received unauthorized help on this exam.

Single item inventory control under periodic review and a minimum order quantity

1 The EOQ and Extensions

Chapter 011 Project Analysis and Evaluation

Florida Algebra I EOC Online Practice Test

6.041/6.431 Spring 2008 Quiz 2 Wednesday, April 16, 7:30-9:30 PM. SOLUTIONS

The problem with waiting time

Chapter 7 Notes Page 1. As we have seen, inventory costs are made up of the following under Absorption Costing:

Investments 320 Dr. Ahmed Y. Dashti Chapter 3 Interactive Qustions

Management Accounting 243 Pricing Decision Analysis

Practice Test for the General Knowledge Math Test. Section 1 Number Sense 1. Order the following series of numbers from smallest to largest.

Total shares at the end of ten years is 100*(1+5%) 10 =162.9.

Homework 1 (Time, Synchronization and Global State) Points

ANSWERS TO END-OF-CHAPTER QUESTIONS

Pricing I: Linear Demand

Review 3. Table The following table presents cost and revenue information for Soper s Port Vineyard.

Linear Programming. March 14, 2014

We Will Sell Your House, Or ERA Will Buy It!

Financial Mathematics and Simulation MATH Spring 2011 Homework 2

Week 1: Functions and Equations

Verbal Phrases to Algebraic Expressions

Learning Objectives. After reading Chapter 11 and working the problems for Chapter 11 in the textbook and in this Workbook, you should be able to:

Economics. Worksheet Circular Flow Simulation

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

volume-profit relationships

Math 55: Discrete Mathematics

1st Grade Math Standard I Rubric. Number Sense. Score 4 Students show proficiency with numbers beyond 100.

Binomial lattice model for stock prices

1(a). How many ways are there to rearrange the letters in the word COMPUTER?

Linear Programming. Solving LP Models Using MS Excel, 18

Example 1. Consider the following two portfolios: 2. Buy one c(s(t), 20, τ, r) and sell one c(s(t), 10, τ, r).

MBA350 INTEGRATIVE CAPSTONE COURSE

Economics 121b: Intermediate Microeconomics Problem Set 2 1/20/10

Practical Guide to the Simplex Method of Linear Programming

Marginal Cost. Example 1: Suppose the total cost in dollars per week by ABC Corporation for 2

Chapter 6. Inventory Control Models

Effective Inventory Analysis

Unit 26 Estimation with Confidence Intervals

Chapter 5 Financial Forwards and Futures

Module 49 Consumer and Producer Surplus

For a partition B 1,..., B n, where B i B j = for i. A = (A B 1 ) (A B 2 ),..., (A B n ) and thus. P (A) = P (A B i ) = P (A B i )P (B i )

Income Measurement and Profitability Analysis

Microeconomics Instructor Miller Practice Problems Labor Market

0.1 Dividing Fractions

Pre-Test Chapter 25 ed17

MATERIALS MANAGEMENT. Module 9 July 22, 2014

Transcription:

1 NAME ISyE 2030 Test 2 Solutions Fall 2004 This test is open notes, open books. Do precisely 5 of the following problems your choice. You have exactly 55 minutes. 1. Suppose that we are simulating the sales of turkeys at a local market. The owner starts off with 10 turkeys. The daily demand for turkeys for the next 6 days is as follows. 9 3 8 5 2 7 Each turkey costs the owner $7 to buy, and can be sold to a customer for $13. It costs the owner $1 to store each turkey overnight (i.e., if it wasn t sold that day). It also costs the owner $2 per turkey if he is unable to fill a demand maybe the irate customer does damage to the store. If, at the end of a particular day, the owner has less than or equal to 3 turkeys in stock, he places an order to bring the inventory level back up to 10 the next morning. He gets the turkeys the first thing in the morning before any customers arrive. Compute his total profit/loss for this 6-day period. How many turkeys are left at the end of the last day? ANSWER: There are a number of interpretations for this problem, all of which are perfectly acceptable, as long as you state the assumptions you used. In the answer that I ll now display, let s assume: We have to pay for the initial 10 turkeys. We have no holding cost for the first day. We don t have to pay holding costs for any turkeys left over after the last day. So here s what happens...

2 Our earnings are therefore Day t Demand D t Inventory at Order Quantity End of Day I t 0 10 1 9 1 9 2 3 7 0 3 8 1 10 4 5 5 0 5 2 3 7 6 7 3 0 Turkeys bought (7 units) $252 Holding cost (16 units) $16 Stockout cost (1 unit) $2 Turkeys sold (33 units) $429 TOTAL $159 Further, note that 3 turkeys are left.

3 2. Consider a queueing system with customers arriving according to a Poisson process at the rate of 5 per hour. Which of the following systems gives the lower steady-state expected time in system (i.e., waiting in line plus service time)? (A) Two slow parallel servers, each of whom can serve customers with Exp(3/hour) service times, or (B) One fast server, who can serve customers with Exp(6/hour) services? Show all work. ANSWER: (A) Here we have an M/M/2 queueing system with λ = 5, µ = 3, and c = 2. Thus, ρ = λ/(cµ) = 5/6. Going to the M/M/2 tables, we do a little calculation and come up with P 0 = 1/11, and with a little more algebra, we have L = 60/11. Finally, w = L/λ = 1.1 hours. (B) Meanwhile, now we have we have an M/M/1 queueing system with λ = 5 and µ = 6. Thus, ρ = λ/µ = 5/6 (still). Going to the M/M/1 tables, we do a teensy calculation and come up with w = 1 µ(1 ρ) = 1. Thus, choose the M/M/1.

4 3. The Reddy Mikks Company owns a small paint factory that produces both interior and exterior house paints for wholesale distribution. Two basic raw materials, A and B, are used to manufacture the paints. The maximum availability of A is 8 tons/day. The max availability of B is 6 tons/day. The daily requirements of the raw materials per ton of interior and exterior paints are summarized as follows: For a ton of exterior paint, you need 1 tons of A and 1.5 tons of B. For a ton of interior paint, you need 2 tons of A and 1 ton of B. A market survey has established that the daily demand for interior paint cannot exceed that of exterior paint by more than one ton. The survey also shows that the demand for interior paint is limited to 2 tons daily. The wholesale price per ton is $3000 for exterior paint and $2000 for interior paint. We are interested in finding the mix of interior and exterior that maximizes gross income. (a) Formulate this problem as a linear program. ANSWER: Let x denote the amount of interior; let y denote the amount of exterior. Here is the formulation. max 2000x + 3000y s.t. 2x + y 8 x + 3 2 y 6 x y + 1 x 2 x, y 0. (b) Draw a graph illustrating the relevant inequalities. (c) What is the best mix of paints to produce? ANSWER: Draw the picture, and check the corners, and you ll see that the answer is (x, y) = (2, 8/3) or (0,4) (or a linear combination of the two). The reason for the linear combination is that the optimal answer is actually a line segment. (d) Write out relevant Xpress code.

5 4. A newsvendor faces the following discrete demand distribution: X P (Demand = X) 20 0.20 21 0.15 22 0.20 23 0.25 24 0.20 The newsvendor buys the papers for 60 cents and sells them for $1.00. Leftover papers are salvaged for 10 cents each. (a) What would the marginal benefit be to the newsvendor of going from 21 to 22 papers? ANSWER: Let p denote the probability of selling the xth unit, and let D denote the demand. x P(D = x) p 1 p 0.4p = 0.5(1 p) = Exp net profit Exp profit from Exp loss from not from stocking selling xth unit selling xth unit xth unit <20 0 20 0.20 1.00 0.00 0.40 0.00 0.40 21 0.15 0.80 0.20 0.32 0.10 0.22 22 0.20 0.65 0.35 0.26 0.175 0.085 23 0.25 0.45 0.55 0.18 0.275-0.095 24 0.20 0.20 0.80 0.08 0.40-0.32 >24 0.00 0.00 1.00 0.00 0.50-0.50 Thus, you get 0.085 more going from 21 to 22. (b) What s the optimal number of papers to stock each day? ANSWER: 22.

6 5. The Village Butcher Shop makes its meat loaf from a combination of lean ground beef and ground pork. The beef contains 70% meat and 30% fat and costs the shop 80 cents per pound; the pork contains 60% meat and 40% fat, and costs 60 cents per pound. We are interested in determining how much of each kind of meat the shop should use in each pound of meat loaf if it wants to minimize its cost and to keep the fat content of the meat loaf to no more than 35%. I just want you to formulate this problem you don t have to solve it. ANSWER: Let B denote the amount of beef and P the amount of pork. Here is the formulation. min 0.8B + 0.6P s.t. 0.3B + 0.4P 0.35 B + P = 1 B, P 0.

7 6. Formulate the making change problem (i.e., cashier returns as few coins as possible) assuming the cashier will give back only coins of value 1 cents, 5 cents, 10 cents, 25 cents, and $1.00 (yes, there is a $1.00 coin), and the change you will receive is $5.67. Make sure to clearly define the variables. ANSWER: Let Here is the formulation. x 1 = number of pennies used x 2 = number of nickels used x 3 = number of dimes used x 4 = number of quarters used x 5 = number of dollars used min 5i=1 x i s.t. 0.01x 1 + 0.05x 2 + 0.1x 3 + 0.25x 4 + x 5 = 5.67 x i 0 and integer for all i.