An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.

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.
IEOR 4004 Midterm review (Part II) March 12, 2014.
ECE Longest Path dual 1 ECE 665 Spring 2005 ECE 665 Spring 2005 Computer Algorithms with Applications to VLSI CAD Linear Programming Duality – Longest.
EMGT 501 HW #1 Solutions Chapter 2 - SELF TEST 18
Understanding optimum solution
Manufacturing Microwaves A company produces both small and large microwave ovens. Machine time: 4 hours for small ovens and 3 hours for large ones. A total.
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.
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.
SENSITIVITY ANALYSIS.
LP EXAMPLES.
Q 2-31 Min 3A + 4B s.t. 1A + 3B ≧ 6 B = - 1/3A + 2 1A + 1B ≧ 4
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 99 Chapter 4 The Simplex Method.
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Problem Set # 4 Maximize f(x) = 3x1 + 2 x2 subject to x1 ≤ 4 x1 + 3 x2 ≤ 15 2x1 + x2 ≤ 10 Problem 1 Solve these problems using the simplex tableau. Maximize.
QM B Lego Simplex. Scenario You manufacture tables and chairs. Tables and chairs are manufactured from small and large bricks. Small brick Large brick.
Chapter 4 The Simplex Method
Linear-Programming Applications
Computational Methods for Management and Economics Carla Gomes
Department of Business Administration
Decision Making via Linear Programming: A simple introduction Fred Phillips
PowerPoint presentation to accompany Operations Management, 6E (Heizer & Render) © 2001 by Prentice Hall, Inc., Upper Saddle River, N.J B-1 Operations.
Linear Programming Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
Presentation: H. Sarper
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
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.
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Transparency Masters to accompany Heizer/Render – Principles of Operations Management, 5e, and Operations Management, 7e © 2004 by Prentice Hall, Inc.,
Introduction to Operations Research
Duality Theory  Every LP problem (called the ‘Primal’) has associated with another problem called the ‘Dual’.  The ‘Dual’ problem is an LP defined directly.
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.
Department Of Industrial Engineering Duality And Sensitivity Analysis presented by: Taha Ben Omar Supervisor: Prof. Dr. Sahand Daneshvar.
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
A model consisting of linear relationships representing a firm’s objective and resource constraints Linear Programming (LP) LP is a mathematical modeling.
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
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
Linear Programming Revised Simplex Method, Duality of LP problems and Sensitivity analysis D Nagesh Kumar, IISc Optimization Methods: M3L5.
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.
EE/Econ 458 Duality J. McCalley.
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.
Part 3 Linear Programming 3.3 Theoretical Analysis.
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
Linear Programming. George Dantzig 1947 NarendraKarmarkar Pioneers of LP.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Linear Programming: An Algebraic Approach 4 The Simplex Method with Standard Maximization.
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.
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
MID-TERM EXAM/REVISION
Department of Management Information systems
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.
The Simplex Method: Standard Minimization Problems
Duality Theory and Sensitivity Analysis
Part 3 Linear Programming
If we increase b2 from 10 to 20 will the optimal basis change?
optimal basis will not change
Lecture 4 Part I Mohamed A. M. A..
Chapter 5. The Duality Theorem
optimal basis will not change
Case 2:( Model Construction):
Linear Programming.
Presentation transcript:

An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications MIS: Prepared by Mr.Maher Abubaker Fall 2015/2016 Resources Daniel J. Epstein Department of Industrial and Systems Engineering University of Southern California Andrew and Erna Viterbi School of Engineering Operations Research: An Introduction, 9/EHamdy A. Taha, University of ArkansasISBN-10: X ISBN-13: ©2011 Prentice Hall Cloth, 832 ppPublished 08/29/ Introduction/ page#downlaoddiv ™ INFORMS – ™ ORMS - ™ Science of Better -

Duality To every LP, there is a dual! A decision without optimization is like an arch without a keystone. …olde English saying circa 1871

Primal problem Max C t X AX <= b X>=0 Dual problem Min b t Y AY >= c Y>=0 From Primal To Dual Problem

A Primal Problem Let X = number of units of product A to manufacture x2 = number of units of product B to manufacture Max Profit = z = 5 x x 2 subject to: x x 2 <= 20 (labor-hours) 2 x x 2 <= 30 (machine hours) 6 x x 2 <= 180 ($ - raw material) x 1 >= 0, x 2 >= 0

The Dual Let y 1 = implicit value (cost) of one labor-hour y 2 = implicit value (cost) of one machine hour y 3 = implicit value (cost) of $1.00 for raw material Min y 0 = 20y y y 3 subject to: y 1 + 2y y 3 >= 5 2y 1 + 2y y 3 >= 15 y 1, y 2, y 3 >=0 Max z = 5 x x 2 subject to: x x 2 <= 20 2 x x 2 <= 30 6 x x 2 <= 180 From max to min From less than to greater than

It is quite clear now. The dual is assigning a (implicit) cost to each resource that minimizes the total cost of the available resources while insuring that the cost of the resources required to produce one unit of a product is at least as great as the profit obtained from that product. Gosh. It really doesn’t get any better than this does it? Min y 0 = 20y y y 3 subject to: y 1 + 2y y 3 >= 5 2y 1 + 2y y 3 >= 15 y 1, y 2, y 3 >=0

Aren’t there other names for the values of the dual variables? Dual Variables Implicit Values Implicit Costs Shadow Prices Opportunity Costs

Max z = 6x 1 + 4x 2 Subj. to: x 1 + x 2 <= 12 x 1 -2x 2 <= 6 x 2 <= 8 x 1, x 2 >= 0 Primal Min y 0 = 12y 1 + 6y 2 + 8y 3 subject to: y 1 + y 2 >= 6 y 1 - 2y 2 + y 3 >= 4 y 1, y 2, y 3 >= 0 Dual

The Final Tableau to the Primal Basic Eq Varzx 1 x 2 s1s2s3 RHS 0z 1x 2 2x 1 3s3 0102/31/ /31/ /3-1/ /32/3068 y1y1 y2y2 y3y3 y0y0

Initial & Final Tableau for Dual Problem Basic Eq Vary 0 y 1 y 2 y 3 y 4 y 5 y 6 RHS 0z M0 1x y Basic Eq Vary 0 y 1 y 2 y 3 y 4 y 5 y 6 RHS 0z y /3-1/31/3 -2/3 2y /3-2/3-1/3-16/3

Primal and Dual Problems