Another example Max z=5x1+12x2+4x3-MR S.t. x1+2x2+x3+x4=10

Slides:

Advertisements

Similar presentations

3 hr 5 hr 8 hr Hours worked Charge

Advertisements

Solving Linear Programming Problems

5.3 Inverse Function.

O A Corpo 1 Cinemática e Cinética de Partículas no Plano e no Espaço Análise Dinâmica dos Corpos O X Y X1X1 Y1Y1 X2X2 Y2Y2 X3X3 Y3Y3 A B P l = 75 mm l.

February 21, 2002 Simplex Method Continued

Thursday, March 7 Duality 2 – The dual problem, in general – illustrating duality with 2-person 0-sum game theory Handouts: Lecture Notes.

February 7, 2002 A brief review of Linear Algebra Linear Programming Models Handouts: Lecture Notes.

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

February 14, 2002 Putting Linear Programs into standard form

Graph of a Curve Continuity This curve is _____________These curves are _____________ Smoothness This curve is _____________These curves are _____________.

Graph of a Curve Continuity This curve is continuous

Slope of a Line 11-2 Warm Up Problem of the Day Lesson Presentation

Calculating Slope m = y2 – y1 x2 – x1.

Maximal Independent Subsets of Linear Spaces. Whats a linear space? Given a set of points V a set of lines where a line is a k-set of points each pair.

Linear Equations in Two Variables

Max output (Q) subject to a cost constraint

SENSITIVITY ANALYSIS. luminous lamps produces three types of lamps A, B And C. These lamps are processed on three machines X, Y and Z. the full technology.

TS: Explicitly assessing information and drawing conclusions Increasing & Decreasing Functions.

QingPeng (QP) Zhang  Sensitivity analysis is concerned with how changes in an linear programming’s parameters affect the optimal.

On / By / With The building blocks of the Mplus language.

Gradient of a straight line x y 88 66 44 2 44 4 For the graph of y = 2x  4 rise run  = 8  4 = 2 8 rise = 8 4 run = 4 Gradient = y.

0 “Applications” of knapsack problems 10 September 2002.

2 x0 0 12/13/2014 Know Your Facts!. 2 x1 2 12/13/2014 Know Your Facts!

WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 12 Duality Theory.

Extra Credit Problem 5 Page 76 Gothams Finest Group 3 Saud Aldegaiter Daniel Bonneville Tamara Vail October 18, 2011 IE 416 Dr. Parisay.

IEOR 4004 Midterm Review (part I)

Straight Line Equation.

5 x4. 10 x2 9 x3 10 x9 10 x4 10 x8 9 x2 9 x4.

EMIS 8374 LP Review: The Ratio Test. 1 Main Steps of the Simplex Method 1.Put the problem in row-0 form. 2.Construct the simplex tableau. 3.Obtain an.

Chapter 8: The Solver and Mathematical Programming Spreadsheet-Based Decision Support Systems Prof. Name Position (123) University.

Computational Facility Layout

LINEAR PROGRAMMING Modeling a problem is boring --- and a distraction from studying the abstract form! However, modeling is very important: --- for your.

Quiz Number 2 Group 1 – North of Newark Thamer AbuDiak Reynald Benoit Jose Lopez Rosele Lynn Dave Neal Deyanira Pena Professor Kenneth D. Lawerence New.

(1) MAX X1+3X2+2X3+4X4 X1=AM PHONE, X2=AM RIDE, X3=AFT PHONE, X4=AFT RIDE CONSTRAINTS AM: X1+20X2 < 12(60)=720 AFT: 2X3+30X4 < 14(60) = 840 GAS: X2+X4.

Simplex (quick recap). Replace all the inequality constraints by equalities, using slack variables.

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.

Understanding optimum solution

Introduction to Sensitivity Analysis Graphical 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.

SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.

Chapter 7 Linear Programming Models Part One n Basis of Linear Programming n Linear Program formulati on.

1 Chapter 6 Sensitivity Analysis and Duality PART 3 Mahmut Ali GÖKÇE.

Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.

Linear Programming: Fundamentals

1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.

QM B Lego Simplex. Scenario You manufacture tables and chairs. Tables and chairs are manufactured from small and large bricks. Small brick Large brick.

LINEAR PROGRAMMING: THE GRAPHICAL METHOD

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.

1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.

1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.

1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.

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 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.

WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 13 Duality Theory.

Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.

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.

SENSITIVITY ANALYSIS. 2 Sensitivity Analysis Sensitivity analysis is carried out after optimal solution is found. Hence called as post optimality analysis.

Chapter 5 Simplex-Based Sensitivity Analysis and Duality

The Simplex Method: Standard Minimization Problems

St. Edward’s University

ENGM 631 Optimization.

Linear Programming – Sensitivity Analysis

Presentation transcript:

Another example Max z=5x1+12x2+4x3-MR S.t. x1+2x2+x3+x4=10 2x1-x2+3x3+R=8 X1,x2,x3,x4,R >=0. The optimum table is in next slide, find the dual problem and its optimal solution

basic x1 x2 x3 x4 R sol z 3/5 29/5 -2/5+M 54+4/5 1 -1/5 2/5 12/5 7/5 1/5 26/5 Answer y1=29/5 y2= -2/5

Dual Price Z=W Z is the dollars and W should also be the dollars. W= ∑bi yi bi represents the number of units available of resource i. Therefore Dollars= unit of resource i X yi Hence yi= dollars/unit of resource I So yi or dual price or shadow price of a resource I is the worth per unit of resource i.

Dual Price Each dual price is associated with a constraint. It is the amount of improvement in the objective function value that is caused by a one-unit increase in the RHS of the constraint. It is also called Shadow Price.

More on Dual Price: A dual price can be negative, which shows a negative ( or worse off) contribution to the objective function value by an additional unit of RHS increase of the constraint.

Primal and Dual in LP Each linear program has another associated with it. They are called a pair of primal and dual. Primal and dual have equal optimal objective function values. The solution of the dual is the dual prices of the primal, and vice versa.