Introduction to MCDM Slim Zekri Dept. Natural Resource Economics Sultan Qaboos University.

Slides:



Advertisements
Similar presentations
Introduction to Mathematical Programming
Advertisements

Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Multi‑Criteria Decision Making
Linear Programming Problem
INTRODUCTION TO MODELING
1 1 Slide © 2005 Thomson/South-Western Lesson 10 Multicriteria Decisions within LP Framework n Goal Programming n Goal Programming: Formulation and Graphical.
Dragan Jovicic Harvinder Singh
Computational Methods for Management and Economics Carla Gomes Module 8b The transportation simplex method.
Introduction to Mathematical Programming OR/MA 504 Chapter 6 Goal programming and Multiple Objective Optimization.
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
19 Linear Programming CHAPTER
The Rational Decision-Making Process
Introduction to Management Science
Basic Optimization Problem Notes for AGEC 641 Bruce McCarl Regents Professor of Agricultural Economics Texas A&M University Spring 2005.
Introduction to Management Science
Decision Based Design Some Questions David Kazmer University of Massachusetts Amherst.
Linear programming. Linear programming… …is a quantitative management tool to obtain optimal solutions to problems that involve restrictions and limitations.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
LINEAR PROGRAMMING SIMPLEX METHOD.

Chapter 19 Linear Programming McGraw-Hill/Irwin
Approximation and Visualization of Interactive Decision Maps Short course of lectures Alexander V. Lotov Dorodnicyn Computing Center of Russian Academy.
Decision Making via Linear Programming: A simple introduction Fred Phillips
Module B: Linear Programming
LECTURE VI PROFIT MAXIMIZATION. Profit Maximization  Revenue is  Viewed from the standpoint of either input or output.  Income to the producer is 
Managerial Decision Making and Problem Solving
1 DSCI 3023 Linear Programming Developed by Dantzig in the late 1940’s A mathematical method of allocating scarce resources to achieve a single objective.
1 Linear Programming: Model Formulation and Graphical Solution.
Linear Programming An Example. Problem The dairy "Fior di Latte" produces two types of cheese: cheese A and B. The dairy company must decide how many.
Introduction A GENERAL MODEL OF SYSTEM OPTIMIZATION.
Profit maximisation  Producers are considered to be rational and profit maximisers. For that they need to minimise their cost of production and maximize.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
1 Spreadsheet Modeling & Decision Analysis: A Practical Introduction to Management Science, 3e by Cliff Ragsdale.
Theoretical Tools of Public Economics Math Review.
1 Chapter 7 Applying Simulation to Decision Problems.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Goal Programming Linear program has multiple objectives, often conflicting in nature Target values or goals can be set for each objective identified Not.
1 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
Chapter 1 Introduction n Introduction: Problem Solving and Decision Making n Quantitative Analysis and Decision Making n Quantitative Analysis n Model.
Introduction to linear programming:- - Linear programming (LP) applies to optimization models in which the objective and constraints functions are strictly.
Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Course Overview and Overview of Optimization in Ag Economics Lecture 1.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
LINEAR PROGRAMMING.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
Introduction to Linear Programming and Formulation Meeting 2 Course: D Deterministic Optimization Year: 2009.
Reid & Sanders, Operations Management © Wiley 2002 Linear Programming B SUPPLEMENT.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
LINEAR PROGRAMMING Classic Types of Constrained Decision Problems 1. Product Mix 2. Ingredient Mix 3. Transportation 4. Assignment 5. Time Period.
Recall: Consumer behavior Why are we interested? –New good in the market. What price should be charged? How much more for a premium brand? –Subsidy program:
Section VI Capital Rationing. Section Highlights F Capital rationing F Linear programming F Shadow prices and the cost of capital F Integer programming.
EMGT 5412 Operations Management Science Nonlinear Programming: Introduction Dincer Konur Engineering Management and Systems Engineering 1.
Introduction Operations Research (OR) It is a scientific approach to determine the optimum (best) solution to a decision problem under the restriction.
Chapter 3 Introduction to Linear Programming to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c)
Chapter 9 Integer Programming to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
Chapter 2 Linear Programming Models: Graphical and Computer Methods
A seminar talk on “SOLVING LINEAR PROGRAMMING PROBLEM BY GRAPHICAL METHOD” By S K Indrajitsingha M.Sc.
Decision Theory Dr. T. T. Kachwala.
Mathematical Programming
Linear Programming Dr. T. T. Kachwala.
Engineering design is the process of devising a system, component, or process to meet desired needs. It is a decision-making process in which the basic.
Constraint management
Spreadsheet Modeling & Decision Analysis:
Prepared by Po-Chuan on 2016/05/24
Presentation transcript:

