Lesson 11 Multicriteria Decisions within LP Framework.

Slides:



Advertisements
Similar presentations
IENG313 Operation Research I
Advertisements

Linear Programming Problem
Question:- A company assembles four products (1, 2, 3, 4) from delivered components. The profit per unit for each product (1, 2, 3, 4) is £10, £15, £22.
Homework Solution GOAL PROGRAMMING
Linear Programming Problem
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
Assignment (6) Simplex Method for solving LP problems with two variables.
1 1 Slide © 2005 Thomson/South-Western Lesson 10 Multicriteria Decisions within LP Framework n Goal Programming n Goal Programming: Formulation and Graphical.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
SENSITIVITY ANALYSIS.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Learning Objectives for Section 5.3
Chapter 5 Linear Inequalities and Linear Programming Section 3 Linear Programming in Two Dimensions: A Geometric Approach.
Operations Management Linear Programming Module B - Part 2
Goal Programming How do you find optimal solutions to the following?
LP EXAMPLES.
© 2008 Prentice-Hall, Inc. Chapter 7 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created.
Introduction to Management Science
1 1 Slide © 2005 Thomson/South-Western EMGT 501 HW Solutions Problem Problem
EMGT 501 HW # Due Day: Sep 14.
Pet Food Company A pet food company wants to find the optimal mix of ingredients, which will minimize the cost of a batch of food, subject to constraints.
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
Linear Goal Programming
1 1 Slide Chapter 14: Goal Programming Goal programming is used to solve linear programs with multiple objectives, with each objective viewed as a "goal".
Introduction to Management Science
Goal Programming In many linear programming problems, the
Introduction to Management Science
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Linear Programming Applications
1 1 Slide © 2005 Thomson/South-Western EMGT 501 HW Solutions Chapter 14 - SELF TEST 20.
Linear Programming Example 2 Alternate Optimal Solutions.
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
9-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Multicriteria Decision Making Chapter 9.
Multicriteria Decision Making
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Decision Making via Linear Programming: A simple introduction Fred Phillips
1 1 Slide © 2004 Thomson/South-Western Chapter 17 Multicriteria Decisions n Goal Programming n Goal Programming: Formulation and Graphical Solution and.
1 1 Slide © 2005 Thomson/South-Western Slides Prepared by JOHN S. LOUCKS ST. EDWARD’S UNIVERSITY.
Linear Programming: Basic Concepts
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.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Chapter 9 - Multicriteria Decision Making 1 Chapter 9 Multicriteria Decision Making Introduction to Management Science 8th Edition by Bernard W. Taylor.
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
Team 9 Jin woo Choi Philip Liu Nallely Tagle
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
1 Systems Analysis Methods Dr. Jerrell T. Stracener, SAE Fellow SMU EMIS 5300/7300 NTU SY-521-N NTU SY-521-N SMU EMIS 5300/7300 Statistical Analysis Other.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
Goal Programming Linear program has multiple objectives, often conflicting in nature Target values or goals can be set for each objective identified Not.
A LINEAR PROGRAMMING PROBLEM HAS LINEAR OBJECTIVE FUNCTION AND LINEAR CONSTRAINT AND VARIABLES THAT ARE RESTRICTED TO NON-NEGATIVE VALUES. 1. -X 1 +2X.
Chapter 4 Linear Programming: The Simplex Method
1 1 Slide © 2005 Thomson/South-Western Simplex-Based Sensitivity Analysis and Duality n Sensitivity Analysis with the Simplex Tableau n Duality.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
HW # Due:
Arben Asllani University of Tennessee at Chattanooga Chapter 5 Business Analytics with Goal Programming Business Analytics with Management Science Models.
LINEAR PROGRAMMING.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Chapter 4 The Simplex Algorithm and Goal Programming
Review Test 2 BSAD 30 Dave Novak Source: Anderson et al., 2015 Quantitative Methods for Business 13 th edition – some slides are directly from J. Loucks.
An Introduction to Linear Programming
Nonlinear Programming Prepared by Lee Revere and John Large
Chapter 5 Linear Inequalities and Linear Programming
Goal programming.
Chapter 8 Goal Programming.
Goal Programming How do you find optimal solutions to the following?
Slides by John Loucks St. Edward’s University.
Linear Programming Problem
Chapter 4 The Simplex Algorithm
Linear Programming.
Presentation transcript:

