SENSITIVITY ANALYSIS. luminous lamps produces three types of lamps A, B And C. These lamps are processed on three machines X, Y and Z. the full technology.

Slides:



Advertisements
Similar presentations
Chapter 4 Decision Making
Advertisements

February 21, 2002 Simplex Method Continued
February 26, 2002 Sensitivity Analysis presented as FAQs – Points illustrated on a running example of glass manufacturing. – If time permits, we.
Thursday, March 7 Duality 2 – The dual problem, in general – illustrating duality with 2-person 0-sum game theory Handouts: Lecture Notes.
Tuesday, March 5 Duality – The art of obtaining bounds – weak and strong duality Handouts: Lecture Notes.
February 14, 2002 Putting Linear Programs into standard form
Graph of a Curve Continuity This curve is _____________These curves are _____________ Smoothness This curve is _____________These curves are _____________.
Graph of a Curve Continuity This curve is continuous
1  1 =.
MULTIPLICATION EQUATIONS 1. SOLVE FOR X 3. WHAT EVER YOU DO TO ONE SIDE YOU HAVE TO DO TO THE OTHER 2. DIVIDE BY THE NUMBER IN FRONT OF THE VARIABLE.
EMGT 501 HW #1 Due Day: Sep 13 Chapter 2 - SELF TEST 18
Another example Max z=5x1+12x2+4x3-MR S.t. x1+2x2+x3+x4=10
Look at This PowerPoint for help on you times tables
6/11/2014 Question: XYZ Furniture Ltd. is involved in producing Chairs and Tables. The firm makes a profit of Rs. 200 per chair and Rs. 300 per table.
Max output (Q) subject to a cost constraint
1 © 2006 by Nelson, a division of Thomson Canada Limited Slides developed by: William Rentz & Al Kahl University of Ottawa Web Appendix 4A Production Decisions.
1. The Problem 2. Tabulate Data 3. Translate the Constraints 4. The Objective Function 5. Linear Programming Problem 6. Production Schedule 7. No Waste.
Chapter 8 Exploring Polynomial Functions
Artificial Variables, 2-Phase and Big M Methods
LP—Graphical Solution Method MSci331—Week Convex Set and Extreme Points 2.
Fin500J: Mathematical Foundations in Finance
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Operations Management - 5 th Edition Chapter 13 Supplement Roberta.
Thank you and welcome Linear Programming (LP) Modeling Application in manufacturing And marketing By M. Dadfar, PhD.
EMIS 8374 LP Review: The Ratio Test. 1 Main Steps of the Simplex Method 1.Put the problem in row-0 form. 2.Construct the simplex tableau. 3.Obtain an.
Multiplication Facts Practice
Strategic Allocation of Resources (Linear Programming)
Graeme Henchel Multiples Graeme Henchel
0 x x2 0 0 x1 0 0 x3 0 1 x7 7 2 x0 0 9 x0 0.
Understanding optimum solution
Chapter 5 Sensitivity Analysis: An Applied Approach
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc. 1 Chapter 5 Sensitivity Analysis: An Applied Approach to accompany Introduction to.
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
Session II – Introduction to Linear Programming
Chapter 2: Modeling with Linear Programming & sensitivity analysis
SENSITIVITY ANALYSIS.
LINEAR PROGRAMMING SIMPLEX METHOD
Optimization Models Module 9. MODEL OUTPUT EXTERNAL INPUTS DECISION INPUTS Optimization models answer the question, “What decision values give the best.
LP EXAMPLES.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
The Simplex Algorithm An Algorithm for solving Linear Programming Problems.
Operation Research Chapter 3 Simplex Method.
1 Linear Programming Using the software that comes with the book.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Spreadsheet Modeling & Decision Analysis:
THE FIRM ’ S BASIC PROFIT MAXIMIZATION PROBLEM Chapter 2 slide 1 What Quantity of Output should the Firm Produce and Sell and at What Price? The Answer.
Solver Linear Problem Solving MAN Micro-computers & Their Applications.
Special Conditions in LP Models (sambungan BAB 1)
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
Managerial Decision Making and Problem Solving
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Chapter 6 Supplement Linear Programming.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
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.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
LINEAR PROGRAMMING.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
GOOD MORNING CLASS! In Operation Research Class, WE MEET AGAIN WITH A TOPIC OF :
SENSITIVITY ANALYSIS. 2 Sensitivity Analysis Sensitivity analysis is carried out after optimal solution is found. Hence called as post optimality analysis.
Linear Programming for Solving the DSS Problems
Linear Programming.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Sindhuja K, Annapoorani G, Pramela Devi S Department: CSE
Duality Theory and Sensitivity Analysis
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Optimization Models Module 9.
Presentation transcript:

