IENG313 Operation Research I

Slides:



Advertisements
Similar presentations
Chapter 5: Linear Programming: The Simplex Method
Advertisements

Operation Research Chapter 3 Simplex Method.
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
LECTURE 14 Minimization Two Phase method by Dr. Arshad zaheer
Notes 4IE 3121 Why Sensitivity Analysis So far: find an optimium solution given certain constant parameters (costs, demand, etc) How well do we know these.
Sensitivity Analysis Sensitivity analysis examines how the optimal solution will be impacted by changes in the model coefficients due to uncertainty, error.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 9-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 9 Linear.
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
SENSITIVITY ANALYSIS.
LP EXAMPLES.
Chapter 7 Linear Programming Models Part One n Basis of Linear Programming n Linear Program formulati on.
Minimization by Dr. Arshad zaheer
Introduction to Management Science
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 99 Chapter 4 The Simplex Method.
Linear Programming: Fundamentals
3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.
5.6 Maximization and Minimization with Mixed Problem Constraints
D Nagesh Kumar, IIScOptimization Methods: M3L4 1 Linear Programming Simplex method - II.
Chapter 4 The Simplex Method
John Loucks Modifications by A. Asef-Vaziri Slides by St. Edward’s
Solver Linear Problem Solving MAN Micro-computers & Their Applications.
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.
Linear Programming - Standard Form
Readings Readings Chapter 3
Mathematical Programming Cht. 2, 3, 4, 5, 9, 10.
Chapter Topics Computer Solution Sensitivity Analysis
Chapter 6 Linear Programming: The Simplex Method
Managerial Decision Making and Problem Solving
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 15.
Simplex Algorithm.Big M Method
Topic III The Simplex Method Setting up the Method Tabular Form Chapter(s): 4.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.4 The student will be able to set up and solve linear programming problems.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming: The Simplex Method Chapter 5.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 Chapter 10 The primal linear program solution answers the tactical question when it tells us how much to produce. But the dual can have far greater impact.
Chapter 6 Supplement Linear Programming.
Introduction to Operations Research
Solving Linear Programming Problems: The Simplex Method
Business Mathematics MTH-367 Lecture 15. Chapter 11 The Simplex and Computer Solutions Methods continued.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Professional software packages such as The WinQSB and LINDO provide the following LP information: Information about the objective function: –its optimal.
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
 Minimization Problem  First Approach  Introduce the basis variable  To solve minimization problem we simple reverse the rule that is we select the.
1 1 Slide © 2005 Thomson/South-Western Linear Programming: The Simplex Method n An Overview of the Simplex Method n Standard Form n Tableau Form n Setting.
Chapter 4 Linear Programming: The Simplex Method
Chapter 6 Linear Programming: The Simplex Method Section 4 Maximization and Minimization with Problem Constraints.
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.
Sensitivity analysis continued… BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12 th edition – some slides are directly.
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Linear Programming: An Algebraic Approach 4 The Simplex Method with Standard Maximization.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
1 LP-3 Symplex Method. 2  When decision variables are more than 2, it is always advisable to use Simplex Method to avoid lengthy graphical procedure.
Decision Support Systems INF421 & IS Simplex: a linear-programming algorithm that can solve problems having more than two decision variables.
Solving Linear Program by Simplex Method The Concept
Chap 10. Sensitivity Analysis
The Simplex Method: Standard Minimization Problems
Duality Theory and Sensitivity Analysis
Sensitivity.
Lecture 4 Part I Mohamed A. M. A..
Applied Statistical and Optimization Models
Presentation transcript:

IENG313 Operation Research I

Reduced cost Slack or surplus Dual price

Reduced cost In a LINGO solution report, you’ll find a reduced cost figure for each variable. There are two valid, equivalent interpretations of a reduced cost. First, you may interpret a variable’s reduced cost as the amount that the objective coefficient of the variable would have to improve before it would become profitable to give the variable in question a positive value in the optimal solution. For example, if a variable had a reduced cost of 10, the objective coefficient of that variable would have to increase by 10 units in a maximization problem and/or decrease by 10 units in a minimization problem for the variable to become an attractive alternative to enter into the solution

Second, the reduced cost of a variable may be interpreted as the amount of penalty you would have to pay to introduce one unit of that variable into the solution. Again, if you have a variable with a reduced cost of 10, you would have to pay a penalty of 10 units to introduce the variable into the solution. In other words, the objective value would fall by 10 units in a maximization model or increase by 10 units in a minimization model.

Reduced Cost: If we increase one unit of a non-basic variable, how much the objective function will degrade (decrease)? For example, if we want to produce one unit of x2 then we have to produce 23 units of x1, so the objective function will be: (5*1) + (3*23) = 74. Then the reduced cost will be: 75 – 74 = 1

Dual price The LINGO solution report also gives a dual price figure for each constraint. You can interpret the dual price as the amount that the objective would improve as the right-hand side, or constant term, of the constraint is increased by one unit Notice that "improve" is a relative term. In a maximization problem, improve means the objective value would increase. However, in a minimization problem, the objective value would decrease if you were to increase the right-hand side of a constraint with a positive Dual prices are sometimes called shadow prices, because they tell you how much you should be willing to pay for additional units of a resource.

Dual Price If for example we increase (or decrease) one unit to the 2nd constraint (It is 25 now), then the objective function increase (or decrease) 3 units. Note: The second constraint is satisfied equally, so it is a Compulsory Constraint.

Slack or surplus The Slack or Surplus column in a LINGO solution report tells you how close you are to satisfying a constraint as an equality. This quantity, on less-than-or-equal-to (≤) constraints, is generally referred to as slack. On greater-than-or-equal-to (≥) constraints, this quantity is called a surplus. If a constraint is exactly satisfied as an equality, the slack or surplus value will be zero

Slack or Surplus: Zero: if a constraint is completely satisfied equality (third row or 2nd constraint). Positive: shows that how many more units of the variable could be added to the optimal solution before the constraint becomes an equality (2nd row: 60- (2*25)= 10) Negative: Constraint has been violated!