If we increase b2 from 10 to 20 will the optimal basis change?

Slides:



Advertisements
Similar presentations
Nonlinear Programming
Advertisements

Variables that are unrestricted in sign LI Xiao-lei.
Transportation Problem
Lecture 15 Special cases by Dr. Arshad Zaheer
Impact of selection for increased daughter fertility on productive life and culling for reproduction H. D. Norman, J. R. Wright*, R. H. Miller Animal Improvement.
The Simplex Method: Standard Maximization Problems
EMGT 501 HW #2 Due Day: Sep 27 Chapter 6 - SELF TEST 21
Duality Dual problem Duality Theorem Complementary Slackness
Sensitivity of the Objective Function Coefficients
Asset Classes 3.00% 4.00% 5.00% 6.00% 7.00% 8.00% 9.00% 10.00% 0.00%5.00%10.00%15.00%20.00%25.00%30.00% Expected Risk (standard deviation) Private Equity.
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.
Math – Getting Information from the Graph of a Function 1.
Linear Programming Sensitivity of the Objective Function Coefficients.
The Two-Phase Simplex Method LI Xiao-lei. Preview When a basic feasible solution is not readily available, the two-phase simplex method may be used as.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming: The Simplex Method Chapter 5.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
The Simplex Method Updated 15 February Main Steps of the Simplex Method 1.Put the problem in Row-Zero Form. 2.Construct the Simplex tableau. 3.Obtain.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
The big M method LI Xiao-lei.
Pareto Linear Programming The Problem: P-opt Cx s.t Ax ≤ b x ≥ 0 where C is a kxn matrix so that Cx = (c (1) x, c (2) x,..., c (k) x) where c.
Exercise Find a schedule that minimises makespan..
AP Economics Mr. Bordelon
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
Notes on Linear Programming Uwe A. Schneider. Linear Programming, 1 Max c 1 *X 1 +…+ c n *X n = z s.t. a 11 *X 1 +…+ a 1n *X n  b 1 … a m1 *X 1 +…+ a.
1 Simplex Method for Bounded Variables Linear programming problems with lower and upper bounds Generalizing simplex algorithm for bounded variables Reference:
 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 Linear Programming: The Simplex Method n An Overview of the Simplex Method n Standard Form n Tableau Form n Setting.
Chapter 4 Linear Programming: The Simplex Method
Sensitivity analysis LI Xiao-lei. A graphical introduction to sensitivity analysis Sensitivity analysis is concerned with how changes in an LP’s parameters.
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.
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
& 6.855J & ESD.78J Algorithm Visualization The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem.
The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem Thanks to Jim Orlin & MIT OCW.
Integer LP In-class Prob
Simplex Method for solving LP problems with two variables.
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
Introduction to Operations Research
Birds South Africa. Contents Bird1 Bird1 Bird2 Bird2 Bird3 Bird3.
Additional Topic for Ch.16: Optimal Price for Maximizing Revenue Warin Chotekorakul.
= the matrix for T relative to the standard basis is a basis for R 2. B is the matrix for T relative to To find B, complete:
Chap 10. Sensitivity Analysis
Relative Extrema and More Analysis of Functions
Birds Galore South Africa.
The Two-Phase Simplex Method
Consider corner pt. feasible A, B, C, D, E, F A: (0,0), Z = 0
Chapter 5 Simplex-Based Sensitivity Analysis and Duality
Increasing and Decreasing Functions and the First Derivative Test
(Fractions / Surds /Indices)
The Network Simplex Method
Chapter 4 Linear Programming: The Simplex Method
به نام خدا آشنایی با LINDO Software استاد :‌ راحله خاندوزی.
The Simplex Method: Standard Minimization Problems
Sensitivity Analysis and
St. Edward’s University
Well, just how many basic
optimal basis will not change
ENGM 435/535 Optimization Adapting to Non-standard forms.
4.3 1st & 2nd Derivative Tests
Lecture 4 Part I Mohamed A. M. A..
Homework Analyzing Graphs
optimal basis will not change
Linear Programming – Sensitivity Analysis
1 1 Find a maximum Matching ? Women Men.
Chapter 4 The Simplex Algorithm
Chapter-III Duality in LPP
The Network Simplex Method
Sec 4.3: HOW DERIVATIVES AFFECT THE SHAPE OF A GRAPH
Presentation transcript:

If we increase b2 from 10 to 20 will the optimal basis change? Consider the following problem Max Z = 2X1 – X2 + X3 s.t. 3X1 + X2 + X3 < 60 X1 – X2 + 2X3 < 10 X1 + X2 - X3 < 20 X1 , X2 , X3 > 0 With final tableau If we increase b2 from 10 to 20 will the optimal basis change? b. If we increase b2 from 10 to 20 what will the new objective function be? c. By how much can b3 change before the optimal basis will change?

d. If we decrease b1 from 60 to 50 and increase b3 from 20 to 25, will the optimal basis change? e. By how much can c2 vary from -1 before the basis will change?