1. 2 3 Special Variables: 1- Slack Variable (s1): represents the amount by which the available amount of the resources exceeds its usage by the activities.

Slides:



Advertisements
Similar presentations
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
Advertisements

© 2003 Anita Lee-Post Linear Programming Part 2 By Anita Lee-Post.
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
Lesson 08 Linear Programming
LIAL HORNSBY SCHNEIDER
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
SIMPLEX METHOD FOR LP LP Model.
Chapter 2: Modeling with Linear Programming & sensitivity analysis
CCMIII U2D4 Warmup This graph of a linear programming model consists of polygon ABCD and its interior. Under these constraints, at which point does the.
Chapter 6 Linear Programming: The Simplex Method
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Feb 18, 2013.
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Holiday Meal Turkey Ranch
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Linear Programming: Formulations & Graphical Solution.
19 Linear Programming CHAPTER
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
Operation Research Chapter 3 Simplex Method.
Linear Programming Solution Techniques: Graphical and Computer Methods
Introduction to Management Science
6s-1Linear Programming CHAPTER 6s Linear Programming.
1 Linear Programming Using the software that comes with the book.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Linear Programming: Model Formulation and Graphical Solution
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
Chapter 3 An Introduction to Linear Programming
John Loucks Modifications by A. Asef-Vaziri Slides by St. Edward’s
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
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,
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Kerimcan OzcanMNGT 379 Operations Research1 LP: Sensitivity Analysis and Interpretation of Solution Chapter 3.
LINEAR PROGRAMMING SIMPLEX METHOD.
1 The Role of Sensitivity Analysis of the Optimal Solution Is the optimal solution sensitive to changes in input parameters? Possible reasons for asking.
1 1 Slide © 2005 Thomson/South-Western Slides Prepared by JOHN S. LOUCKS ST. EDWARD’S UNIVERSITY.
Managerial Decision Making and Problem Solving
1 1 Slide Linear Programming (LP) Problem n A mathematical programming problem is one that seeks to maximize an objective function subject to constraints.
1 Linear Programming: Model Formulation and Graphical Solution.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 15.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
Chapter 6 Supplement Linear Programming.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization Problem n Graphical Solution Procedure.
1 1 Slide © 2005 Thomson/South-Western Simplex-Based Sensitivity Analysis and Duality n Sensitivity Analysis with the Simplex Tableau n Duality.
Introduction to linear programming:- - Linear programming (LP) applies to optimization models in which the objective and constraints functions are strictly.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Sensitivity analysis continued… BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12 th edition – some slides are directly.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
LINEAR PROGRAMMING.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
 LP graphical solution is always associated with a corner point of the solution space.  The transition from the geometric corner point solution to the.
2-1 Modeling with Linear Programming Chapter Optimal Solution for New Objective Function Graphical Solution of Maximization Model (12 of 12) Maximize.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
Introduction Operations Research (OR) It is a scientific approach to determine the optimum (best) solution to a decision problem under the restriction.
P RIMAL -D UAL LPP. T HE R EDDY M IKKS C OMPANY - PROBLEM Reddy Mikks company produces both interior and exterior paints from two raw materials, M 1 and.
Linear Programming Models: Graphical and Computer Methods 7 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
An Introduction to Linear Programming
Linear Programming.
Linear Programming Many problems take the form of maximizing or minimizing an objective, given limited resources and competing constraints. specify the.
Graphical Analysis – the Feasible Region
Linear Programming.
Chapter 3 The Simplex Method and Sensitivity Analysis
Linear Programming SIMPLEX METHOD.
Introduction to Linear Programming
Presentation transcript:

1

2

3 Special Variables: 1- Slack Variable (s1): represents the amount by which the available amount of the resources exceeds its usage by the activities.  To find the slack for a ≤ constraint algebraically, we add a slack variable to the constraint and convert it into an equality.  Ex: In Reddy Mikks model The constraint 6x 1 + 4x 2  24 associated with the usage of raw material M1 is equivalent to 6x 1 + 4x 2 + s 1 = 24 provided that s 1 ≥ 0 The slack variable s 1 =24 - 6x 1 - 4x 2 represents the unused amount of raw material M1

4 2- Surplus Variable (S1) : represents the excess of the left hand side over the minimum requirement.  To find the surplus for a ≥ constraint, we subtract a surplus variable from the left-hand side to make it an equality.  Ex: In Diet Model The constraint representing minimum feed requirement, x 1 + x 2 ≥ 800 is equivalent to x 1 + x 2 - S 1 = 800 provided that S 1 ≥ 0 A positive value of S 1 signifies that a surplus amount of feed ( over the minium requirement of 800Ib) will be produced. 3- Unrestricted Variable : In both Reddy Mikks and Diet model, the nature of variables requires them to assume nonnegative values. But there are other situations where variable can assume any real value.

