Why Models? State of world: Data (not information!) overload Reliance on computers Allocation of responsibility (must justify decisions) Decisions and.

Slides:



Advertisements
Similar presentations
Linear Programming Problem
Advertisements

Decision Making and Relevant Information
Session 3a Decision Models -- Prof. Juran.
Chapter 7 Introduction to Linear Programming. Linear? To get a feel for what linear means let’s think about a simple example. You have $10 to spend and.
Relevant Costs and Benefits
MANAGEMENT SCIENCE 461 Lecture 1a – Introduction September 9, 2008.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Integer Programming.
Systems Thinking and the Theory of Constraints Any intelligent fool can make things bigger, more complex, and more violent. It takes a touch of genius.
1 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Practice; Follow the 5 Steps Process Purchased Part $5 / unit RM1 $20 per unit RM2 $20 per.
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
13 Relevant Costs for Decision Making Chapter Future revenues or costs that differ among alternatives. Is the cost of equipment purchased in the past relevant?
1 Lecture 2 & 3 Linear Programming and Transportation Problem.
Systems Thinking and the Theory of Constraints Any intelligent fool can make things bigger, more complex, and more violent. It takes a touch of genius.
Further short-term decisions
1 Ardavan Asef-Vaziri Nov-2010Theory of Constraints 1- Basics Purchased Part $5 / unit RM1 $20 per unit RM2 $20 per unit RM3 $25 per unit $90 / unit 110.
Chapter 30: The Labor Market Copyright © 2013 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 13e.
Operations Scheduling. Scheduling in a Process-Focused Environment.
Costs & Break-Even GCSE Business Studies tutor2u™
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Resource Allocation Decisions Managerial Accounting Prepared by Diane Tanner University of North Florida Chapter 9.
Jon Curwin and Roger Slater, QUANTITATIVE METHODS: A SHORT COURSE ISBN © Cengage Chapter 3: Using Graphs.
McGraw-Hill/Irwin © 2005 The McGraw-Hill Companies, Inc., All Rights Reserved. Supply Decisions.
© Wallace J. Hopp, Mark L. Spearman, 1996, Factory Physics? Perfection of means and confusion of goals seem to characterize.
Eco 6351 Economics for Managers Chapter 5. Supply Decisions
PowerPoint Authors: Susan Coomer Galbreath, Ph.D., CPA Charles W. Caldwell, D.B.A., CMA Jon A. Booker, Ph.D., CPA, CIA Cynthia J. Rooney, Ph.D., CPA Copyright.
1/20 Operations Management Break-Even Analysis - Lecture 4.2 Dr. Ursula G. Kraus.
Optimization Models Mathematical optimization models usually contain an objective (what to do) constraints (the rules that must be followed). Also referred.
Introduction to Theory of Constraints
Chapter 26 Part 1.
Chapter 12. Cost Concepts for Decision Making A relevant cost is a cost that differs between alternatives. 1 2.
Linear Programming: Basic Concepts
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
UNIT 4 COST VOLUME PROFIT CONCEPTS AC330. Exercise 5-1 Let’s a take a minute to read Exercise 5-1 in the textbook. We will then review the solution.
The McGraw-Hill Companies, Inc. 2006McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
5.2 Costs and Revenues Chapter 31. Management Decisions and Cost Business decisions cannot be made without cost information. Why?  Profit or loss cannot.
Giapetto's Woodcarving: The LP Model
Costs. Introducing the topic Cutting costs to increase profits. Page 507 Answer all questions.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
Lesson Objectives: By the end of this lesson you will be able to: *Explain how firms decide how much labor to hire in order to produce a certain level.
Sensitivity Analysis Consider the CrossChek hockey stick production problem: Management believes that CrossChek might only receive $120 profit from the.
The Greedy Method. The Greedy Method Technique The greedy method is a general algorithm design paradigm, built on the following elements: configurations:
The Theory of Constraints
© 2015 McGraw-Hill Education. All rights reserved. Chapter 19 Markov Decision Processes.
Breakeven Analysis Improving Productivity. Break-Even Analysis Break-even analysis has TWO forms: – A. CVP (cost-volume-profit): to determine the volume.
Board Activity Make a list of at least five products that students and/or faculty in your school would want to buy at your school site and use daily or.
Faisal Acc 301 (Chapter 21)
Do Now 1)What is the difference between supply and quantity supplied? 2)Are hotel rooms elastic or inelastic? Why? 3)What do producers have to consider.
© 2012 Pearson Prentice Hall. All rights reserved. Using Costs in Decision Making Chapter 3.
OPSM 301 Operations Management Class 13&14: Linear Programming using Excel Koç University Zeynep Aksin
OPSM 301 Operations Management Class 11: Linear Programming using Excel Koç University Zeynep Aksin
Perfect Competition. Objectives After studying this chapter, you will able to  Define perfect competition  Explain how price and output are determined.
ACCT 2302 Fundamentals of Accounting II Spring 2011 Lecture 18 Professor Jeff Yu.
1 Geometrical solution of Linear Programming Model.
The analytics of constrained optimal decisions microeco nomics spring 2016 the monopoly model (I): standard pricing ………….1optimal production ………….2 optimal.
AAT Level 3 Limiting Factors. Objectives 1. Explain what production decisions are required when resources are scarce 2. State the steps to calculate limiting.
Department of Applied Economics and Management Cornell University Ithaca, NY Dr. Wen-fei Uva Senior Extension Associate What is Your Profitability?
Data Driven Resource Allocation for Distributed Learning
Strategic Capacity Management
Relevant Costs for Decision Making
Short-run Production Function
The Theory of Constraints
The use of linear programming for the allocation of scarce resources
Cost Concepts and Design Economics
The Goal.
Production and Costs Standard12.2.1: Understand the relationship of the concept of incentives to the law of supply and the relationship of the concept.
Chapter 17 Inventory Control.
Cost Accounting for Decision-making
Cost Accounting for Decision-making
Linear Programming.
Presentation transcript:

Why Models? State of world: Data (not information!) overload Reliance on computers Allocation of responsibility (must justify decisions) Decisions and numbers: Decisions are numbers –How many distribution centers do we need? –Capacity of new plant? –No. workers assigned to line? Decisions depend on numbers –Whether to introduce new product? –Make or buy? –Replace MRP with Kanban?

Why Models? (cont.) Data + Model = Information: Managers who don't understand models either: Abhor analysis, lose valuable information, or Put too much trust in analysis, are swayed by stacks of computer output

Goldratt Product Mix Problem Machines A,B,C,D Machines run 2400 min/week fixed expenses of $5000/week PQ

Modeling Goldratt Problem Formulation: Solution Approach: 1. Choose (feasible) production quantity of P (X p ) or Q (X q ). 2. Use remaining capacity to make other product. X p = weekly production of P, X q = weekly production of Q Weekly Profit Time on Machine A Time on Machine B Time on Machine C Time on Machine D Max Sales of P Max Sales of Q

Unit Profit Approach Make as much Q as possible because it is highest priced: 5 A B C,D A B

Bottleneck Ratio Approach Consider bottleneck: If we set X p =100, X q =50, we violate capacity constraint Profit/Unit of Bottleneck Resource ($/minute): X p : 45/15 = 3 X q : 60/30 = 2 so make as much P as possible (i.e., set X p =100, since this does not violate any of the capacity constraints): A B C D

Bottleneck Ratio Approach (cont.) Outcome: This turns out to be the best we can do. But will this approach always work? A B C,D

Modified Goldratt Problem Machines A,B,C,D Machines run 2400 min/week fixed expenses of $5000/week PQ D C C A B C B B A D $5$ Note: only minor changes to times.

Modeling Modified Goldratt Problem Formulation: Solution Approach: bottleneck method. Weekly Profit Time on Machine A Time on Machine B Time on Machine C Time on Machine D Max Sales of P Max Sales of Q

Bottleneck Solution Find Bottleneck: Note: Both B and D are bottlenecks! (Does this seem unrealistic in a world where line balancing is a way of life?) A B C D

Possible Solutions Make as much P as possible: A B C D

Possible Solutions (cont.) Make as much Q as possible: so make X q = 50 (can’t sell more than this) A B C D

Another Solution Make X p =73, X q =37: (Where in the heck did these come from? A model!) Conclusions: Modeling matters! Beware of simplistic solutions to complex problems! A B C D