SENSITIVITY ANALYSIS

luminous lamps produces three types of lamps A, B And C. These lamps are processed on three machines X, Y and Z. the full technology and input restrictions are given in the following table.

The Linear Programming model for the above problem can be written as Maximize Z = 12 x1 + 3 x2 + x3 subject to 10 x1 + 2 x2 + x3 /< x1 + 3 x2 + 2x3 /< 77 2 x1 + 4 x2 + x3 /< 80 x1, x2, x3 >/ 0 Solving the above problem by the simplex method x1 = 73/ 8, x2 = 35/ 8, x3 = 0 and the optimal value of the objective function is 981/8

OPTIMUM SOLUTION

SENSITIVITY ANALYSIS First we find out whether a previously determined optimal solution remains optimal if the value of problem is changed. We will observe the optimum solution for following conditions. 1.Changes in Objective Function co-efficients A.Variables not included in the solution (i.e X3) (i.e. changes in the non-basic variable) B.Variables included in the solution (i.e. X1, X2) (i.e. Changes in basic variable) 2.Changes in the bi values : (RHS side of constraints) RHS Ranging. (i.e. changes in available resources)

Changes in objective function co-efficient Variable not included in the solution. Or Changes in non basic variable i.e. X3 As given in the optimum solution X3 is not in the solution. The Z value for X3 is 11/16 and its profit contribution is (i.e. product C) is also 1 Rs. This implies that a profit margin of at least 11/16 must be increased for this product if the firm would decide to include this product. So the increased margin of 11/16 means that total profit margin of the product should more than 11/ = 27/16. The same thing can be treated like if the current solution is changed to 27/16 with the introduction of product C than the solution optimal beyond that it is no longer optimum. The information is useful to the manager as he/she can make decision of pricing without interfering optimal solution.

Variable included in the solution or changes in basic variable of obj fn For the given problem X1, X2 are the basic variables. Consider whether the change of profit per unit of a product, causes a change in the optimal solution of the problem. Over a certain range, a change positive or negative into unit profit would not cause a change in the optimal solution. To determine this, divide final Z raw values by corresponding raw values in the table. i.e. for product X1 it should be values in Z raw / values of X1 raw.

The least positive quotient (i.e Z / X1) is 5 implies that how much profit could decrease without changing solution. And least negative is 3 implies that maximum increase in the profit that would not cause a change in solution. So the range of profit would be (12-5=)7 to 15 (=12-(-3)) for product 1. in case the profit per product 1 falls below 7 or becomes higher than 15 rs. the optimum solution would change. In a similar way profit range for product 3 is (3- 3/5) and (3 -(-15/7). i.e. 12/5 to 36/7. That means that the variation in the profit per product 2 between 2.4 to 5.14 Would not change the optimum solution.

Change in the bi values or available resources or RHS Ranging In this case aim is to find that whether the change in available resources would make optimum solution unchanged or not. Or if so than in what range we can change the available resources. So the question is how many resources(i.e machine hours) in particular department may be increased or decreased that the profit become unchanged. To determine this we divide value of solution column with the respective slack variables. i.e. for our problem if we want to determine how many machine hourse of M1 can be changed without affecting final solution than we have to divide solution column / S1 raw. (the corrosponding slack variable for M1).

From the values least positive number provides answer to the question how many hours can be decreased and least negative number gives the how may hours can be increased in addition to the available hours. So for M1 least positive number is 354/11 and least negative number is -10. So number of hours should be /11 to 100 – (-10). i.e. 746/11 (67.81) to 110 hours. It can be concluded that between to 110 hours of the machine 1 the profit become unchanged. Similarly for machine M2 the range of number of hours would be 70 to 870/9 ( i.e ) hours.

The End Chapter 3 completed…