WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 12 Duality Theory.

Slides:



Advertisements
Similar presentations
Solving Linear Programming Problems
Advertisements

Tuesday, March 5 Duality – The art of obtaining bounds – weak and strong duality Handouts: Lecture Notes.
DMOR Linear Programming 2. Solving LPs – general case Till now we talked about the standard form – Maximization – Constraints of the form – RHS of the.
1 Outline relationship among topics secrets LP with upper bounds by Simplex method basic feasible solution (BFS) by Simplex method for bounded variables.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 17 Integer Programming.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 20 Network Problems.
WOOD 492 MODELLING FOR DECISION SUPPORT
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 15 Forest Planning.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 16 Integer Programming.
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
ECE Longest Path dual 1 ECE 665 Spring 2005 ECE 665 Spring 2005 Computer Algorithms with Applications to VLSI CAD Linear Programming Duality – Longest.
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.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 10 Introduction to Sensitivity Analysis.
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.
Linear Programming: Simplex Method and Sensitivity Analysis
LP EXAMPLES.
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 6 LP Assumptions.
Basic Linear Programming Concepts Lecture 2 (4/1/2015)
ISM 206 Lecture 4 Duality and Sensitivity Analysis.
Computational Methods for Management and Economics Carla Gomes
Linear Programming: Fundamentals
ISM 206 Lecture 4 Duality and Sensitivity Analysis.
Graduate Program in Business Information Systems Linear Programming: Sensitivity Analysis and Duality Aslı Sencer.
Department of Business Administration
The Theory of the Simplex Method
Presentation: H. Sarper
Mathematical Programming Cht. 2, 3, 4, 5, 9, 10.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Chapter 6 Sensitivity Analysis & Duality
Duality Theory LI Xiaolei.
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Introduction to Operations Research
WOOD 492 MODELLING FOR DECISION SUPPORT
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 9 Intro to Sensitivity Analysis.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 3 Basics of the Simplex Algorithm.
Duality Theory.
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
Linear Programming Erasmus Mobility Program (24Apr2012) Pollack Mihály Engineering Faculty (PMMK) University of Pécs João Miranda
Advanced Operations Research Models Instructor: Dr. A. Seifi Teaching Assistant: Golbarg Kazemi 1.
 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 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.
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 13 Duality Theory.
Part 3 Linear Programming 3.3 Theoretical Analysis.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 14 Sensitivity Analysis.
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.
Part 3 Linear Programming 3.3 Theoretical Analysis.
Chapter 3: Sensitivity Analysis and the Dual Problem & Shadow Prices
MID-TERM EXAM/REVISION
Chap 10. Sensitivity Analysis
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Chapter 5 Simplex-Based Sensitivity Analysis and Duality
The Simplex Method: Standard Minimization Problems
Duality Theory and Sensitivity Analysis
Part 3 Linear Programming
Basic Linear Programming Concepts
St. Edward’s University
ENGM 631 Optimization.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Lecture 4 Part I Mohamed A. M. A..
Chapter-III Duality in LPP
Practical Issues Finding an initial feasible solution Cycling
Presentation transcript:

WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 12 Duality Theory

Quiz 3 A multi period production plan –Maximize revenue –Limited production capacity –Limited storage capacity –Seasonal demand –Storage costs Oct 1, 2012Wood Saba Vahid2 Quiz3 matrix

The Dual model Each LP problem, has another LP problem associated with it, called “the dual problem” Relationship between the original LP (Primal) and the dual model is very useful in solving large models and performing sensitivity analysis Use the example from lecture 9 to understand the dual problem –Produce 5 products using 3 moulders, 2 sanders and labor –Factory works 2 shifts, 8 hours per shift, 6 days / week –Each product takes 20 hrs of labor, with 8 workers working 48hrs/wk Oct 1, 2012Wood Saba Vahid3

The primal model Find the unit value of each resource to minimize the total value of the resources used to produce the optimal solution (of the primal model) Therefore, our objective is to: minimize total value of resources Unit value of a resource: its contribution to the profits Our resources (i.e. decision variables): –moulder = contribution of each hour of moulding to total profits (Y1) –sander = contribution of each hour of sanding to total profits (Y2) –labor = contribution of each hour of labor to total profits (Y3) Oct 1, 2012Wood Saba Vahid4

The objective function: Min Total value of resources = ∑ (amount of allocated resource * unit value of the resource) Min Z = total moulding hrs * Y1+ total sanding hrs * Y2+ total labor hrs * Y3 Min Z = 288 Y Y Y3 Oct 1, 2012Wood Saba Vahid5

The constraints Each unit of Prod 1 uses 12 hours of moulding, 10 hours of sanding, and 20 hours of labor and contributes $550 to profits This mix of resources (moulder, sander and labor hrs) used for making Prod1 may also be used in other ways, as long as they generate at least $550 (otherwise we would use them to make Prod1) So the total contributions of this mix of resources to profits should be at least $550 Total contributions to profit => Y Y Y3 =>550 Use the same logic to write down the remaining four constraints Oct 1, 2012Wood Saba Vahid6

The dual problem Y1, Y2, and Y3 : contribution of each resource to profits Min Z = 288 Y Y Y3 S.t. 12 Y Y Y3 => Y1 + 8 Y Y3 => Y Y3 => Y Y3 =>400 15Y Y3 =>200 All contributions to profits should be =>0, so all Y i =>0 Oct 1, 2012Wood Saba Vahid7

Solution to the dual model Oct 1, 2012Wood Saba Vahid8 Y1Y2Y3 1.The final contribution to profits for this mix of resources is the same as the price of Prod1 and Prod2, so the resource are allocated to producing Prod1 and Prod2 2.The final contribution of this mix of resources is higher than the prices of the products, so they are already being used in a more profitable way and should not be assigned to produce Prod3, Prod4, and Prod

Constructing the dual problem To generate the dual model from the primal model (in standard form): –Variables in primal model will be represented by constraints in the dual model and vice versa –Change Maximization to Minimization and “ “ –The Obj. Fn. Coefficients will be the RHS in the dual problem –The RHS parameters will be the Obj. Fn. Coefficients –Coefficients related to each variable in the primal model will be used to construct the corresponding dual constraint Oct 3, 20129Wood Saba Vahid

Example: primal model (from Lecture 9) Primal objective : maximization → dual objective : minimization Primal model has 3 constraints → dual model has 3 variables Dual objective coefficients are the RHS parameters of the primal model: 288, 192, and 384 –Primal objective: Max Z =550 Prod Prod Prod Prod Prod5 –Dual objective: Min Z = 288 Moulder Sander Labor Oct 1, 2012Wood Saba Vahid10 Max Z Moulder Sander Labor

Example: primal-dual model (from Lecture 9) Dual objective: Min Z = 288 Moulder Sander+ 384 Labor Primal model has 5 variables→ dual model has 5 constraints Dual RHS values are the objective coefficients of the primal model: 550, 600, 350, 400 and 200 Each variable in primal model is represented by a constraint in dual model: –Constraint related to Prod1: 12 moulder + 10 sander + 20 labor => 550 –Constraint related to Prod2: 20 moulder + 8 sander + 20 labor => 600 Oct 1, 2012Wood Saba Vahid11 Max Z

The dual model properties Important : Strong Duality property Optimal solution of the dual model= Optimal solution of the primal model Symmetry property: For any primal and its dual problem, all relationships between them must be symmetric because the dual of a dual problem, is the primal problem – therefore, it doesn’t matter which problem you call primal or dual Duality Theorem (relationship between dual and primal) –If one problem has an optimal solution, so does the other –If one problem has feasible solutions with an “unbounded” objective function (no optimal value), then the other problem has no feasible solution –If one problem has no feasible solution, the other problem has either no feasible solutions, or an unbounded objective function Oct 1, 2012Wood Saba Vahid12

Applications of the dual model In solving LPs with the Simplex method, the more variables and constraints we have, the more computational effort is required –However, the number of constraints has a stronger impact on the required computational effort (compared to the number of variables) –If: number of constraints> number of variables, solving the dual model with Simplex reduces the computational effort and results in the same optimal solution In an algorithm for solving LP problems called the “dual simplex” method which is very useful in re-optimization and sensitivity analysis In generating insight into the primal model through economic interpretations of the dual model Oct 1, 2012Wood Saba Vahid13

Next Class Economic interpretations of duality 14Wood Saba VahidOct 1, 2012