MGMT 650 – Management Science and Decision Analysis



MGMT 650 – Management Science and Decision Analysis

Final Preparation Guide

1. Key concepts of chapter 3

a. Sensitivity Analysis; Interpreting Management Scientist output reports

i. Range of optimality

ii. 100% rule

iii. Range of feasibility

iv. Dual price – what it means? How it can be used?

2. Key concepts of chapter 7

a. Transshipment problem and its Linear Programming formulation

3. Key concepts of chapter 8

a. Formulation of integer programs

b. Multiple choice constraints

c. K out of N alternatives constraints

d. Conditional and co-requisite constraints

4. Key concepts of chapter 9

a. Understanding of the shortest route problem

i. How can it be used for optimizing replacement policies (in-class example) and scheduling purposes (HW #5 problem)

5. Key concepts of chapter 10

a. Understanding of activity slacks, critical activities, critical path, how much activities can be delayed?

b. How is slack calculated?

c. Ability to interpret to Management Scientist outputs for project networks

d. Ability to set up project network diagrams with precedence relationships between activities

6. Key concepts of chapter 11

a. Understanding of the EOQ model

i. What dies the EOQ signify?

ii. What are holding, ordering cost? And their formulas.

iii. Total cost formula

iv. Cycle time, number of orders per year, etc.

v. Ability to interpret to Management Scientist outputs

7. Key concepts of chapter 16

a. Moving averages, Exponential smoothing – how do they work?

b. Trend analysis and use of the linear trend equation

c. Interpretation of seasonal indices

d. Ability to interpret to Management Scientist outputs

e. Ability to recognize different types of time series data

Please review all HW questions and solutions carefully.

Please make sure that you understand various Management Scientist outputs.

Sample Questions

1. (Chapter 3 – Sensitivity Analysis) Use the following Management Scientist output to answer the questions.

LINEAR PROGRAMMING PROBLEM

MAX 31X1+35X2+32X3

S.T.

1) 3X1+5X2+2X3>90

2) 6X1+7X2+8X3 ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download