5 Example: McBurger fast – food restaurant sells quarter-pounder and cheeseburger. A quarter-pounder uses a quarter of pound of meat, and cheeseburger uses only 0.2 Ib. The restaurant starts the day with 200 Ib of meat but may order more at an additional cost of 25 cents per pound to cover the delivery cost. Any surplus meat at the end of the day is donated at HotSoup Charity. McBurger’s profits are 20 cents from a quarter pounder and 15 cents for a cheeseburger. All in all, McBurger doesn’t expect to sell more than 900 sandwich in any one day. How many of each sandwich should McBurger make?

6 Solution: Assume x 1 The daily number of quarter-pounders made x 2 The daily number of cheeseburger made The constraints: 0.25x1+ 0.2x 2  200 In first case (Slack) 0.25x x 2 ≥ 200 In second case (Surplus) We consider x 3 as unrestricted that allows the variable to play the roles of both a slack and a surplus as desired 0.25x x 2 + x 3 = 200

7 The objective function: Maximize the total profit, less any additional cost that may be incurred as a result of ordering special delivery of additional pounds of meat The additional cost is incurred only if x 3 < 0 (role of surplus)  Dealing with an unrestricted variable is cumbersome. So we use standard substitution that converts the unrestricted variable into two nonnegative variables X 3 = x x 3 - x 3 +, x 3 - ≥ 0 If x 3 + >0 and x 3 - =0 x 3 + plays a role of slack If x 3 - >0 and x 3 + =0 x 3 - plays a role of surplus The constraint can be expressed as: 0.25x x 2 + x x 3 - = 200 The objective function is expressed as: Maximize z =0.2 x x x 3 -

8 Sensitivty Analysis: Studying the effect of making changes in the model parameters on a given optimum LP solution. 1) Changes in the objective function coefficient The objective function (Two variable- maximize or minimize )can be expressed as: z = c 1 x 1 + c 2 x 2 The change in the coefficients c 1 and c 2 will change the slope of z which lead to changing the optimum solution to a different corner point of the solution space. So we need to determine the range of optimality for the ratio or that will keep the optimum solution unchanged. Corner point: A point that lies at the intersection of two (or possibly more) constraint lines on the boundary of the feasible region. No interior points in the feasible region need be considered because at least one corner point is better than any interior point

9 Example: In Reddy Mikks problem.

10 The objective function was Z = 5x 1 + 4x 2 If we change the objective function to Z = c 1 x 1 + c 2 x 2 The solution at C point will remain optimum. As the slope of z lies between the slopes of two line intersecting C--- namely 6x 1 + 4x 2  24 raw material M1 x 1 + 2x 2  6 raw material M2 We can express this relationship algebraically: or The line cannot to be horizontal The line cannot to be vertical

11 If c 2 remain equal to 4, then Similarly, If we specify c 1 equal to 5, then

12 2) Unit Worth of a Resource ( Changes in in the right hand – side of the constraints)  Quantifies the rate of change in the optimum value in the objective function as a result of making changes in the availability of the resource.

13 Example: In Reddy Mikks model: The first constraints represent the limitations on the usage of raw material, M1 and M2, respectively. Determine the worth per unit for each resource. Solution:  The worth per unit for raw material M1

14  Point C is the current optimum solution which is the intersection of lines associated with raw materials.  Changing In M1 (increase or decrease around current level of 24 tons), the optimum solution point C will slide along the line segment DG.  Any change in M1 outside the range of line segment DG will make the intersection point C infeasible.  End points D=(2.2) and G=(6.0) delineate the feasibility range for M1  The amount of M1 associated with point D is computed as 6 x x 2 =20 tons.  Similarly, The amount of M1 associated with point G is computed as 6 x x 2 =36 tons. Thus the range of feasibility for M1 is  Equivalently, if M1=24+ D1, (D1 is the change in the raw material above or below the current level f 24 tons, then 20  24+ D1  36 or -4  D1  12

15  End points D=(2.2) and G=(6.0) delineate the feasibility range for M1  The amount of M1 associated with point D is computed as 6 x x 2 =20 tons.  Similarly, The amount of M1 associated with point G is computed as 6 x x 2 =36 tons. Thus the range of feasibility for M1 is  Let y 1 represent the worth per unit of raw material M1  Given D= (2.2) and G= (6.0) then, z at D = 5*2 +4*2 = 18 (thousand dollars) z at G = 5*6 +4*0 = 30 (thousand dollars)  As a result, the 1-ton change in M1 in range 20  M1  36 will change optimum value of z by 750$

16  The worth per unit for raw material M2

17  End points B=(4,0) and H=(8/3, 2) delineate the feasibility range for M1  The amount of M2 associated with point B is computed as x x 2 =4 tons.  Similarly, The amount of M2 associated with point H is computed as x x 2 =20/3 tons. Thus the range of feasibility for M1 is  Let y 2 represent the worth per unit of raw material M2 Given B= (4,0) and H= (8/3, 2) then, z at B = 5*4 +4*0 = 20(thousand dollars) z at H = 5*8/3 +4*2 = 64/3 (thousand dollars)  As a result, the 1-ton change in M1 in range 20  M1  36 will change optimum value of z by 500$