Explain decision making process, Operation Research

Assignment Help:

Explain Decision Making Process.

Decision Making Process: A good decision can only be prepared as a result of a rational decision making process. The different stages of the said process are as given below:

(i) Recognising and defining the problem

 - Recognise and know the real problem and not the symptoms.  

 - Define the problem in order to find out the conditions for its solution.

(ii) Analysing the problem

 - implies classifying this and finding the facts.

 - Classification makes sure that a decision really contributes to the entire business rather than resolve an immediate or local problem at the expense of the complete.

 - Facts are essential to make a sound decision and decrease risk.

 - Must describe the unknown.

(iii) Determining the possible alternatives

 - Usually problems have more than one alternative.

 - Must consider all possible optional for arriving at a solution with competitors' solutions or those used in the past.

(iv) Evaluating the impact of Alternatives

 - Decision maker should mentally put in effect each alternative and visualise their impact, therefore forecast what will happen when a certain forecast is adopted.

 - Both qualitative and quantitative factors to be considered.

 - Limitations of each alternative to be seems.

 - Techniques as marginal analysis, cost effectiveness; cost-benefit analysis can be utilized.

(v) Selecting the finest solution

 - Best solution is selected through comparing merits and demerits, gains and losses of each alternative.

 - Must consider degree of risk, availability of resources, limitations and time needed for implementation.

(vi) Implementation

 - Convert decision in action.

 - Communicate, make sure subordinates' participation.

 - Monitor implementation by feedback.


Related Discussions:- Explain decision making process

Solve lpp question graphically, A producer of furniture manufactures two pr...

A producer of furniture manufactures two products - tables and chairs. Processing of these products is done on two machines A and B. A chair needs 2 hours on machine A and 6 hours

Techniques, explain the different techniques as operation research

explain the different techniques as operation research

Sequencing problem, if one no. is repeated 2-3 times in machine-1 and machi...

if one no. is repeated 2-3 times in machine-1 and machine-2 what is to be prefer first

Game Theory, Task1:- A company is currently involved in negotiation with it...

Task1:- A company is currently involved in negotiation with its union on the upcoming wage contract. Positive signs in the table represent wage increase while negative sign represe

Line balancing methods - heuristic approach, Line Balancing Methods - Heuri...

Line Balancing Methods - Heuristic Approach  Heuristic mean serving to find i.e. to find out discover things for oneself. Heuristic describes a particular approach to problem so

Linear programming problem, A paper mill products two grade of paper viz., ...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Bibliography format - report writing presentation , Bibliography Format ...

Bibliography Format a. Introduction : Bibliographies  tell  readers  where they can  locate  information  about  a topic. It is a list of sources  of information  for a repo

Solve the following lpp by graphical method, A company manufactures two typ...

A company manufactures two types of printed circuits. The requirements of transistors, resistors and capacitor for each type of printed circuits along with other data are given in

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

LINEAR PROGRAMMING, SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=...

SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=3X1+2X2 SUBJECT TO CONSTRAINT X1+X2 X1-X2 X1,X2>=0

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd