optimal basis will not change

Slides:



Advertisements
Similar presentations
Nonlinear Programming
Advertisements

Variables that are unrestricted in sign LI Xiao-lei.
Transportation Problem
EMGT 501 HW #2 Due Day: Sep 27 Chapter 6 - SELF TEST 21
Duality Dual problem Duality Theorem Complementary Slackness
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.
Linear Programming Sensitivity of the Objective Function Coefficients.
1. The Simplex Method.
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.
8. Linear Programming (Simplex Method) Objectives: 1.Simplex Method- Standard Maximum problem 2. (i) Greedy Rule (ii) Ratio Test (iii) Pivot Operation.
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.
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
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..
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.
Linear Fractional Programming. What is LFP? Minimize Subject to p,q are n vectors, b is an m vector, A is an m*n matrix, α,β are scalar.
1 Simplex Method for Bounded Variables Linear programming problems with lower and upper bounds Generalizing simplex algorithm for bounded variables Reference:
Advanced Operations Research Models Instructor: Dr. A. Seifi Teaching Assistant: Golbarg Kazemi 1.
Part 4 Nonlinear Programming 4.5 Quadratic Programming (QP)
 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.
The diagram below shows water flowing through a pipework system. The values on the edges are the capacities of water that they can carry.
$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.
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:
2.5 The Fundamental Theorem of Game Theory For any 2-person zero-sum game there exists a pair (x*,y*) in S  T such that min {x*V. j : j=1,...,n} =
Chapter 4 The Simplex Algorithm and Goal Programming
Chap 10. Sensitivity Analysis
Arithmetic and Geometric Means
2 Digit by 2 Digit Multiplication
The Two-Phase Simplex Method
Chapter 5 Simplex-Based Sensitivity Analysis and Duality
Increasing and Decreasing Functions and the First Derivative Test
(Fractions / Surds /Indices)
Chapter 4 Linear Programming: The Simplex Method
به نام خدا آشنایی با LINDO Software استاد :‌ راحله خاندوزی.
The Simplex Method.
The Simplex Method: Standard Minimization Problems
If we increase b2 from 10 to 20 will the optimal basis change?
St. Edward’s University
Think Break #14 Machine costs $7000 with a useful life of 3 years and salvage value of $1000 1) What is the double declining balance depreciation for the.
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
Solving Systems of Equation by Substitution
What is it and how do I know when I see it?
Lecture 4 Part I Mohamed A. M. A..
Homework Analyzing Graphs
Linear Programming – Sensitivity Analysis
1 1 Find a maximum Matching ? Women Men.
Chapter 4 The Simplex Algorithm
2.5 CONCAVITY.
Daily Challenge Please solve the following without a GDC: None None
Prepared by Po-Chuan on 2016/05/24
Presentation transcript:

optimal basis will not 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* = S*[b + ] All > 0, optimal basis will not change b. If we increase b2 from 10 to 20 what will the new objective function be? Since b2 can go to 20, from y2=1.5, each unit increase of b2 will increase the value of the objective function by 1.5 Z = Z + 1.5*10 = 40 c. By how much can b3 change before the optimal basis will change? b* = S*[b + ]

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? b* = S*[b + ] optimal basis will change e. By how much can c2 vary from -1 before the basis will change?