Introduction to MCDM Slim Zekri Dept. Natural Resource Economics Sultan Qaboos University

Traditional paradigm for decision- making The traditional paradigm for analyzing decision making is based on 3 elements: 1. A decision maker 2.An array of feasible choices 3.A well-defined criterion (utility or profit) The criterion associates a number to each alternative Alternatives are ranked to find the optimal value for the criterion of choice The best (highest or lowest value) is then selected

LP shares the same paradigm Mathematical programming for decision making shares the same theoretical construct: 1.Establish a set of feasible solutions satisfying the constraints 2.Solutions are ordered according to the objective function representing the preferences of the DM 3.The optimum solution is obtained using mathematical procedure such as the simplex algorithm

Multiplicity of objectives Commercial farmer – Maximizing profit and – Minimizing Risk Subsistence farmer – Max cash – Max food security – Min Risk – Min work load

Multiple objectives are all around us Commercial farmer – Maximizing profit – Minimizing Risk – Minimize debt Subsistence farmer – Max cash – Max food security – Min Risk – Min work load Wild fish management – Maximizing rent – Ensuring sustainability – Ensuring biodiversity Engineering and design – Maximize car power – Minimize fuel consumption – Maximize safety – Comfort

Rigid constraints in LP The traditional paradigm assumes that constraints are rigid and cannot be violated under any circumstances In many situations it’s possible to accept a certain amount of violation of at least some of the constraints when the technical knowledge is not precise enough – Examples: 1.Formulation of livestock rations 2.Selection of fertilizer combinations

Economic versus technological decisions Friedman (1962) “decision problems involving a single criterion should be regarded as technological problems” Zeleny (1982) “technological problems consist only of the processes of search and measurement” – This can be undertaken using simple tools or very sophisticated methods In technological problem there is no decision making – Only search and ranking decision-making arises only when several criteria are considered

Several Criteria Single Criterion Scarce Resources Economic Problem Technological Problem No ScarcityNo problem ('Nirvana')

Wheeler and Russell (1977) were the first to introduce several goals in a farm level decision making model in agriculture. However the formalization of MCDM in the agricultural sector started in the late 1980’s

Attributes, objectives and goals An attribute is defined as a decision maker's values related to reality and is expressed as a mathematical function F(x) of the decision variables – Profit, Risk, pollution are attributes An objective represents direction of improvement of an attribute – 'the more of the attribute, the better' or Max F(x) – 'the less of the attribute, the better‘ Min F(x)

An aspiration level or a Target: is an acceptable level of achievement for an attribute – The combination of an attribute with a target gives a goal – F(x) = t; F(x) >t; F(x) <t Gross margin is an attribute, Maximize gross margin is an objective Achieve a gross margin of at least $200,000 is a goal A criterion encompasses the 3 preceding concepts: criteria are Attributes, Objectives or Goals

Distinction between a goal and a constraint We defined a goal as the association of an attribute with a target F(x) = t; F(x) >t; F(x) <t – Mathematically speaking they are the same except for the interpretation of the RHS In a constraint the RHS has to be satisfied otherwise the solution is unfeasible In a goal the RHS, t, is a target that we aspire to achieve but might or might not be achieved

Goal The amount of violation can be measured by introducing positive and negative deviational variables – Attribute + Deviational variables = Target – F(x) + n – p = t – Example: Achieve a Profit of 2,000,000 – 1 000x x 2 + n - p = 2,000,000 – Then Minimize n If n= 300,000 then the achievement is 1,700,000 If p= 200,000 then the achievement is 2,200,000

Pareto optimality Pareto optimality plays a vital role in economic theory. It is the corner stone of MCDM In MCDM there is not a single “Optimal” solution, but a set of Pareto Optimal Solutions – Feasible solutions such that no other feasible solution can achieve the same or better performance for all the criteria under consideration and strictly better for at least one criterion

Example Assume the DM Max GM; Min Labour and Min Debt Compare the 3 solutions S1; S2 and S3 below

Trade-offs A Pareto optimal solution is a feasible solution for which an increase in the value of one criterion can only be achieved by degrading the value of at least one other criterion Trade-off: the amount of achievement of one criterion that must be sacrificed to gain a unitary increase in the other criterion Trade-off S 1,3 = ₤500/hour it is an opportunity cost