The document discusses decision theory and decision-making under uncertainty. It defines key concepts in decision theory including decision maker, courses of action, states of nature, payoff, and expected monetary value. It describes three types of decision-making environments: certainty, risk, and uncertainty. Under risk, decisions are made using probability assessments and expected monetary value calculations. Several steps and concepts in decision making under risk are outlined, including constructing payoff matrices, calculating expected values, and opportunity loss analysis.
This document discusses assignment problems and how to solve them using the Hungarian method. Assignment problems involve efficiently allocating people to tasks when each person has varying abilities. The Hungarian method is an algorithm that can find the optimal solution to an assignment problem in polynomial time. It involves constructing a cost matrix and then subtracting elements in rows and columns to create zeros, which indicate assignments. The method is iterated until all tasks are assigned with the minimum total cost. While typically used for minimization, the method can also solve maximization problems by converting the cost matrix.
A Monte Carlo simulation involves modeling a system with random variables to estimate outcomes. It repeats calculations using randomly generated values for the variables and averages the results. The document discusses using Monte Carlo simulations to model demand in business situations with uncertain variables. Examples show generating random numbers to simulate daily product demand over multiple days and calculating the average demand from the results.
1) The document discusses the Hungarian method for solving assignment problems. It involves minimizing the total cost or maximizing the total profit of assigning resources like employees or machines to activities like jobs.
2) The method includes steps like developing a cost matrix, finding the opportunity cost table, making assignments to zeros in the table, and revising the table until an optimal solution is reached.
3) There are examples showing the application of these steps to problems with unique and multiple optimal solutions, as well as an unbalanced problem with more resources than activities.
The document discusses decision theory and decision trees. It introduces decision making under certainty, risk, and uncertainty. It defines elements related to decisions like goals, courses of action, states of nature, and payoffs. It also discusses concepts like expected monetary value, expected profit with perfect information, expected value of perfect information, and expected opportunity loss. Examples are provided to demonstrate calculating these metrics. Finally, it provides an overview of how to construct a decision tree, including defining the different node types and how to calculate values within the tree.
Assignment Chapter - Q & A Compilation by Niraj ThapaCA Niraj Thapa
My name is Niraj Thapa. I have compiled Assignment Chapter including SM, PM & Exam Questions of AMA.
You feedback on this will be valuable inputs for me to proceed further.
Solving Degenaracy in Transportation Problemmkmanik
- The document discusses solving degeneracy in transportation problems using the example of a transportation problem with 4 sources and 5 destinations.
- An initial basic feasible solution is found using the least cost method, but it results in a degenerate solution since the number of allocated cells is less than m + n - 1.
- To solve the degeneracy, an unallocated cell is selected and allocated a value to satisfy the condition. Here, an unallocated cell value of 5 is selected and assigned the value ε.
- The solution is then optimized using the U-V method by calculating Uj + Vi = Cij for allocated cells and penalties Pij for unallocated cells until all penalties are less than
The Big-M method is a variation of the simplex method for solving linear programming problems with "greater-than" constraints. It works by introducing artificial variables with a large coefficient M to transform inequality constraints into equality constraints, creating an initial feasible solution. The transformed problem is then solved via simplex elimination to arrive at an optimal solution while eliminating artificial variables. The document provides an example problem demonstrating the step-by-step Big-M method process of setting up and solving a linear program with inequalities.
This document discusses assignment problems and how to solve them using the Hungarian method. Assignment problems involve efficiently allocating people to tasks when each person has varying abilities. The Hungarian method is an algorithm that can find the optimal solution to an assignment problem in polynomial time. It involves constructing a cost matrix and then subtracting elements in rows and columns to create zeros, which indicate assignments. The method is iterated until all tasks are assigned with the minimum total cost. While typically used for minimization, the method can also solve maximization problems by converting the cost matrix.
A Monte Carlo simulation involves modeling a system with random variables to estimate outcomes. It repeats calculations using randomly generated values for the variables and averages the results. The document discusses using Monte Carlo simulations to model demand in business situations with uncertain variables. Examples show generating random numbers to simulate daily product demand over multiple days and calculating the average demand from the results.
1) The document discusses the Hungarian method for solving assignment problems. It involves minimizing the total cost or maximizing the total profit of assigning resources like employees or machines to activities like jobs.
2) The method includes steps like developing a cost matrix, finding the opportunity cost table, making assignments to zeros in the table, and revising the table until an optimal solution is reached.
3) There are examples showing the application of these steps to problems with unique and multiple optimal solutions, as well as an unbalanced problem with more resources than activities.
The document discusses decision theory and decision trees. It introduces decision making under certainty, risk, and uncertainty. It defines elements related to decisions like goals, courses of action, states of nature, and payoffs. It also discusses concepts like expected monetary value, expected profit with perfect information, expected value of perfect information, and expected opportunity loss. Examples are provided to demonstrate calculating these metrics. Finally, it provides an overview of how to construct a decision tree, including defining the different node types and how to calculate values within the tree.
Assignment Chapter - Q & A Compilation by Niraj ThapaCA Niraj Thapa
My name is Niraj Thapa. I have compiled Assignment Chapter including SM, PM & Exam Questions of AMA.
You feedback on this will be valuable inputs for me to proceed further.
Solving Degenaracy in Transportation Problemmkmanik
- The document discusses solving degeneracy in transportation problems using the example of a transportation problem with 4 sources and 5 destinations.
- An initial basic feasible solution is found using the least cost method, but it results in a degenerate solution since the number of allocated cells is less than m + n - 1.
- To solve the degeneracy, an unallocated cell is selected and allocated a value to satisfy the condition. Here, an unallocated cell value of 5 is selected and assigned the value ε.
- The solution is then optimized using the U-V method by calculating Uj + Vi = Cij for allocated cells and penalties Pij for unallocated cells until all penalties are less than
The Big-M method is a variation of the simplex method for solving linear programming problems with "greater-than" constraints. It works by introducing artificial variables with a large coefficient M to transform inequality constraints into equality constraints, creating an initial feasible solution. The transformed problem is then solved via simplex elimination to arrive at an optimal solution while eliminating artificial variables. The document provides an example problem demonstrating the step-by-step Big-M method process of setting up and solving a linear program with inequalities.
The document discusses facility location and the process of selecting the best geographic location. It outlines key objectives like reducing costs and coordinating with government policies. The main steps discussed are selecting between domestic or international locations, then choosing a region, locality, and exact site based on factors like resources, market access, transportation and climate. Location analysis techniques covered include location factor rating, center of gravity, load distance, break even analysis, and weighted factor rating. The overall goal is to identify the optimal location for operating facilities.
Sequencing problems in Operations ResearchAbu Bashar
The document discusses sequencing problems and various sequencing rules used to optimize outputs when assigning jobs to machines. It describes Johnson's rule for minimizing completion time when scheduling jobs on two workstations. Johnson's rule involves scheduling the job with the shortest processing time first at the workstation where it finishes earliest. It provides an example of applying Johnson's rule to schedule five motor repair jobs at the Morris Machine Company across two workstations. Finally, it discusses Johnson's three machine rule for sequencing jobs across three machines.
Linear programming - Model formulation, Graphical MethodJoseph Konnully
The document discusses linear programming, including an overview of the topic, model formulation, graphical solutions, and irregular problem types. It provides examples to demonstrate how to set up linear programming models for maximization and minimization problems, interpret feasible and optimal solution regions graphically, and address multiple optimal solutions, infeasible solutions, and unbounded solutions. The examples aid in understanding the key steps and components of linear programming models.
The document discusses linear programming problems and how to formulate them. It provides definitions of key terms like linear, programming, objective function, decision variables, and constraints. It then explains the steps to formulate a linear programming problem, including defining the objective, decision variables, mathematical objective function, and constraints. Several examples of formulated linear programming problems are provided to maximize profit or minimize costs subject to various constraints.
The transportation problem is a special type of linear programming problem where the objective is to minimize the cost of distributing a product from a number of sources or origins to a number of destinations.
Because of its special structure, the usual simplex method is not suitable for solving transportation problems. These problems require a special method of solution.
Transportation Problem in Operational ResearchNeha Sharma
The document discusses the transportation problem and methods for finding its optimal solution. It begins by defining key terminology used in transportation models like feasible solution, basic feasible solution, and optimal solution. It then outlines the basic steps to obtain an initial basic feasible solution and subsequently improve it to reach the optimal solution. Three common methods for obtaining the initial solution are described: the Northwest Corner Method, Least Cost Entry Method, and Vogel's Approximation Method. The document also addresses how to solve unbalanced transportation problems and provides examples applying the methods.
Linear programming is a mathematical optimization technique used to maximize or minimize an objective function subject to constraints. It involves decision variables, an objective function that is a linear combination of the variables, and linear constraints. The key assumptions of linear programming are certainty, divisibility, additivity, and linearity. It allows improving decision quality through cost-benefit analysis and considers multiple possible solutions. However, it has disadvantages like fractional solutions, complex modeling, and inability to directly address time effects.
GAME THEORY
Terminology
Example : Game with Saddle point
Dominance Rules: (Theory-Example)
Arithmetic method – Example
Algebraic method - Example
Matrix method - Example
Graphical method - Example
The document provides an introduction to queuing theory, which deals with problems involving waiting in lines or queues. It discusses key concepts such as arrival and service rates, expected queue length and wait times, and the utilization ratio. Common applications of queuing theory include determining the number of servers needed at facilities like banks, restaurants, and hospitals to minimize customer wait times. The summary provides the essential information about queuing theory and its use in analyzing waiting line systems.
The document discusses replacement theory, which determines the optimal time to replace equipment or machines that deteriorate over time. It increases maintenance costs as equipment ages. The document provides examples of industries that use replacement theory and outlines the methodology. It presents a sample replacement problem looking at the purchase price, annual running costs, and resale values to determine the year when replacement is most economical based on minimum average total cost. The optimal replacement period is calculated based on rules comparing maintenance costs to average costs or scrap value.
Mba i qt unit-1.3_linear programming in omRai University
Linear programming is a technique used by operations managers to allocate scarce resources. It involves defining objectives, constraints, and decision variables to determine the optimal solution. Some common applications in operations management include determining optimal product mix, production levels, ingredient mix, transportation routes, and staff assignments. The steps to formulate a linear programming problem are to define the objective, decision variables, mathematical objective function, constraints, and write the linear program in final form. The optimal solution can be found graphically by plotting the constraints and objective function on a graph to identify the feasible region and optimal point.
This document provides an introduction and overview of integer programming problems. It discusses different types of integer programming problems including pure integer, mixed integer, and 0-1 integer problems. It provides examples to illustrate how to formulate integer programming problems as mathematical models. The document also discusses common solution methods for integer programming problems, including the cutting-plane method. An example of the cutting-plane method is provided to demonstrate how it works to find an optimal integer solution.
Queueing theory studies waiting line systems where customers arrive for service but servers have limited capacity. This document outlines components of queueing models including: arrival processes, queue configurations, service disciplines, service facilities, and analytical solutions. Key points are that customers wait in queues when demand exceeds server capacity, and queueing formulas provide expected wait times and number of customers in the system based on arrival and service rates.
This presentation is trying to explain the Linear Programming in operations research. There is a software called "Gipels" available on the internet which easily solves the LPP Problems along with the transportation problems. This presentation is co-developed with Sankeerth P & Aakansha Bajpai.
By:-
Aniruddh Tiwari
Linkedin :- http://in.linkedin.com/in/aniruddhtiwari
The document describes an assembly line balancing problem to minimize balance delay. It provides the tasks, precedence relationships, task times, required cycle time of 15 minutes, and the primary rule used to assign tasks to stations (largest number of following tasks). It then shows the 6 workstations determined, tasks assigned at each station according to the rule, remaining unassigned time (balance delay) at each station, and the overall efficiency of 77.78%.
This document provides an overview of game theory concepts. It defines game theory as analyzing situations of conflict and competition involving decision making by two or more participants. Some key points:
- Game theory was developed in the 20th century, with a seminal 1944 book discussing its application to business strategy.
- Basic concepts include players, pure and mixed strategies, zero-sum vs. non-zero-sum games, and payoff matrices to represent outcomes.
- Solutions include finding equilibrium points using minimax and maximin principles for pure strategies or solving systems of equations for mixed strategies when no equilibrium exists.
- Dominance rules can reduce game matrices, and graphical or algebraic methods solve for mixed strategies without saddles
This document provides an overview of queuing theory and waiting line models. It discusses key concepts such as:
- Queuing situations like petrol pumps, hospitals, and airports where waiting lines commonly occur
- Components of a queuing system including the calling population, queuing process, and service process
- Performance measures of queuing systems such as average queue length and waiting times
- The M/M/1 queuing model where arrivals and services times follow Poisson and exponential distributions respectively
- Examples of calculating performance measures for single server queuing models based on given arrival and service rates.
The document describes a transportation problem and its solution. A transportation problem aims to minimize the cost of distributing goods from multiple sources to multiple destinations, given supply and demand constraints. It describes the basic components and phases of solving a transportation problem, including obtaining an initial feasible solution and then optimizing the solution using methods like the stepping stone method. The stepping stone method traces paths between cells on the transportation table to find negative cost cycles, and adjusts values to further optimize the solution.
This document discusses key concepts in decision theory and decision making under uncertainty. It begins by defining decision theory and describing the degree of certainty in decision making problems. It then outlines elements of decision analysis like states of nature, chance occurrences governed by probabilities, and payoff matrices. An example involving production decisions for a dairy product is provided. The document also discusses criteria for decision making under uncertainty like Laplace, maximin, maximax, Hurwicz, and regret. It concludes by covering expected monetary value, expected opportunity loss, expected value of perfect information, and decision trees as approaches to decision making under risk.
The document discusses facility location and the process of selecting the best geographic location. It outlines key objectives like reducing costs and coordinating with government policies. The main steps discussed are selecting between domestic or international locations, then choosing a region, locality, and exact site based on factors like resources, market access, transportation and climate. Location analysis techniques covered include location factor rating, center of gravity, load distance, break even analysis, and weighted factor rating. The overall goal is to identify the optimal location for operating facilities.
Sequencing problems in Operations ResearchAbu Bashar
The document discusses sequencing problems and various sequencing rules used to optimize outputs when assigning jobs to machines. It describes Johnson's rule for minimizing completion time when scheduling jobs on two workstations. Johnson's rule involves scheduling the job with the shortest processing time first at the workstation where it finishes earliest. It provides an example of applying Johnson's rule to schedule five motor repair jobs at the Morris Machine Company across two workstations. Finally, it discusses Johnson's three machine rule for sequencing jobs across three machines.
Linear programming - Model formulation, Graphical MethodJoseph Konnully
The document discusses linear programming, including an overview of the topic, model formulation, graphical solutions, and irregular problem types. It provides examples to demonstrate how to set up linear programming models for maximization and minimization problems, interpret feasible and optimal solution regions graphically, and address multiple optimal solutions, infeasible solutions, and unbounded solutions. The examples aid in understanding the key steps and components of linear programming models.
The document discusses linear programming problems and how to formulate them. It provides definitions of key terms like linear, programming, objective function, decision variables, and constraints. It then explains the steps to formulate a linear programming problem, including defining the objective, decision variables, mathematical objective function, and constraints. Several examples of formulated linear programming problems are provided to maximize profit or minimize costs subject to various constraints.
The transportation problem is a special type of linear programming problem where the objective is to minimize the cost of distributing a product from a number of sources or origins to a number of destinations.
Because of its special structure, the usual simplex method is not suitable for solving transportation problems. These problems require a special method of solution.
Transportation Problem in Operational ResearchNeha Sharma
The document discusses the transportation problem and methods for finding its optimal solution. It begins by defining key terminology used in transportation models like feasible solution, basic feasible solution, and optimal solution. It then outlines the basic steps to obtain an initial basic feasible solution and subsequently improve it to reach the optimal solution. Three common methods for obtaining the initial solution are described: the Northwest Corner Method, Least Cost Entry Method, and Vogel's Approximation Method. The document also addresses how to solve unbalanced transportation problems and provides examples applying the methods.
Linear programming is a mathematical optimization technique used to maximize or minimize an objective function subject to constraints. It involves decision variables, an objective function that is a linear combination of the variables, and linear constraints. The key assumptions of linear programming are certainty, divisibility, additivity, and linearity. It allows improving decision quality through cost-benefit analysis and considers multiple possible solutions. However, it has disadvantages like fractional solutions, complex modeling, and inability to directly address time effects.
GAME THEORY
Terminology
Example : Game with Saddle point
Dominance Rules: (Theory-Example)
Arithmetic method – Example
Algebraic method - Example
Matrix method - Example
Graphical method - Example
The document provides an introduction to queuing theory, which deals with problems involving waiting in lines or queues. It discusses key concepts such as arrival and service rates, expected queue length and wait times, and the utilization ratio. Common applications of queuing theory include determining the number of servers needed at facilities like banks, restaurants, and hospitals to minimize customer wait times. The summary provides the essential information about queuing theory and its use in analyzing waiting line systems.
The document discusses replacement theory, which determines the optimal time to replace equipment or machines that deteriorate over time. It increases maintenance costs as equipment ages. The document provides examples of industries that use replacement theory and outlines the methodology. It presents a sample replacement problem looking at the purchase price, annual running costs, and resale values to determine the year when replacement is most economical based on minimum average total cost. The optimal replacement period is calculated based on rules comparing maintenance costs to average costs or scrap value.
Mba i qt unit-1.3_linear programming in omRai University
Linear programming is a technique used by operations managers to allocate scarce resources. It involves defining objectives, constraints, and decision variables to determine the optimal solution. Some common applications in operations management include determining optimal product mix, production levels, ingredient mix, transportation routes, and staff assignments. The steps to formulate a linear programming problem are to define the objective, decision variables, mathematical objective function, constraints, and write the linear program in final form. The optimal solution can be found graphically by plotting the constraints and objective function on a graph to identify the feasible region and optimal point.
This document provides an introduction and overview of integer programming problems. It discusses different types of integer programming problems including pure integer, mixed integer, and 0-1 integer problems. It provides examples to illustrate how to formulate integer programming problems as mathematical models. The document also discusses common solution methods for integer programming problems, including the cutting-plane method. An example of the cutting-plane method is provided to demonstrate how it works to find an optimal integer solution.
Queueing theory studies waiting line systems where customers arrive for service but servers have limited capacity. This document outlines components of queueing models including: arrival processes, queue configurations, service disciplines, service facilities, and analytical solutions. Key points are that customers wait in queues when demand exceeds server capacity, and queueing formulas provide expected wait times and number of customers in the system based on arrival and service rates.
This presentation is trying to explain the Linear Programming in operations research. There is a software called "Gipels" available on the internet which easily solves the LPP Problems along with the transportation problems. This presentation is co-developed with Sankeerth P & Aakansha Bajpai.
By:-
Aniruddh Tiwari
Linkedin :- http://in.linkedin.com/in/aniruddhtiwari
The document describes an assembly line balancing problem to minimize balance delay. It provides the tasks, precedence relationships, task times, required cycle time of 15 minutes, and the primary rule used to assign tasks to stations (largest number of following tasks). It then shows the 6 workstations determined, tasks assigned at each station according to the rule, remaining unassigned time (balance delay) at each station, and the overall efficiency of 77.78%.
This document provides an overview of game theory concepts. It defines game theory as analyzing situations of conflict and competition involving decision making by two or more participants. Some key points:
- Game theory was developed in the 20th century, with a seminal 1944 book discussing its application to business strategy.
- Basic concepts include players, pure and mixed strategies, zero-sum vs. non-zero-sum games, and payoff matrices to represent outcomes.
- Solutions include finding equilibrium points using minimax and maximin principles for pure strategies or solving systems of equations for mixed strategies when no equilibrium exists.
- Dominance rules can reduce game matrices, and graphical or algebraic methods solve for mixed strategies without saddles
This document provides an overview of queuing theory and waiting line models. It discusses key concepts such as:
- Queuing situations like petrol pumps, hospitals, and airports where waiting lines commonly occur
- Components of a queuing system including the calling population, queuing process, and service process
- Performance measures of queuing systems such as average queue length and waiting times
- The M/M/1 queuing model where arrivals and services times follow Poisson and exponential distributions respectively
- Examples of calculating performance measures for single server queuing models based on given arrival and service rates.
The document describes a transportation problem and its solution. A transportation problem aims to minimize the cost of distributing goods from multiple sources to multiple destinations, given supply and demand constraints. It describes the basic components and phases of solving a transportation problem, including obtaining an initial feasible solution and then optimizing the solution using methods like the stepping stone method. The stepping stone method traces paths between cells on the transportation table to find negative cost cycles, and adjusts values to further optimize the solution.
This document discusses key concepts in decision theory and decision making under uncertainty. It begins by defining decision theory and describing the degree of certainty in decision making problems. It then outlines elements of decision analysis like states of nature, chance occurrences governed by probabilities, and payoff matrices. An example involving production decisions for a dairy product is provided. The document also discusses criteria for decision making under uncertainty like Laplace, maximin, maximax, Hurwicz, and regret. It concludes by covering expected monetary value, expected opportunity loss, expected value of perfect information, and decision trees as approaches to decision making under risk.
UNIT II - DECISION THEORY - QTBD - I MBA - I SEMRamesh Babu
THIS IS MATERIAL FOR DECISION THEORY IN QUANTITATIVE TECHNIQUES FOR DECISION THEORY IN M.B.A I YEAR I SEMESTER AFFILIATED TO JNTUK. I HOPE THIS MATERIAL WILL HELPS THE M.B.A. STUDENTS. REMAINING MATERIAL WILL BE UPDATED COMING SOON......
This document discusses incorporating risk through simulation. It defines key terms like incorporation, risk, and simulation. It provides examples of how simulation can be used to model risk, like predicting salmon population changes or impacts of strategic business plans. The document also presents a problem involving simulating the total profit of a firm with three product lines facing uncertainty. It shows how Monte Carlo simulation can be used to evaluate all outcomes, assign random numbers, run trials, and approximate the true profit distribution.
Fundamental economic concepts used in business decisionsZainul Lamak
This document discusses key economic concepts used in business decision making. It covers opportunity cost, marginal principles, incremental principles, contribution analysis, and the equi-marginal principle. Opportunity cost refers to the next best alternative forgone in making a decision. Marginal principles analyze costs and revenues from producing one additional unit. Incremental principles apply to bulk production changes where total costs and revenues change. Contribution analysis evaluates decisions based on incremental revenues and costs. The equi-marginal principle helps allocate scarce resources efficiently across alternatives. Time perspective, whether short-run or long-run, is also important to consider in business decisions.
The document discusses various concepts related to capacity planning including:
- Capacity is the ability to produce a certain level of output and can be measured in quantity and quality. Supply is the total goods available and demand is the amount consumers will purchase.
- Capacity planning is a long-term strategic decision that establishes a firm's production levels and affects costs, lead times, and competitiveness.
- Capacity can be measured by output or input and planning involves long, medium, and short-range horizons. Determinants of capacity include facilities, product design, processes, human factors and more.
This document provides an overview of managerial economics and key economic concepts for managers. It discusses:
1) The global trend of increasing new businesses starting each year from 2012 to 2022.
2) Key tasks for business managers like allocating resources, determining pricing strategies, and analyzing market trends.
3) Definitions of managerial economics focusing on applying economic theory to managerial decision-making and bridging economic and business practices.
4) Fundamental economic concepts like scarcity of resources, opportunity cost, sunk cost, marginal cost, economies of scale, fixed and variable costs that managers must consider in decision-making.
This document summarizes a presentation on decision theory given by Bhushan Vijay Phirke to the MBA program at Rajarshi Shahu College of Engineering on April 17, 2020. It defines decision theory, outlines the six steps in the decision theory process, and describes key concepts like problem formulation, payoff tables, decision environments, and optimization criteria like optimism, pessimism, and regret. It concludes that decision theory provides a logical framework to help managers determine the most beneficial course of action when facing uncertainty.
Stop Flying Blind! Quantifying Risk with Monte Carlo SimulationSam McAfee
Product development is inherently risky. While lean and agile methods are praised for supporting rapid feedback from customers through experiments and continuous iteration, teams could do a lot better at prioritizing using basic modeling techniques from finance. This talk will focus on quantitative risk modeling when developing new products or services that do not have a well understood product/market fit scenario. Using modeling approaches like Monte Carlo simulations and Cost of Delay scenarios, combined with qualitative tools like the Lean Canvas and Value Dynamics, we will explore how lean innovation teams can bring scientific rigor back into their process.
The document discusses inventory management concepts including economic order quantity (EOQ) models. It defines key inventory costs: ordering/setup costs, holding/carrying costs, shortage costs. The EOQ model balances ordering and carrying costs to determine the optimal order quantity. An example calculates the EOQ, annual carrying cost, ordering cost, and total annual cost for a company with constant demand and known costs and demand values. The optimal order quantity minimizes total annual inventory costs.
The document describes decision analysis and provides examples of how decision trees and tables can be used to capture complex decision-making processes. It discusses five parts of a decision-making model: identify the problem, formulate options, model the problem, analyze the model, and implement and test the solution. Anchoring and framing errors in judgment are explained with examples. Finally, the use of decision trees and tables is demonstrated on examples involving business policies and rules.
The document describes decision analysis and decision making. It discusses identifying the problem, formulating a model, analyzing the model, testing results, and implementing solutions. It also discusses anchoring and framing biases that can influence decisions. Anchoring occurs when a trivial factor serves as a starting point for estimates. Framing affects how alternatives are perceived in terms of wins and losses. The way a problem is framed can influence choices made. Decision trees and tables are described as ways to represent complex decisions and business logic involving multiple conditions. Creating decision models allows for a more rigorous analysis of problems compared to using only narrative descriptions.
The document describes decision analysis and decision making. It discusses identifying the problem, formulating a model, analyzing the model, testing results, and implementing solutions. It also discusses sources of errors like anchoring and framing biases. Anchoring occurs when people rely too heavily on the first piece of information when making decisions. Framing refers to how the options are presented, which can influence choices. The document provides examples to illustrate these concepts and emphasizes the importance of focusing on the consequences of choices rather than how problems are framed.
The document describes decision analysis and decision making. It discusses identifying the problem, formulating a model, analyzing the model, testing results, and implementing solutions. It also discusses anchoring and framing biases that can influence decisions. Anchoring occurs when a trivial factor serves as a starting point for estimates. Framing affects how alternatives are perceived in terms of wins and losses. The way a problem is framed can influence choices. Decision trees and tables are described as ways to represent complex decisions involving multiple conditions. Creating decision models allows for a more rigorous analysis of problems compared to using narratives alone.
The document describes decision analysis and provides examples of how decision trees and tables can be used to analyze complex decisions. It discusses five parts of a decision-making model: identify the problem, formulate options, model the problem, analyze the model, and implement and test the solution. Anchoring and framing errors in judgment are described. Examples are provided to illustrate anchoring biases and how framing a problem as a sure win versus sure loss can influence choices. The use of decision trees to represent sequential decisions and incorporate uncertainty is demonstrated. Creating decision tables to systematically capture complex business rules is also illustrated.
The document describes decision analysis and decision making. It discusses identifying the problem, formulating a model, analyzing the model, testing results, and implementing solutions. It also discusses anchoring and framing biases that can influence decisions. Anchoring occurs when people rely too heavily on an irrelevant starting value. Framing means how a decision is perceived, such as in terms of gains or losses, can influence choices. The document provides an example where how a coin flip problem is framed affects whether people prefer a sure outcome or chance of gain/loss. Effective decision making requires understanding values, objectives, uncertainties, and consequences of options.
The document discusses several economic principles used in managerial decision making:
1) Opportunity cost principle - The cost of any decision is the next best alternative forgone. Managers must consider sacrificed alternatives, not just monetary costs.
2) Incremental principle - Decisions should increase revenues more than costs to be profitable. Incremental analysis examines the changes in costs and revenues of alternatives.
3) Discounting principle - Future cash flows must be discounted to their present value to accurately compare decision alternatives over time, since money has a time value.
Decision theory deals with determining the optimal course of action when alternatives have uncertain consequences. There are several key concepts: decision alternatives are available options; states of nature are uncontrollable events; and payoff is the numerical outcome of alternatives and states. The decision process involves defining the problem, listing states, identifying alternatives, expressing payoffs, and applying a model to select the optimal alternative based on criteria. Decision making can occur under certainty, risk, or uncertainty depending on what is known about states and payoffs. Different techniques are used depending on the environment.
This document discusses decision tables and provides an example. It defines a decision table as a logical structure that considers all possible combinations of conditions and resulting actions. An example decision table is given showing different discount percentages given to orders based on customer type and order size. The document then provides more details on decision tables, including that they have condition and action stubs to specify the conditions being analyzed and actions taken. It outlines the steps for developing decision tables, including identifying essential factors/conditions and possible actions, calculating combinations, and filling in the table while eliminating impossible or consolidated rules.
1) The document discusses tools and techniques for managerial decision making. It explains that decision making is a process that involves multiple steps: establishing objectives, identifying alternatives, evaluating alternatives, selecting the best option, implementing, and monitoring performance.
2) Several economic tools are described that can help managers in decision making, including opportunity cost, incremental principle, time perspective principle, discounting principle, and equi-marginal principle. These tools help managers evaluate costs and revenues of different alternatives.
3) Managerial decision making is influenced not just by economics but also human/behavioral factors, technology, and the external environment. A variety of concepts from economic theory can assist managers in analyzing problems and making informed choices.
The document summarizes the simplex method for solving linear programming problems involving maximization. It involves 12 steps: 1) Formulating the LPP, 2) Introducing slack, surplus and artificial variables, 3) Formulating the initial basic solution, 4) Constructing the initial simplex table, 5) Checking for positive elements in the Cj-Zj row, 6) Identifying the incoming basic variable, 7) Choosing the incoming basic variable if multiple positives exist, 8) Identifying the outgoing basic variable, 9) Constructing the next simplex table using row operations, 10) Completing the new simplex table, 11) Repeating steps 5-10, and 12) Terminating when the
A publisher has contracted an author to produce a textbook. The production process involves the author submitting a manuscript and files, editing, sample page and cover design, artwork, formatting, and printing. The critical path through the network is the author submitting the manuscript, editing, formatting, artwork approval, plate production, and binding, taking 17 weeks total to complete the project.
This flowchart outlines an optimization process to find an optimal solution. It starts with finding an initial basic solution, then checks if that solution is optimal. If it is optimal, that solution is the final answer. If not, the process seeks a better solution to try and find the optimal one.
The document outlines a strategic management model that includes four main stages: strategic intent, formulation, implementation, and evaluation. It involves analyzing internal and external environments to determine a vision, mission, goals and objectives. Strategies are then formulated, implemented through resource allocation and structure, and evaluated for effectiveness with feedback into reformulation.
The document presents a linear programming problem to determine the optimal production mix for two products (P1 and P2) that maximizes profit. The products have different processing times and resource requirements on milling and drilling machines, which have limited weekly hours. The problem is formulated as a linear program to maximize total profit subject to the machine hour constraints. Slack variables are introduced and the problem is solved using the simplex method to find the optimal production levels of 50 units of P1 and 20 units of P2, yielding maximum profit of Rs. 20,500.
This document presents a linear programming problem involving assigning quality inspectors to minimize total inspection costs. There are two types of inspectors (Grade I and Grade II) with different inspection rates and accuracy. The objective is to minimize total costs based on wages, inspection pieces, and error costs with constraints on minimum inspection pieces and available inspectors.
This document formulates a linear programming problem to determine the optimal production quantities of Products P1 and P2 given machine time and contribution margin constraints. Product P1 takes 4 hours on machine M1 and 2 hours on M2, while Product P2 takes 2 hours on M1 and 4 hours on M2. The objective is to maximize total contribution by choosing the quantities x1 and x2 subject to the 60 hours available on M1, 48 hours on M2, and non-negativity constraints.
The document describes a production problem involving two products (P1 and P2) that are manufactured using two machines (M1 and M2). P1 requires 4 hours on M1 and 2 hours on M2, while P2 requires 2 hours on M1 and 4 hours on M2. The goal is to determine the optimal quantities of P1 and P2 to maximize total contribution, given 60 hours available on M1 and 48 hours on M2. This problem is modeled as a linear programming problem and graphically solved by plotting the constraint lines and finding their intersection point.
The document contains information about game theory including pure strategies, mixed strategies, and solving games. It provides examples of games represented as payoff matrices and discusses applying the principles of dominance, algebraic methods for 2x2 games, graphical methods for 2xn and mx2 games, and linear programming for mxn games. It also includes an example analyzing a 6x6 game modeling the Allied invasion of Normandy in WWII.
Four teams will participate in a game involving selecting strategies of A or B. The aim is to score the maximum dividends. Scoring is based on the number of As and Bs selected. The document then explains the Prisoner's Dilemma game theory concept where two prisoners can either cooperate or betray each other, and discusses why rational individuals may not cooperate even if it is in their best interest to do so.
The document discusses how to formulate the dual of a primal linear programming problem. It provides 10 steps for converting a primal maximization problem into a dual minimization problem. As an example, it formulates the dual of the primal problem: Maximize z = -5x1 + 2x2 subject to x1 - x2 ≥ 2 and 2x1 + 3x2 ≤ 5, with non-negativity constraints. The dual is formulated as: Minimize z = -2y1 + 5y2 subject to -y1 + 2y2 ≥ -5 and y1 + 3y2 ≥ 2, with non-negativity constraints on the dual variables y1 and y2.
A finance manager is considering drilling a well on their property. Based on past data, there is a 70% chance of finding water at 20 meters depth, and a 20% chance of finding water between 20-25 meters if no water is found at 20 meters. The costs to drill are Rs.500 per meter plus Rs.15,000 to buy water externally if the well is not drilled. The optimal decision tree strategy is to first drill to 20 meters, and if no water, then drill further to 25 meters, resulting in an expected cost of Rs. 11,350.
The grocer must decide how many cases of milk to stock for tomorrow's demand. Each case sold yields a profit of Rs.3, but unsold cases at the end of the day lose Rs.5. Historical demand data shows the number of cases demanded and the probability of each quantity. The optimal decision can be determined by calculating the expected monetary value (EMV) of stocking different quantities of milk based on the probabilities and outcomes. The expected profit for the grocer if they stock the quantity with the highest EMV is Rs.47.7.
A fast food chain wants to build four new stores and received bids from six construction companies. The document shows the bid amounts in a table and describes using the Hungarian method to determine the optimal assignment of companies to stores that minimizes the total cost. The method involves reducing the table through successive steps to reveal a unique solution with no remaining zeros. The result assigns each store to a single construction company to minimize the total cost for building all four stores.
Operations research (OR) is a tool used to increase the effectiveness of managerial decisions. It can help with profit maximization, production management like determining optimal product mix and scheduling, financial management, marketing management, and personnel management. Some common OR models include linear programming, transportation, assignment, and sequencing problems. OR uses mathematical techniques like linear programming, decision theory, game theory, queuing theory, simulation, network analysis, and inventory models.
12 steps to transform your organization into the agile org you deservePierre E. NEIS
During an organizational transformation, the shift is from the previous state to an improved one. In the realm of agility, I emphasize the significance of identifying polarities. This approach helps establish a clear understanding of your objectives. I have outlined 12 incremental actions to delineate your organizational strategy.
A presentation on mastering key management concepts across projects, products, programs, and portfolios. Whether you're an aspiring manager or looking to enhance your skills, this session will provide you with the knowledge and tools to succeed in various management roles. Learn about the distinct lifecycles, methodologies, and essential skillsets needed to thrive in today's dynamic business environment.
Public Speaking Tips to Help You Be A Strong Leader.pdfPinta Partners
In the realm of effective leadership, a multitude of skills come into play, but one stands out as both crucial and challenging: public speaking.
Public speaking transcends mere eloquence; it serves as the medium through which leaders articulate their vision, inspire action, and foster engagement. For leaders, refining public speaking skills is essential, elevating their ability to influence, persuade, and lead with resolute conviction. Here are some key tips to consider: https://joellandau.com/the-public-speaking-tips-to-help-you-be-a-stronger-leader/
Enriching engagement with ethical review processesstrikingabalance
New ethics review processes at the University of Bath. Presented at the 8th World Conference on Research Integrity by Filipa Vance, Head of Research Governance and Compliance at the University of Bath. June 2024, Athens
Integrity in leadership builds trust by ensuring consistency between words an...Ram V Chary
Integrity in leadership builds trust by ensuring consistency between words and actions, making leaders reliable and credible. It also ensures ethical decision-making, which fosters a positive organizational culture and promotes long-term success. #RamVChary
Org Design is a core skill to be mastered by management for any successful org change.
Org Topologies™ in its essence is a two-dimensional space with 16 distinctive boxes - atomic organizational archetypes. That space helps you to plot your current operating model by positioning individuals, departments, and teams on the map. This will give a profound understanding of the performance of your value-creating organizational ecosystem.
Colby Hobson: Residential Construction Leader Building a Solid Reputation Thr...dsnow9802
Colby Hobson stands out as a dynamic leader in the residential construction industry. With a solid reputation built on his exceptional communication and presentation skills, Colby has proven himself to be an excellent team player, fostering a collaborative and efficient work environment.
Comparing Stability and Sustainability in Agile SystemsRob Healy
Copy of the presentation given at XP2024 based on a research paper.
In this paper we explain wat overwork is and the physical and mental health risks associated with it.
We then explore how overwork relates to system stability and inventory.
Finally there is a call to action for Team Leads / Scrum Masters / Managers to measure and monitor excess work for individual teams.
Specific ServPoints should be tailored for restaurants in all food service segments. Your ServPoints should be the centerpiece of brand delivery training (guest service) and align with your brand position and marketing initiatives, especially in high-labor-cost conditions.
408-784-7371
Foodservice Consulting + Design
Make it or Break it - Insights for achieving Product-market fit .pdfResonate Digital
This presentation was used in talks in various startup and SMB events, focusing on achieving product-market fit by prioritizing customer needs over your solution. It stresses the importance of engaging with your target audience directly. It also provides techniques for interviewing customers, leveraging Jobs To Be Done for insights, and refining product positioning and features to drive customer adoption.
Sethurathnam Ravi: A Legacy in Finance and LeadershipAnjana Josie
Sethurathnam Ravi, also known as S Ravi, is a distinguished Chartered Accountant and former Chairman of the Bombay Stock Exchange (BSE). As the Founder and Managing Partner of Ravi Rajan & Co. LLP, he has made significant contributions to the fields of finance, banking, and corporate governance. His extensive career includes directorships in over 45 major organizations, including LIC, BHEL, and ONGC. With a passion for financial consulting and social issues, S Ravi continues to influence the industry and inspire future leaders.
3. Decision Theory: Introduction
• The managerial activity includes broadly four
phases, namely, planning, organising,
directing and controlling.
• In performing all of these activities the
management has to face several such
situations where they have to make a choice
of the best among a number of alternative
courses of action.
4. • This choice making is technically termed as
decision-making.
• A decision is simply a selection from two or
more courses of action.
• Decision theory provides a rich set of concepts
and techniques to aid the decision maker in
dealing with complex decision problems.
5. Decision Theory: Definition
• A process which results in the selection from a
set of alternative courses of action, that
course of action which is considered to meet
the objectives of the decision problem more
satisfactorily than others as judged by the
decision maker.
6. Decision Theory: Applications
• Select the best from among several job offers.
• Select the most profitable investment portfolio.
• Determine whether or not to expand a
manufacturing facility.
• Determine whether a large plant, a small plant,
or no plant should be built.
• Decide whether to invest in a new plant,
equipment, research programme, marketing
facilities, etc.
7. Decision Theory: Steps
• Clearly identify and define the problem at
hand.
• Specify objectives and the decision criteria.
• Identify and evaluate the possible
alternatives.
• Formulate (or select) one of the mathematical
decision theory models.
8. Decision Theory: Steps
• Apply the model and select the ‘best’
alternative.
• Conduct a sensitivity analysis of the solution.
• Communication and implementation of
decision.
• Follow-up and feedback of results of decision.
9. Decision Theory: Concepts
• Decision Maker. An individual or a group of
individuals responsible for making the choice
of an appropriate course of action amongst
the available courses of action.
• Courses of Action. The alternative courses of
actions or strategies are the acts that are
available to the decision maker.
10. • States of Nature. The events or occurrences
which are outside the control of the decision
maker, but which determine the level of
success for a given decision.
• Payoff. Each combination of a strategy and
event is associated with a payoff, which
measures the net benefit to the decision
maker.
11. • Payoff Table. For a given problem, payoff
table lists the payoffs for each combination of
event and strategy.
• Regret/Opportunity Loss Table. An
opportunity loss is the loss incurred due to
failure of not adopting the best possible
strategy. For a given state of nature the
opportunity loss of possible strategy is the
difference between the payoff for that
strategy and the payoff for the best possible
strategy that could have been selected.
12. Types of Decision-Making
Environments
• Certainty. Complete and accurate knowledge
of the outcome of each alternative. There is
only one outcome for each alternative.
• Risk. Multiple possible outcomes for each
alternative. A probability of occurrence
attached to each possible outcome.
• Uncertainty. Multiple outcomes for each
alternative. But no knowledge of the
probability of their occurrence.
13. Decision-Making under Certainty
• The consequence of selecting each course of
action known with certainty.
• It is presumed that only one state of nature is
relevant for the purpose of the decision
maker.
• He identifies this state of nature, takes it for
granted and presumes complete knowledge
as to its occurrence.
14. Decision-Making under Certainty
• Some techniques used:
– System of equations.
– Linear programming.
– Integer programming.
– Dynamic programming.
– Queuing models.
– Inventory models.
– Capital budgeting analysis.
– Break even analysis.
15. Decision-Making under Risk
• The decision maker faces several states of
nature.
• He is supposed to have believable evidential
information, knowledge, experience or
judgement to enable him to assign probability
values to the likelihood of occurrence of each
state of nature.
• The course of action which has the largest
expected payoff value is selected.
16. Decision-Making under Risk
• The most widely used decision criterion is the
expected monetary value (EMV) or expected
payoff.
• The objective of decision making is to
optimise expected payoff.
• It means maximisation of expected profit or
minimisation of expected regret.
17. EMV
• Given a payoff table with payoffs and
probability assessments for all states of
nature, it is possible to determine EMV for
each course of action if the decision is
repeated a large number of times.
• The EMV for a given course of action is the
sum of possible payoffs of the alternatives,
each weighted by the probability of that
payoff occurring.
18.
19. Steps for Calculating EMV
• Construct payoff table along with the
probabilities of the occurrence of each state
of nature.
• Calculate EMV for each course of action, as
shown earlier.
• Select the course of action that yields the
optimal EMV.
20. Expected Value with Perfect
Information
• The expected value with perfect information
is the expected or average return, in the long
run, if we have perfect information before a
decision has to be made.
• It is calculated by choosing the best
alternative for each state of nature and
multiplying its payoff with the probability of
that state of nature.
21. • Expected value with perfect information =
(Best outcome for 1st
state of nature) x
(Probability of 1st
state of nature) + (Best
outcome for 2nd
state of nature) x (Probability
of 2nd
state of nature) + … + (Best outcome for
last state of nature) x (Probability of last state
of nature)
22. Expected Value of Perfect
Information (EVPI)
• EVPI is the expected value with perfect
information minus the expected value without
perfect information, namely the maximum
EMV.
23. Expected Opportunity Loss (EOL)
• An alternative approach to maximising EMV is
to minimise EOL or expected value of regrets.
24.
25. Suppose an electrical goods merchant buys, for resale
purposes in a market, electric irons in the range of 0 to
4. His resources permit him to buy nothing or 1 or 2 or 3
or 4 units. These are his alternative courses of action or
strategies. The demand for electric irons on any day is
something beyond his control and hence is a state of
nature. Let us presume that the dealer does not know
how many units will be bought from him by the
customers. The demand could be anything from 0 to 4.
The dealer can buy each unit of electric iron @ Rs.40
and sell it at Rs.45 each, his margin being Rs.5 per unit.
Assume the stock on hand is valueless. Portray in a
payoff table and opportunity loss table the quantum of
total margin (loss), that he gets in relation to various
alternative strategies and states of nature.
27. A person has the choice of running a hot snack stall
or an ice-cream and cold drink stall at Ooty. If the
weather is cool and rainy, he can expect to make a
profit of Rs.15000 and if it is warm he can expect to
make a profit of Rs.3000 by running a hot snack stall.
On the other hand, if his choice is to run an ice-
cream and cold drink stall, he can expect to make a
profit of R.18000 if the weather is warm and Rs.3000
if the weather is cool and rainy. There is 40% chance
of weather being warm in the coming season.
Should he opt for running the hot snack stall or an
ice-cream stall?
28. A newspaper boy has the following probabilities of
selling a magazine:
No. of copies sold Probability
10 0.10
11 0.15
12 0.20
13 0.25
14 0.30
Cost of copy is 30 paise and sale price is 50 paise. He
cannot return unsold copies. How many copies
should he order?
29. A dairy firm wants to determine the quantity of
butter it should produce to meet the demand. Past
records have shown the following demand pattern:
The stock levels are restricted to the range 15 to 50
kg due to inadequate storing facilities. Butter costs
Rs.40 per kg and is sold at Rs.50 per kg.
i.Construct a conditional profit table.
ii.Determine the action alternative associated with
maximization of expected profit.
iii.Determine EVPI.
Quantity required (kg) 15 20 25 30 35 40 50
No. of days demand occurred 6 14 20 80 40 30 10
40. An ice-cream retailer buys ice-cream at a cost of Rs.5
per cup and sells it for Rs.8 per cup; any ice-cream
remaining unsold at the end of the day can be
disposed of at a salvage price of Rs.2 per cup. Past
sales have ranged between 15 and 18 cups per day;
there is no reason to believe that sales volume will
take on any other magnitude in future. Find the
EVPI, if the sale history has the following
probabilities:
Market size 15 16 17 18
Probability 0.10 0.20 0.40 0.30
41. A television dealer finds that the cost of a TV in stock
for a week is Rs.30 and the cost of a unit shortage is
Rs.70. For one particular model of TV the probability
distribution of weekly sales is as follows:
How many units per week should the dealer order?
Also find the EVPI.
Weekly sales 0 1 2 3 4 5 6
Probability 0.1 0.1 0.2 0.25 0.15 0.15 0.05
42. Decision-Making under Uncertainty
• The probabilities are not known.
• No historical data available.
• Expected payoff cannot be calculated.
• Example: Introduction of a new product in the
market.
• The choice of a course of action depends
largely upon the personality of the decision-
maker or policy of the organisation.
43. Decision Criteria under condition
of Uncertainty
• Maximin.
• Maximax.
• Minimax Regret.
• Hurwicz Criterion.
• Baye’s/Laplace’s Criterion.
44. Criterion of Pessimism (Maximin)
• Also called ‘Waldian Criterion.’
• Determine the lowest outcome for each
alternative.
• Choose the alternative associated with the
best of these.
45. Criterion of Optimism (Maximax)
• Suggested by Leonid Hurwicz.
• Determine the best outcome for each
alternative.
• Select the alternative associated with the best
of these.
46. Minimax Regret Criterion
• Attributed to Leonard Savage.
• For each state, identify the most attractive
alternative.
• Place a zero in those cells.
• Compute opportunity loss for other alternatives.
• Identify the maximum opportunity loss for each
alternative.
• Select the alternative associated with the lowest
of these.
47. Criterion of Realism (Hurwicz
Criterion)
• A compromise between maximax and
maximin criteria.
• A coefficient of optimism α (0≤α≤1) is
selected.
• When α is close to 1, the decision-maker is
optimistic about the future.
• When α is close to 0, the decision-maker is
pessimistic about the future.
49. Laplace Criterion
• Assign equal probabilities to each state.
• Compute the expected value for each
alternative.
• Select the alternative with the highest
alternative.
50. A firm manufactures three types of products. The fixed
and variable costs are given below:
The likely demand (units) of the products is given below:
•Poor demand: 3000
•Moderate demand: 7000
•High demand: 11000
If the sale price of each type of product is Rs.25, then
prepare the payoff matrix.
Product Fixed cost (Rs.) Variable cost per unit (Rs.)
A 25000 12
B 35000 9
C 53000 7
51. A farmer wants to decide which of the three crops he should plant on his 100-acre
farm. The profit from each is dependent on the rainfall during the growing season.
The farmer has categorized the amount of rainfall as high, medium and low. His
estimated profit for each is shown in the Table below:
If the farmer wishes to plant only one crop, decide which should be his ‘best crop,’
using
a.Maximax criterion
b.Maximin criterion
c.Hurwicz criterion (farmer’s degree of optimism being 0.6)
d.Laplace criterion
e.Minimax regret criterion.
Rainfall Estimated conditional profit (Rs.)
Crop A Crop B Crop C
High 8000 3500 5000
Medium 4500 4500 5000
Low 2000 5000 4000
52. A manufacturer makes a product, of which the principal
ingredient is a chemical X. At the moment, the
manufacturer spends Rs.1000 per year on the supply of X,
but there is a possibility that the price may soon increase
to four times its present figure because of a worldwide
shortage of the chemical. There is another chemical Y,
which the manufacturer could in conjunction with a third
chemical Z, in order to give the same effect as chemical X.
Chemicals Y and Z would together cost the manufacturer
Rs.3000 per year; but their prices are unlikely to rise.
What action should the manufacturer take? Apply the
maximin and minimax regret criteria for decision-making
and give two sets of solutions.
If the coefficient of optimism is 0.4, find the course of
action that minimizes the cost.
53. Decision Tree Approach
• Using a decision tree the decision problem,
alternative courses of action, states of nature
and the likely outcomes are diagrammatically
depicted.
• A decision tree consists of a network of nodes,
branches, probability estimates and payoffs.
• Nodes are of two types: decision-node
(square) and chance node (circle).
54. • Alternative courses of action originate from
decision nodes as main branches (decision
branches).
• At the terminal of each decision branch, there is
a chance node.
• Chance events emanate from chance nodes in
the form of sub-branches (chance branches).
• The respective payoffs and the probabilities
associated with the alternative courses and
chance events are shown alongside the chance
branches.
• At the terminal of the chance branches expected
payoffs are shown.
55. Types of Decision Trees
• Deterministic.
• Probabilistic.
• These can further be subdivided into single
stage and multistage trees.
• A single stage deterministic decision tree
involves making only one decision under
conditions of certainty (no chance events).
56. • In a multi stage deterministic tree a sequence
or chain of decisions are to be made.
• A problem involving only one decision to be
made under conditions of risk or uncertainty
(more than one chance events) can be
represented using a single stage probabilistic
decision tree.
• In the above problem, if a sequence of
decisions is required, a multi stage
probabilistic decision tree is required.
60. Drawing a Decision Tree:
Conventions
• Identify all decisions (and their alternatives) to
be made and the order in which they must be
made.
• Identify the chance events or states of nature
that might occur as a result of each decision
alternative.
• Develop a tree diagram showing the sequence
of decisions and chance events.
61. • Estimate probabilities that the possible events
will occur as a result of the decision
alternatives.
• Obtain outcomes (usually expressed in
economic terms) of the possible interactions
among decision alternatives and events.
• Calculate the expected value of all possible
decision alternatives.
• Select the decision alternative (or course of
action) offering the most attractive expected
value.
62. Roll-Back Technique
• Used for analysing a decision tree.
• Proceeds from the last decision in the sequence
and works back to the first for each of the
possible decisions.
• Two rules concerning this technique:
– If branches emanate from a circle, the total expected
payoff may be calculated by summing up the
expected values of all the branches.
– If branches emanate from a square, we calculate the
total expected payoff for each branch emanating from
that square and the branch with the highest expected
benefit gives the solution.
63. Decision Tree: Advantages
• Useful for portraying the interrelated, sequential and
multidimensional aspects of a decision problem.
• Focuses attention on the critical elements in a decision
problem.
• Especially useful in cases where an initial decision and
its outcome affect the subsequent decisions.
• Enables the decision maker to see the various
elements of the decision problem in a systematic way.
• Complex managerial problems can be explicitly
defined.
• Can be applied in various fields.
64. Decision Tree Approach: Applications
• Introduction of a new product.
• Marketing strategy.
• Make or buy decisions.
• Pricing assets acquisition.
• Investment decisions.
65. A company owns a lease on a property. It may
sell the lease for Rs.12000 or it may drill the said
property for oil. Various possible drilling results
are as under along with the probabilities of
happening and rupee consequences:
Possible Result Probability Rupee Consequence
Dry well 0.10 -100000
Gas well 0.40 45000
Oil & gas well 0.30 98000
Oil well 0.20 199000
68. Mr. X of ABC Ltd. wants to introduce a new product in the
market. He has a choice of two different research and
development plans A and B. A costs Rs.10 lakh and has 40%
chance of success whereas B costs Rs.5 lakh with 30% chance
of success. In the event of success, Mr. X has to decide whether
to advertise the product heavily or lightly. Heavy advertising will
cost Rs.4 lakh and give a 0.7 probability of full acceptance and
0.3 probability of partial acceptance by the market. Light
advertising will cost Rs.1 lakh with a probability 0.5 of full
acceptance and 0.5 probability of partial acceptance. Full market
acceptance of the product developed as per plan A would be
worth Rs.40 lakh and as per plan B would be worth Rs.30 lakh.
Partial acceptance in both the cases will be worth Rs.20 lakh.
Which plan should Mr. X adopt and what sort of advertising
should be done for marketing the product? Solve the problem
with the help of a decision tree.