1. Trang chủ
  2. » Luận Văn - Báo Cáo

Lecture Introduction to Management Science with Spreadsheets: Chapter 12 - Stevenson, Ozgur

37 21 0

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

THÔNG TIN TÀI LIỆU

Thông tin cơ bản

Định dạng
Số trang 37
Dung lượng 900,05 KB

Các công cụ chuyển đổi và chỉnh sửa cho tài liệu này

Nội dung

Chapter 12 Decision theory, after completing this chapter, you should be able to: Outline the characteristics of a decision theory approach to decision making; describe and give examples of decisions under certainty, risk, and complete uncertainty; make decisions using maximin, maximax, minimax regret, Hurwicz, equally likely, and expected value criteria and use Excel to solve problems involving these techniques;...

Trang 1

Stevenson and Ozgur

First Edition

Introduction to Management Science

Trang 2

Companies. All rights reserved.   McGraw­Hill/Irwin  12–2

Learning Objectives

1 Give examples of systems that may lend

themselves to be analyzed by a Markov model

2 Explain the meaning of transition probabilities

3 Describe the kinds of system behaviors that Markov

analysis pertains to

4 Use a tree diagram to analyze system behavior

5 Use matrix multiplication to analyze system

Trang 3

Companies. All rights reserved.   McGraw­Hill/Irwin  12–3

Learning Objectives (cont’d)

7 Analyze absorbing states, namely accounts

receivable, using a Markov model

8 List the assumptions of a Markov model

9 Use Excel to solve various problems pertaining to a

Markov model

After completing this chapter, you should be able to:

Trang 4

Companies. All rights reserved.   McGraw­Hill/Irwin  12–4

Characteristics of a Markov System Characteristics of a Markov System

1 It will operate or exist for a number of periods

2 In each period, the system can assume one of a

number of states or conditions

3 The states are both mutually exclusive and collectively exhaustive

4 System changes between states from period to period can be described by transition probabilities, which

Trang 5

Companies. All rights reserved.   McGraw­Hill/Irwin  12–5

Markov Analysis: Assumptions

Markov Analysis: Assumptions

• Markov Analysis Assumptions

–The probability that an item in the system either will change from one state (e.g., Airport A) to another or remain in its current state is a function of the transition probabilities only

–The transition probabilities remain constant

–The system is a closed one; there will be no arrivals to the system or exits from the system

Trang 6

Companies. All rights reserved.   McGraw­Hill/Irwin  12–6

Trang 7

Companies. All rights reserved.   McGraw­Hill/Irwin  12–7

Trang 8

by the system’s transition probabilities.

• Short-term behavior is solely dependent on the

system’s state in the current period and the

transition probabilities.

• The long-run proportions are referred to as the

steady-state proportions, or probabilities, of the

system.

Trang 9

Companies. All rights reserved.   McGraw­Hill/Irwin  12–9

Trang 10

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–10

Methods of System Behavior Analysis

Methods of System Behavior Analysis

• Tree Diagram

– A visual portrayal of a system’s transitions composed of a series

of branches, which represent the possible choices at each stage (period) and the conditional probabilities of each choice being selected.

• Matrix Multiplication

– Assumes that “current” state proportions are equal to the product

of the proportions in the preceding period multiplied by the matrix

of transition probabilities.

– Involves the multiplication of the “current” proportions, which is referred to as a probability vector, by the transition matrix.

Trang 11

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–11

Methods of System Behavior Analysis

(cont’d)

Methods of System Behavior Analysis

(cont’d)

• Algebraic Solution

–The basis for an algebraic solution is a set of

equations developed from the transition matrix

–Because the states are mutually exclusive and

collectively exhaustive, the sum of the state

probabilities must be 1.00, and another equation can

be developedf rom this requirement

–The result is a set of equations that can be used to solve for the steady-state probabilities

Trang 12

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–12

Trang 13

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–13

Trang 14

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–14

Steady-State Proportions Based on Matrix Multiplications

Steady-State Proportions Based on Matrix Multiplications

Trang 15

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–15

Trang 16

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–16

Trang 17

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–17

Maintenance Problem

Maintenance Problem

Trang 18

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–18

Problem: Initial State = Operation

Problem: Initial State = Operation

Trang 19

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–19

Problem Initial State = Broken

Problem Initial State = Broken

Trang 20

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–20

Maintenance Problem

Maintenance Problem

Trang 21

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–21

Trang 22

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–22

(Initial State = X)

(Initial State = X)

Trang 23

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–23

(Initial State =Y)

(Initial State =Y)

Trang 24

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–24

Problem

Problem

Trang 25

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–25

University Problem

University Problem

Trang 26

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–26

Probabilities of the Acorn University Problem

Probabilities of the Acorn University Problem

Trang 27

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–27

Problem

Problem

Trang 28

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–28

Cyclical, Transient, and Absorbing Systems

Cyclical, Transient, and Absorbing Systems

• Cyclical system

–A system that has a tendency to move from state to state in a definite pattern or cycle

• Transient system

–A system in which there is at least one state—the

transient state—where once a system leaves it, the

system will never return to it

• Absorbing system

–A system that gravitates to one or more states—once

a member of a system enters an absorbing state, it

becomes trapped and can never exit that state

Trang 29

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–29

Trang 30

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–30

Given in Tables 12-6, 12-7, and 12-8

Given in Tables 12-6, 12-7, and 12-8

Trang 31

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–31

Absorbing State Problem

Absorbing State Problem

Trang 32

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–32

Trang 33

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–33

Trang 34

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–34

Calculations for Solved Problem 4

Calculations for Solved Problem 4

Trang 35

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–35

Problem 5

Problem 5

Trang 36

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–36

Calculations for Solved Problem 5

Calculations for Solved Problem 5

Trang 37

Companies. All rights reserved.  

McGraw­

Hill/Irwin  12–37

—Absorbing State Problem

—Absorbing State Problem

Ngày đăng: 14/10/2020, 14:16

TỪ KHÓA LIÊN QUAN

TÀI LIỆU CÙNG NGƯỜI DÙNG

TÀI LIỆU LIÊN QUAN