Chapter 10 Solutions 1 Soln:

Slides:



Advertisements
Similar presentations
Example 6 Course Grades Chapter 2.4 A student has taken four tests and has earned grades of 90%, 88%, 93%, and 85%. If all 5 tests count the same, what.
Advertisements

DECISION MODELING WITH MICROSOFT EXCEL Copyright 2001 Prentice Hall Publishers and Ardith E. Baker Chapter 5 LINEAR OPTIMIZATION: APPLICATIONS Part 1.
Session II – Introduction to Linear Programming
Dynamic Programming In this handout A shortest path example
Problems With Decision Criteria Transparencies for chapter 2.
Chapter 5 Linear Inequalities and Linear Programming
Chapter 5 Linear Inequalities and Linear Programming Section 3 Linear Programming in Two Dimensions: A Geometric Approach.
Chapter 4: Linear Programming Presented by Paul Moore.
Correlation and regression Dr. Ghada Abo-Zaid
MTH-5101 Pretest A Solutions
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Properties of the Binomial Probability Distributions 1- The experiment consists of a sequence of n identical trials 2- Two outcomes (SUCCESS and FAILURE.
EMGT 501 HW # Due Day: Sep 14.
Session 10b. Decision Models -- Prof. Juran2 Overview Marketing Simulation Models New Product Development Decision –Uncertainty about competitor behavior.
Estimation 8.
Sampling Distributions
Capital Allocation Between The Risky And The Risk-Free Asset
Chapter 10. Resource Allocation
Pages Amy earned a grade of 83 and 94 on her two math tests. What must she earn on her third test to get A average Average = 90 # of tests.
Chapter 2 Optimization Models Optimization: –Aim: To find or choose a procedure or make decisions so as to achieve some goal or to make some key performance.
Product Mix Problem Monet company makes four types of frames.
1 Conditional Probability and Bayes’ Theorem Dr. Jerrell T. Stracener, SAE Fellow EMIS 7370 STAT 5340 Probability and Statistics for Scientists and Engineers.
System Engineering & Economy Analysis
Chapter 9 sec 6.  How many of you have bought a car?, House?, furniture?, RV?, boat?,…  What made you decide to buy these things?  Did you look for.
Decision Trees and Influence Diagrams Dr. Ayham Jaaron.
Chapter 6 Normal Distributions
Accounting Principles, Ninth Edition
Normative Criteria for Decision Making Applying the Concepts
Backup Agreements in Fashion Buying-The Value of Upstream Flexibility Eppen and Iyer (1997) Presented By: Hakan Umit 21 April 2003.
Chapter 26 Part 1.
Chapter 7 Estimation. Section 7.3 Estimating p in the Binomial Distribution.
Transportation Problem
John Wiley & Sons, Inc. © 2005 Chapter 6 Inventories Prepared by Naomi Karolinski Monroe Community College and and Marianne Bradford Bryant College Accounting.
Pro Forma Income Statement Projected or “future” financial statements. The idea is to write down a sequence of financial statements that represent expectations.
Chapter 6 Supplement Linear Programming.
1 Linear Programming Chapter 2 By Mohammad Shahid Khan M.Eco, MBA, B.Cs, B.Ed. Lecturer in Economics & Business Administration Department of Economics.
Introduction A GENERAL MODEL OF SYSTEM OPTIMIZATION.
Solving Systems of Linear Inequalities
Chapter 14: Fair Division Part 5 – Defining Fairness.
© 2015 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
King Saud University Women Students
Chapter 9 - Decision Analysis - Part I
CHAPTER 11 SECTION 2 Inference for Relationships.
1 Lesson Mean and Range. 2 Lesson Mean and Range California Standard: Statistics, Data Analysis, and Probability 1.1 Compute the range, mean,
Chapter 14 – Fair Division Part 2: The Knaster Inheritance Procedure.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
 I am going to calculate what the imaginary student, Suzie Que, must do to make the grade she seeks in this course.  To see what you must do, just follow.
Example-1: An insurance company sells a 10,000 TRL 1-year term insurance policy at an annual premium of 290 TRL. Based on many year’s information, the.
Properties of the Binomial Probability Distributions 1- The experiment consists of a sequence of n identical trials 2- Two outcomes (SUCCESS and FAILURE.
Prepared by Diane Tanner University of North Florida Flexible Vs. Static Budgets Chapter 7.
Properties of the Binomial Probability Distributions 1- The experiment consists of a sequence of n identical trials 2- Two outcomes (SUCCESS and FAILURE.
LINEAR PROGRAMMING. Linear Programming Linear programming is a mathematical technique. This technique is applied for choosing the best alternative from.
MATH Section 4.4.
Sushila Devi Mosese A Successful Entrepreneur and a Humanitarian.
 This will explain how consumers allocate their income over many goods.  This looks at individual’s decision making when faced with limited income and.
The analytics of constrained optimal decisions microeco nomics spring 2016 the monopoly model (I): standard pricing ………….1optimal production ………….2 optimal.
Copyright © 2015, 2010, and 2007 Pearson Education, Inc. 1 Chapter 7 Data, Graphs, and Statistics.
The analytics of constrained optimal decisions microeco nomics spring 2016 dynamic pricing (III) ………….1uber as a platform ………….7 digital markets session.
Sampling Distributions
Chapter 5 Linear Inequalities and Linear Programming
Linear programming.
College Accounting, 22nd Edition
Final Grade Averages Weighted Averages.
Estimating p in the Binomial Distribution
السيولة والربحية أدوات الرقابة المالية الوظيفة المالية
Dynamic Programming Solutions 1
Chapter 10 Solutions 1 Soln:
Dynamic Programming Solutions 1
Estimating p in the Binomial Distribution
Dynamic Programming Solutions 1
Presentation transcript:

Chapter 10 Solutions 1 Soln: 10.3.1) The owner of a chain of three grocery stores has purchased 5 crates of fresh strawberries. The estimated probability distribution of potential sales of the strawberries before spoilage differs among the three stores. Therefore, the owner wants to know how to allocate 5 crates to the three stores to maximize expected profit. For administrative reasons, the owner does not wish to split crates between stores. However, he is willing to distribute no crates to any of his stores. The following table gives estimated expected profit at each store when it is allocated various numbers of crates. Soln: Let xn = number crates allocated to a store pn(xn) = expected profit from allocating xn crates to store n sn = number of crates remaining fn(sn) = max { pn(xn) + fn+1*(sn-xn) }

Chapter 10 Solutions 1 10.3.1) Soln: Let xn = number crates allocated to a store pn(xn) = expected profit from allocating xn crates to store n sn = number of crates remaining fn(sn) = max { pn(xn) + fn+1*(sn-xn) } 5 4 3 2 1 Store 1 Store 2 Store 3

Chapter 10 Solutions 1 10.3.1) Soln: Let xn = number crates allocated to a store pn(xn) = expected profit from allocating xn crates to store n sn = number of crates remaining fn(sn) = max { pn(xn) + fn+1*(sn-xn) } Store 1 Store 2 Store 3 5 5 4 3 2 1 5 4 3 2 1

