WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 13 Duality Theory.

Slides:



Advertisements
Similar presentations
Solving Linear Programming Problems
Advertisements

WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 12 Duality Theory.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 15 Forest Planning.
With Vegetable Farm Example
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
EMGT 501 HW #1 Solutions Chapter 2 - SELF TEST 18
Understanding optimum solution
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
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
LP EXAMPLES.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 6 LP Assumptions.
Basic Linear Programming Concepts Lecture 2 (4/1/2015)
Linear Programming Excel Solver. MAX8X 1 + 5X 2 s.t.2X 1 + 1X 2 ≤ 1000 (Plastic) 3X 1 + 4X 2 ≤ 2400 (Prod. Time) X 1 + X 2 ≤ 700 (Total Prod.) X 1 - X.
Duality Dual problem Duality Theorem Complementary Slackness
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 99 Chapter 4 The Simplex Method.
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Linear Programming: Fundamentals
Chapter 4 The Simplex Method
Solver Linear Problem Solving MAN Micro-computers & Their Applications.
Use complementary slackness to check the solution: ( 20/3, 0, 16/3, 0) Maximize 9 x 1 -3 x x 3 -7 x 4 subject to 2 x x x x 4 ≤
Graduate Program in Business Information Systems Linear Programming: Sensitivity Analysis and Duality Aslı Sencer.
LINEAR PROGRAMMING SIMPLEX METHOD.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 1 Introduction to Operations Research.
Presentation: H. Sarper
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Mathematical Programming Cht. 2, 3, 4, 5, 9, 10.
Duality Theory 對偶理論.
STDM - Linear Programming 1 By Isuru Manawadu B.Sc in Accounting Sp. (USJP), ACA, AFM
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc. 1 Chapter 6 Sensitivity Analysis and Duality to accompany Introduction to Mathematical.
Chapter 6 Sensitivity Analysis & Duality
Duality Theory LI Xiaolei.
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.
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.
Question from last class: If you have a primal feasible solution x, and solve for y using duality theory, does having c T x= b T y guarantee optimality.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 4-5 LP Formulation Example and Excel Solver.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 11 Sensitivity Analysis.
WOOD 492 MODELLING FOR DECISION SUPPORT
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
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.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.3 The student will be able to formulate the dual problem. The student.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 7 LP Formulation Examples.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Part 3 Linear Programming 3.3 Theoretical Analysis.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 18 Branch and Bound Algorithm.
OR Chapter 7. The Revised Simplex Method  Recall Theorem 3.1, same basis  same dictionary Entire dictionary can be constructed as long as we.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 14 Sensitivity Analysis.
1 Lecture 12 Chapter 7 Duality and Sensitivity in Linear Programming 7.1 Objective values usually can be interpreted as either minimize cost or maximize.
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.
MID-TERM EXAM/REVISION
Linear Programming: Sensitivity Analysis and Duality
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.
MBA 651 Quantitative Methods for Decision Making
Chapter 5 Simplex-Based Sensitivity Analysis and Duality
The Simplex Method: Standard Minimization Problems
Duality Theory and Sensitivity Analysis
St. Edward’s University
Linear Programming SIMPLEX METHOD.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Presentation transcript:

WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 13 Duality Theory

The Dual Problem Oct 3, 20122Wood Saba Vahid Another way of looking at a linear program Has the same optimal value for the objective function as the primal model The shadow prices of the dual model, are the optimal values of the decision variables in the primal model and vice versa –Extremely helpful when we can solve the dual model but not the primal one (e.g. large primal model which are computationally intensive)

Re-visiting the last example Oct 3, 20123Wood Saba Vahid

The constraints What does this constraint mean? 12 Y Y Y3 =>550 Y1 is the marginal value of resource 1 (moulding) when the optimum profits are being produced Y2 and Y3 are defined similarly (12 Y Y Y3) = total marginal value of producing 1 unit of product 1 $550 = marginal profit of 1 unit of product 1 If the total value of resources used and the total profits are the same, it is worth producing product 1, other wise it’s not worth it Oct 3, 20124Wood Saba Vahid

Oct 3, 2012Wood Saba Vahid5 Y1Y2Y3 16 Y Y3 is valued at $475 (with the current valuation as shown in the answer row) Product 3 produces $350 profits, so it doesn’t make sense to use these resources for making product 3 (for example, you are better off selling these resources in a “market” at their current value)

Shadow prices and reduced costs The results of the dual model are the shadow prices for the primal model and vice versa Shadow prices show a form of internal pricing/valuation for the resources at the optimal level: –How much is a resource worth for producing the optimal result –E.g. an hour of labor is worth $23.75 to the firm Reduced cost is calculated from the dual model as: Reduced cost = RHS (in the dual problem) – actual constraint value e.g. reduced cost of product 3 = 350 – 475 = -125 –So the actual value of the constraint (e.g. 475) shows the price that will make it feasible to produce product 3 Oct 3, 2012Wood Saba Vahid6

Dual-primal relationship Oct 3, 2012Wood Saba Vahid7 Primal (Maximize) Dual (Minimize) ith constraint 0 ith constraint =>ith variable <= 0 ith constraint = ith variable unrestricted j th variable =>0j th constraint => j th variable <= 0 j th constraint <= j th variable unrestricted j th constraint = ith constraint is bindingith variable is non-zero jth variable is non-zerojth constraint is binding

Lab 4 preview Harvest scheduling –3 stands with different ages and species –Different harvest regimes (based on the period of first cut, first cut can happen in any period*) * Note this is different from what we discussed in the class. There is now no restrictions on when the first cut can happen –Considering the total forest inventory (standing tree volume) –Even-flow restrictions –Beginning and ending inventory limits –Growth and yield volumes (how much trees grow in each period) Our objective is to maximize the total harvest (over 8 decades) Our decision variable is the total area (ha) in each stand to manage with each harvest regime –e.g. how many ha of stand 1 should we harvest in the first period (S1_P1) –e.g. how many ha of stand 3 should we leave uncut (S3_uncut) Oct 3, 2012Wood Saba Vahid8

Data tables The first table is related to existing (natural) stands Shows the available timber volume in the stands in each decade (decade 1 shows the current age of the stands) Oct 3, 2012Wood Saba Vahid9 The second table is related to regenerated stands (natural stands after being harvested once) Shows the available timber volume in the stands after different periods of growth

Data tables Yield tables show the harvest volumes per ha in each decade, depending on the period in which the first cut happens (the column headings correspond to our decision variables) e.g. for stand 1, if we choose to enter in the first period (first column), we will harvest 490 m3/ha (value extracted from the natural stands table), and then we will have to wait three decades before being able to harvest again, in which case we will get 364 m3/ha (value extracted from the regenerated stands table) Oct 3, 2012Wood Saba Vahid10 Fill the rest of the data table

Data tables Ending inventory tables, show the remaining volume of timber in the stands (m3/ha) at the end of each period, depending on when the first cut happens E.g. when we enter stand 1 in the first period, the remaining volume at the end of decade 1 is “0” because we have just harvested it. At the end of decade2 and 3, there is a growing inventory of standing timber (42 and 224 m3/ha, values extracted from the regenerated stands table), and since we harvest again in decade 4, the inventory drops to “0” again. Oct 3, 2012Wood Saba Vahid11 Fill the rest of the data table Lab 4 matrix

Next Class Economic interpretations of duality Oct 3, Wood Saba Vahid