Lesson 11 Multicriteria Decisions within LP Framework

Learning Objectives: By the end of this unit, you should be able to: Understand Goal Programming Formulate model for Goal Programming Find Graphical Solution for Goal Programming

Goal Programming Goal programming may be used to solve linear programs with multiple objectives, with each objective viewed as a "goal". In goal programming, d i + and d i -, deviation variables, are the amounts a targeted goal i is overachieved or underachieved, respectively. The goals themselves are added to the constraint set with d i + and d i - acting as the surplus and slack variables.

Goal Programming One approach to goal programming is to satisfy goals in a priority sequence. Second-priority goals are pursued without reducing the first- priority goals, etc. For each priority level, the objective function is to minimize the (weighted) sum of the goal deviations. Previous "optimal" achievements of goals are added to the constraint set so that they are not degraded while trying to achieve lesser priority goals.

Goal Programming Formulation Step 1: Decide the priority level of each goal. Step 2: Decide the weight on each goal. If a priority level has more than one goal, for each goal i decide the weight, w i, to be placed on the deviation(s), d i + and/or d i -, from the goal.

Goal Programming Formulation Step 3: Set up the initial linear program. Min w 1 d w 2 d 2 - s.t. Functional Constraints, and Goal Constraints Step 4: Solve the current linear program. If there is a lower priority level, go to step 5. Otherwise, a final solution has been reached.

Goal Programming Formulation Step 5: Set up the new linear program. Consider the next-lower priority level goals and formulate a new objective function based on these goals. Add a constraint requiring the achievement of the next- higher priority level goals to be maintained. The new linear program might be: Min w 3 d w 4 d 4 - s.t. Functional Constraints, Goal Constraints, and w 1 d w 2 d 2 - = k Go to step 4. (Repeat steps 4 and 5 until all priority levels have been examined.)

Example: Conceptual Products Conceptual Products is a computer company that produces the CP400 and CP500 computers. The computers use different mother boards produced in abundant supply by the company, but use the same cases and disk drives. The CP400 models use two CD drives and no DVD drives whereas the CP500 models use one CD drive and one DVD disk drive.

Example: Conceptual Products The disk drives and cases are bought from vendors. There are 1000 CD drives, 500 DVD disk drives, and 600 cases available to Conceptual Products on a weekly basis. It takes one hour to manufacture a CP400 and its profit is $200 and it takes one and half hours to manufacture a CP500 and its profit is $500.

Example: Conceptual Products Formulate the equations and solve the problem assuming that the company has four goals: Priority 1: Meet a state contract of 200 CP400 machines weekly. (Goal 1) Priority 2: Make at least 500 total computers weekly. (Goal 2) Priority 3: Make at least $250,000 weekly. (Goal 3) Priority 4: Use no more than 400 man-hours per week. (Goal 4)

Constrains: Conceptual Products Let’s set : CP400 = X1 and CP500 = X2 We can identify following constrains table: So our constrains are: 1. 2 X1 + X2 ≤ X2 ≤ X1 + X2 ≤ 600 Constrains or Goals X1X2Total CD DVD01500 Case11600 Labour11.5 Profit$200$500

Goal Equations: Conceptual Products Equation for Goal 1: X1 = d d 1 - or X1 - d d 1 - = 200Goal 1: Min d 1 - Equation for Goal 2: X1 + X2 = d d 2 - or X1 + X2 - d d 2 - = 500 Goal 2: Min d 2 - Equation for Goal 3: 200X X2 = d d 3 - or 200X X2 - d d 3 - = Goal 3: Min d 3 - Equation for Goal 4: X X2 = d d 4 - or X X2 – d d 4 - = 400 Goal 4: Min d 4 +

Final Objective Function, and Goal and Constrain functions Min P 1 (d 1 - ) + P 2 (d 2 - ) + P 3 (d 3 - ) + P 4 (d 4 + ) S.T. 1. 2X1 + X2≤ X2 ≤ X1 + X2 ≤ X1 - d d 1 - = X1 + X2 - d d 2 - = X X2 - d d 3 - = X X2 – d d 4 - = 400 We can solve it using graphical method, pay attention!!!

QUESTIONS ?

Review Problem 1.

Review Problem 1: Answer

Review Problem: Answer

Review Problem 2.