Chapter 10 Solutions 1 10.3.1) Soln: Let xn = number crates allocated to a store pn(xn) = expected profit from allocating xn crates to store n sn = number of crates remaining fn(sn) = max { pn(xn) + fn+1*(sn-xn) } Store 1 Store 2 Store 3 5 5 4 3 2 1 5 4 3 2 1

Chapter 10 Solutions 1 10.3.1) Store 1 Store 2 Store 3 5 5 4 3 2 1 5 4 5 4 3 2 1

Chapter 10 Solutions 1 10.3.1) 5 4 3 2 1 Store 1 Store 2 Store 3 Store 1 Store 2 Store 3 Optimal Allocation Store 1 Store 2 Store 3 5 5 4 3 2 1 5 4 3 2 1 Optimal path Optimal path from a given state

Chapter 10 Solutions 1 Soln: 10.3.2) A college student has 7 days remaining before final examinations begin in her four courses and she wants to allocate this study time as effectively as possible. She needs at least 1 day on each course, and she likes to concentrate on just one course each day, so she wants to allocate 1, 2, 3, or 4 days to each course. Having recently taken an O.R. course, she decides to use dynamic programming to make the allocations so as to maximize the total grade points. Soln: Let xn = number days allocated to a course pn(xn) = grade points earned from allocating xn days to course n sn = number of days remaining fn(sn) = max { pn(xn) + fn+1*(sn-xn) } Course 1 Course 2 Course 3 7 6 5 5 4 4 3 3 2

Chapter 10 Solutions 1 10.3.2) Soln: Let xn = number days allocated to a course pn(xn) = grade points earned from allocating xn days to course n sn = number of days remaining fn(sn) = max { pn(xn) + fn+1*(sn-xn) } Course 1 Course 2 Course 3 Course 4 7 6 5 5 4 4 4 3 3 3 2 2 1

Chapter 10 Solutions 1 10.3.2) Soln: Let xn = number days allocated to a course pn(xn) = grade points earned from allocating xn days to course n sn = number of days remaining fn(sn) = max { pn(xn) + fn+1*(sn-xn) } Course 1 Course 2 Course 3 Course 4 7 6 5 5 4 4 4 3 3 3 2 2 1

Chapter 10 Solutions 1 10.3.2) Soln: Let xn = number days allocated to a course pn(xn) = grade points earned from allocating xn days to course n sn = number of days remaining fn(sn) = max { pn(xn) + fn+1*(sn-xn) } Course 1 Course 2 Course 3 Course 4 7 6 5 5 4 4 4 3 3 3 2 2 1

Chapter 10 Solutions 1 10.3.2) Soln: Let xn = number days allocated to a course pn(xn) = grade points earned from allocating xn days to course n sn = number of days remaining fn(sn) = max { pn(xn) + fn+1*(sn-xn) } Course 1 Course 2 Course 3 Course 4 7 6 5 5 4 4 4 3 3 3 2 2 1

Chapter 10 Solutions 1 Soln: 10.3.7) Consider an electronic system consisting of four components, each of which must work for the system to function. The reliability of the system can be improved by installing several parallel units in one or more components. The following table gives the probability that the respective components will function if they consist of one, two, or three parallel units: The probability that the system will function is the product of the probabilities that the respective components will function. The cost (in $100’s) of installing 1, 2, or 3 parallel units in the respective components is given by the following table: (total budget = $1,000). Soln: Let xn = number parallel units for component n pn(xn) = probability component will function with xn parallel units cn(xn) = cost of installing xn units sn = number of $ in 100’s remaining fn(sn) = max { pn(xn) * fn+1*(sn-cn(xn) }

Chapter 10 Solutions 1 10.3.7) Soln: Let xn = number parallel units for component n pn(xn) = probability component will function with xn parallel units cn(xn) = cost of installing xn units sn = number of $ in 100’s remaining fn(sn) = max { pn(xn) * fn+1*(sn-cn(xn) }

Chapter 10 Solutions 1 10.3.7) Soln:

Chapter 10 Solutions 1 10.3.7) Soln:

Chapter 10 Solutions 1 10.3.7) Soln: