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.

Slides:



Advertisements
Similar presentations
Tuesday, March 5 Duality – The art of obtaining bounds – weak and strong duality Handouts: Lecture Notes.
Advertisements

Summary of complementary slackness: 1. If x i ≠ 0, i= 1, 2, …, n the ith dual equation is tight. 2. If equation i of the primal is not tight, y i =0. 1.
With Vegetable Farm Example
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
5.2 Linear Programming in two dimensions: a geometric approach In this section, we will explore applications which utilize the graph of a system of linear.
1 Chapter 6 Sensitivity Analysis and Duality PART 3 Mahmut Ali GÖKÇE.
Optimization using Calculus
Who Wants to be an Economist? Part II Disclaimer: questions in the exam will not have this kind of multiple choice format. The type of exercises in the.
Constrained Maximization
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.
7(3) Shadow Prices   Economic interpretation?
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Chapter 4 The Simplex Method
Linear-Programming Applications
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
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.
Optimization Techniques Methods for maximizing or minimizing an objective function Examples –Consumers maximize utility by purchasing an optimal combination.
Significance of Resource Pricing Marginal Productivity Theory of Resource Demand MRP as a Demand Schedule Determinants of Resource Demand Optimum.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Business and Economic Applications. Summary of Business Terms and Formulas  x is the number of units produced (or sold)  p is the price per unit  R.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Do the algebra required to find a simultaneous solutions to these two equations (from last class): 3x 1 + x 2  3 x 1 + 3x 2  5 1.
Analytical Tools Marginal analysis Discounted cash flow.
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.
CDAE Class 11 Oct. 3 Last class: Result of Quiz 2 2. Review of economic and business concepts Today: Result of Quiz 2 3. Linear programming and applications.
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
The Simplex Method. Standard Linear Programming Problem Standard Maximization Problem 1. All variables are nonnegative. 2. All the constraints (the conditions)
Introduction to Operations Research
CDAE Class 12 Oct. 5 Last class: Quiz 3 3. Linear programming and applications Today: Result of Quiz 3 3. Linear programming and applications Next.
Chapter Six Cost-Volume-Profit Relationships. CVP ANALYSIS Cost Volume Profit analysis is one of the most powerful tools that helps management to make.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
Objective : Solving systems of linear equations by graphing System of linear equation two or more linear equations How do I solve linear systems of equations?
Professional software packages such as The WinQSB and LINDO provide the following LP information: Information about the objective function: –its optimal.
Advanced Operations Research Models Instructor: Dr. A. Seifi Teaching Assistant: Golbarg Kazemi 1.
Analytical Tools Marginal analysis Discounted cash flow.
Faculty of Economics Optimization Lecture 3 Marco Haan February 28, 2005.
1 SM1.21 Managerial Economics Welcome to session 2 Optimization Techniques and New Management Tools.
Risk Management with Coherent Measures of Risk IPAM Conference on Financial Mathematics: Risk Management, Modeling and Numerical Methods January 2001.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 13 Duality Theory.
Chapter 3 Profit and costs1 CHAPTER 3 Profit maximisation, input demand, output supply and duality.
1 THE REVISED SIMPLEX METHOD CONTENTS Linear Program in the Matrix Notation Basic Feasible Solution in Matrix Notation Revised Simplex Method in Matrix.
3.4: Linear Programming Objectives: Students will be able to… Use linear inequalities to optimize the value of some quantity To solve linear programming.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
Linear Programming Department of Business Administration FALL by Asst. Prof. Sami Fethi.
Linear Programming Wyndor Glass Co. 3 plants 2 new products –Product 1: glass door with aluminum framing –Product 2: 4x6 foot wood frame window.
Use duality theory to check if the solution implied by the dictionary is correct. Maximize x x x 3 subject to 1 x x x 3 ≤ 5 1 x.
Analytical Tools Marginal analysis Discounted cash flow.
Part 3 Linear Programming 3.3 Theoretical Analysis.
MID-TERM EXAM/REVISION
Linear Programming: Sensitivity Analysis and Duality
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
Business Economics The Behavior of Firms.
3-2: Solving Systems of Equations using Substitution
Chap 9. General LP problems: Duality and Infeasibility
Solve a system of linear equation in two variables
The Simplex Method: Standard Minimization Problems
3-2: Solving Systems of Equations using Substitution
Duality Theory and Sensitivity Analysis
Part 3 Linear Programming
3-2: Solving Systems of Equations using Substitution
3-2: Solving Systems of Equations using Substitution
3-2: Solving Systems of Equations using Substitution
3-2: Solving Systems of Equations using Substitution
Linear Programming Mr. Carpenter Alg. 2.
3-2: Solving Systems of Equations using Substitution
3-2: Solving Systems of Equations using Substitution
Linear Programming.
Presentation transcript:

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 for x? Check to see if this holds for x= (3, 0) Maximize 2 x x 2 subject to 1 x 1 – 1 x 2 ≤ 3 1 x x 2 ≤ 9 x 1, x 2 ≥ 0

Shane Hall: “The challenge of maximizing satisfaction within a set of limits makes linear programming an ideal tool of analysis for economics, which studies the ways in which households, businesses and societies allocate limited resources to achieve needs and wants.”

Manufacturing Problems Suppose that: The problem is to maximize profit. Each x j measures the level of output of the jth product. Each b i specifies available amount of ith resource. Each a ij is the units of resource i required for product j. Each c j is profit in dollars per unit of product j. How should the dual variables be interpreted in order for the equations to make sense?

Forestry Example: 100 acres, $ Wood type Cost to harvest Selling price ProfitSolution Hardwood Pine Maximize Profit 40 X X 2 subject to X 1 + X 2 ≤ X X 2 ≤4000 X 1, X 2 ≥ 0 Product 1 : Hardwood. Product 2 : Pine. Resource 1 : Acres of land. Resource 2 : Dollars.

The primal: Maximize c T x subject to Ax ≤ b, x ≥ 0. The dual: Minimize b T y subject to A T y ≥ c y ≥ 0.

Each a ij is the units of resource i required for product j. Each c j is profit in dollars per unit of product j. a 1i y 1 + a 2i y a mi y m ≥ c i [Units res. 1 for product i][ ? y 1 ] + [Units res. 2 for product i][ ? y 2 ] +... [Units res. m for product i][ ? y m ] ≥ [ Dollars per unit of product i]

Each a ij is the units of resource i required for product j. Each c j is profit in dollars per unit of product j. a 1i y 1 + a 2i y a mi y m ≥ c i To make this work, we need: [Units res. 1/prod. i][Dollars/Unit res.1]+ [Units res. 2/prod. i][Dollars/Unit res.2]+... [Units res. m/prod. i][Dollars/Unit res. m] ≥ [ Dollars / prod. i] So, y i is expressed in terms of dollars per unit of resource i.

Let y * be the optimal solution to the dual. With each extra unit of resource i, the profit increases by y i * dollars. So, y i * represents the extra amount the firm should be willing to pay over and above the current trading price for each extra unit of resource i. Definitions y= * is called the marginal value of the ith resource. Marginal- difference between trading price and actual worth. y i * is also called the shadow price of the ith resource.

9 Maximize Profit 40 X X 2 subject to X 1 + X 2 ≤ X X 2 ≤4000 Looking at the Units: hard= acres of hardwood, pine= acres of pine. Maximize (profit/hard)(hard) + (profit/pine) (pine) =profit subject to (acres/hard) (hard) + (acres/pine) (pine) ≤ acres (dollars/hard)(hard) + (dollars/pine)(pine) ≤ dollars Product 1 : Hardwood. Product 2 : Pine. Resource 1 : Acres of land. Resource 2 : Dollars.

10 Looking at the DUAL Units: hard= acres of hardwood, pine= acres of pine. Maximize (profit/hard) (hard)+ (profit/pine) (pine) =profit subject to (acres/hard) (hard) + (acres/pine) (pine) ≤ acres (dollars/hard) (hard) + (dollars/pine) (pine) ≤ dollars

11 Looking at the DUAL Units: hard= acres of hardwood, pine= acres of pine. Maximize (profit/hard) (hard)+ (profit/pine) (pine) =profit subject to (acres/hard) (hard) + (acres/pine) (pine) ≤ acres (dollars/hard) (hard) + (dollars/pine) (pine) ≤ dollars The units are: y 1 : profit/acre y 2 : profit/dollar

12 Dual solution: y 1 = 32.5, y 2 = 0.75 y 1 : profit/acre, y 2 : profit/dollar Conclusion: One extra acre would result in $32.50 extra profit. One extra dollar in capital results in 0.75 profit. Renting one acre at less than $32.50 results in more profit. Borrowing money at less than 0.75 interest rate results in more profit. We already covered the update formulas for this problem when there is a change to the bi's.