Math Models of OR: Handling Upper Bounds in Simplex
|
|
- Rosamund Hines
- 5 years ago
- Views:
Transcription
1 Math Models of OR: Handling Upper Bounds in Simplex John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 280 USA September 208 Mitchell Handling Upper Bounds in Simplex / 8
2 Introduction Outline Introduction 2 Example 3 Tableaus Mitchell Handling Upper Bounds in Simplex 2 / 8
3 Introduction Slack variables Consider the linear programming problem min c T x subject to Ax = b 0 x u Could introduce slack variables s to get standard form: Increase from n to 2n variables. min c T x subject to Ax = b x + s = u x, s 0 Increase from m constraints to m + n constraints. Mitchell Handling Upper Bounds in Simplex 3 / 8
4 Introduction Modify pivot rules Instead, modify the pivot rules and work with the original tableau. A variable can be nonbasic at either its lower bound or its upper bound. If it is at its upper bound, it can enter the basis if its reduced cost is positive. The variable will be decreased. In the minimum ratio test, we ensure that no variable violates its upper or lower bound. Mitchell Handling Upper Bounds in Simplex 4 / 8
5 Example Outline Introduction 2 Example 3 Tableaus Mitchell Handling Upper Bounds in Simplex 5 / 8
6 Example Example min 2x 3 3x 4 subject to x + x 3 + 3x 4 = 6 x 2 x 3 2x 4 = 0 x 4 0 x x x 4 Have basic feasible solution: Nonbasics: x 3 = 0, x 4 = Basics: x = 6 x 3 3x 4 = 3, x 2 = + x 3 + 2x 4 =. Note how x 4 impacts these values. Objective function value: 2(0) 3() = 3. Mitchell Handling Upper Bounds in Simplex 6 / 8
7 Example Graphing the example x 4 min 2x 3 3x 4 s.t. x + x 3 + 3x 4 = 6 x 2 x 3 2x 4 = 0 x 4 0 x x x x 3 Mitchell Handling Upper Bounds in Simplex 7 / 8
8 Example Graphing the example x 4 x 3 + 3x 4 = 2, x = 4 x 3 + 3x 4 = 6, x = 0 min 2x 3 3x 4 s.t. x + x 3 + 3x 4 = 6 x 2 x 3 2x 4 = 0 x 4 0 x x x x 3 Mitchell Handling Upper Bounds in Simplex 7 / 8
9 Example Graphing the example x 4 x 3 + 2x 4 =, x 2 = 0 x 3 + 2x 4 = 4, x 2 = 3 min 2x 3 3x 4 s.t. x + x 3 + 3x 4 = 6 x 2 x 3 2x 4 = 0 x 4 0 x x x x 3 Mitchell Handling Upper Bounds in Simplex 7 / 8
10 Example Graphing the example x 4 x 3 + 2x 4 =, x 2 = 0 x 3 + 3x 4 = 2, x = 4 x 3 + 2x 4 = 4, x 2 = 3 x 3 + 3x 4 = 6, x = 0 min 2x 3 3x 4 s.t. x + x 3 + 3x 4 = 6 x 2 x 3 2x 4 = 0 x 4 0 x x x x 3 Mitchell Handling Upper Bounds in Simplex 7 / 8
11 Example Graphing the example x 4 x 3 + 2x 4 =, x 2 = 0 x 3 = 0 contour x 3 + 3x 4 = 2, x = 4 x 4 = x 3 + 2x 4 = 4, x 2 = 3 x 3 + 3x 4 = 6, x = 0 min 2x 3 3x 4 s.t. x + x 3 + 3x 4 = 6 x 2 x 3 2x 4 = 0 x 4 0 x x x x 3 Mitchell Handling Upper Bounds in Simplex 7 / 8
12 Example Graphing the example x 4 x 3 + 2x 4 =, x 2 = 0 simplex direction: increase x 3, keep x 4 = contour x 3 + 3x 4 = 2, x = 4 x 4 = x 3 + 2x 4 = 4, x 2 = 3 x 3 + 3x 4 = 6, x = 0 min 2x 3 3x 4 s.t. x + x 3 + 3x 4 = 6 x 2 x 3 2x 4 = 0 x 4 0 x x x x 3 Mitchell Handling Upper Bounds in Simplex 7 / 8
13 Example Graphing the example x 4 x 3 + 2x 4 =, x 2 = 0 simplex direction: increase x 3, keep x 4 = contour x 3 + 3x 4 = 2, x = 4 x 4 = x 3 + 2x 4 = 4, x 2 = 3 x 3 + 3x 4 = 6, x = 0 min 2x 3 3x 4 s.t. x + x 3 + 3x 4 = 6 x 2 x 3 2x 4 = 0 x 4 0 x x x x 3 Mitchell Handling Upper Bounds in Simplex 7 / 8
14 Example Performing the simplex pivot algebraically min 2x 3 3x 4 subject to x + x 3 + 3x 4 = 6 x 2 x 3 2x 4 = 0 x 4 Nonbasics: 0 x 2 3 x 3 = 0, x 4 = 0 x x 4 Since x 4 is at its upper bound and has a negative reduced cost, we don t bring x 4 into the basis. Instead, x 3 enters the basis. Calculate the simplex direction: We are increasing x 3, so the changes in the basic variables are given by the negatives of the entries in the x 3 column of the tableau. Direction is x = (,,, 0) T. Mitchell Handling Upper Bounds in Simplex 8 / 8
15 Example Finding the minimum ratio Taking a step of length t in the simplex direction gives a new point: x 3 x 2 x 3 = 0 + t x 4 0 Need to keep x within its bounds. x is decreasing. Need t 3 to keep x 0. x 2 is increasing. Need t 2 to keep x 2 3. x 3 is increasing. Need t 5 to keep x 3 5. So choose t = 2. x 2 leaves the basis at its upper bound. Mitchell Handling Upper Bounds in Simplex 9 / 8
16 Tableaus Outline Introduction 2 Example 3 Tableaus Mitchell Handling Upper Bounds in Simplex 0 / 8
17 Tableau for first iteration Tableaus x x 2 x 3 x 4 Min ratios LB UB UB B/LB/UB B B LB UB Values 3 0 Initial value of objective is z = 0 3() = 3. x 3 enters the basis. The Min ratios columns correspond to variables leaving the basis: if the pivot is in the first constraint, x would leave the basis at its lower bound, and if the pivot is in the second constraint, x 2 would leave the basis at its upper bound. By the minimum ratio test, x 2 leaves the basis at its upper bound. Mitchell Handling Upper Bounds in Simplex / 8
18 Tableau for first iteration Tableaus x x 2 x 3 x 4 Min ratios LB UB UB B/LB/UB B B LB UB Values 3 0 Initial value of objective is z = 0 3() = 3. x 3 enters the basis. The Min ratios columns correspond to variables leaving the basis: if the pivot is in the first constraint, x would leave the basis at its lower bound, and if the pivot is in the second constraint, x 2 would leave the basis at its upper bound. By the minimum ratio test, x 2 leaves the basis at its upper bound. Mitchell Handling Upper Bounds in Simplex / 8
19 Tableau for first iteration Tableaus x x 2 x 3 x 4 Min ratios LB UB UB B/LB/UB B B LB UB Values 3 0 Initial value of objective is z = 0 3() = 3. x 3 enters the basis. The Min ratios columns correspond to variables leaving the basis: if the pivot is in the first constraint, x would leave the basis at its lower bound, and if the pivot is in the second constraint, x 2 would leave the basis at its upper bound. By the minimum ratio test, x 2 leaves the basis at its upper bound. Mitchell Handling Upper Bounds in Simplex / 8
20 Tableau for first iteration Tableaus x x 2 x 3 x 4 Min ratios LB UB UB B/LB/UB B B LB UB Values 3 0 Initial value of objective is z = 0 3() = 3. x 3 enters the basis. The Min ratios columns correspond to variables leaving the basis: if the pivot is in the first constraint, x would leave the basis at its lower bound, and if the pivot is in the second constraint, x 2 would leave the basis at its upper bound. By the minimum ratio test, x 2 leaves the basis at its upper bound. Mitchell Handling Upper Bounds in Simplex / 8
21 Tableau for first iteration Tableaus x x 2 x 3 x 4 Min ratios LB UB UB B/LB/UB B B LB UB Values 3 0 Initial value of objective is z = 0 3() = 3. x 3 enters the basis. The Min ratios columns correspond to variables leaving the basis: if the pivot is in the first constraint, x would leave the basis at its lower bound, and if the pivot is in the second constraint, x 2 would leave the basis at its upper bound. By the minimum ratio test, x 2 leaves the basis at its upper bound. Mitchell Handling Upper Bounds in Simplex / 8
22 Tableaus Tableau for second iteration x x 2 x 3 x 4 Min ratios LB UB R 2 then R 0 + 2R 2, R R 2 x x 2 x 3 x UB B/LB/UB B UB B UB Values 3 2 Value of objective is z = 2 2(3) + () = 7. Basics: x = 5 x 2 x 4 =, x 3 = + x 2 2x 4 = 2. Mitchell Handling Upper Bounds in Simplex 2 / 8
23 Tableaus Graphing the second pivot x 4 x 3 + 2x 4 =, x 2 = 0 x 3 + 3x 4 = 2, x = 4 x 4 = contour x 3 + 2x 4 = 4, x 2 = 3 x 3 + 3x 4 = 6, x = 0 x x 2 x 3 x UB B/LB/UB B UB B UB Values x 3 Mitchell Handling Upper Bounds in Simplex 3 / 8
24 Tableaus Graphing the second pivot x 4 x 3 + 2x 4 =, x 2 = 0 contour x 3 + 3x 4 = 2, x = 4 simplex direction: decrease x 4, keep x 2 = 3 x 3 + 2x 4 = 4, x 2 = 3 x 3 + 3x 4 = 6, x = 0 x x 2 x 3 x UB B/LB/UB B UB B UB Values x 3 Mitchell Handling Upper Bounds in Simplex 3 / 8
25 Tableaus Graphing the second pivot x 4 x 3 + 2x 4 =, x 2 = 0 0 contour x 3 + 3x 4 = 2, x = 4 simplex direction: decrease x 4, keep x 2 = 3 x 3 + 2x 4 = 4, x 2 = 3 x 4 = 0 x 3 + 3x 4 = 6, x = x x 2 x 3 x UB B/LB/UB B UB B UB Values 3 2 x 3 Mitchell Handling Upper Bounds in Simplex 3 / 8
26 Making the second pivot Tableaus x x 2 x 3 x 4 Min ratios LB UB UB B/LB/UB B UB B UB Values 3 2 x 4 enters the basis and decreases. Thus, x and x 3 increase. Simplex direction: We are decreasing x 4, so the changes in the basic variables are given by the entries in the x 4 column of the tableau. Direction is x = (, 0, 2, ) T. Mitchell Handling Upper Bounds in Simplex 4 / 8
27 Choosing the steplength x x 2 x 3 x 4 = Tableaus t 0 2 The value of the minimum ratio for the basic variables x and x 3 is 2.5, which would drive x 3 to its upper bound of 5. The incoming basic variable also provides an upper bound on the maximum possible step length. Since we require x 4 0, the step length must be. Thus, the pivot is to keep x 4 nonbasic, but switch it from being nonbasic at its upper bound to nonbasic at its lower bound. This changes the value of the basic variables x and x 3. Mitchell Handling Upper Bounds in Simplex 5 / 8
28 Tableaus Tableau for third iteration This tableau is in optimal form. x x 2 x 3 x UB B/LB/UB B UB B LB Values Optimal value of objective is z = 2 2(3) + (0) = 8. Basics: x = 5 x 2 x 4 = 2, x 3 = + x 2 2x 4 = 4. x 2 is at its upper bound, and decreasing x 2 will increase the objective function value. x 4 is at its lower bound, and increasing x 4 will increase the objective function value. Mitchell Handling Upper Bounds in Simplex 6 / 8
29 Tableaus The iterations of the algorithm x 4 x 3 + 3x 4 = 6, x = 0 x 3 + 3x 4 = 2, x = 4 x 3 + 2x 4 = 4, x 2 = 3 x 3 + 2x 4 =, x 2 = 0 0 optimal contour x 3 Mitchell Handling Upper Bounds in Simplex 7 / 8
30 Tableaus Summary Advantage of this approach: The reduction in the linear algebra per iteration is notable: we only need m basic variables; we d need m + n if we used explicit slack variables. So the pivot matrices are far smaller. Each iteration requires checking each of the m basic variables against one of its bounds. This is perhaps cumbersome to do when working an example by hand, but it s easy to automate in a computer code. Mitchell Handling Upper Bounds in Simplex 8 / 8
Math Models of OR: Some Definitions
Math Models of OR: Some Definitions John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA September 2018 Mitchell Some Definitions 1 / 20 Active constraints Outline 1 Active constraints
More informationMath Models of OR: Sensitivity Analysis
Math Models of OR: Sensitivity Analysis John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 8 USA October 8 Mitchell Sensitivity Analysis / 9 Optimal tableau and pivot matrix Outline Optimal
More informationMath Models of OR: Extreme Points and Basic Feasible Solutions
Math Models of OR: Extreme Points and Basic Feasible Solutions John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 1180 USA September 018 Mitchell Extreme Points and Basic Feasible Solutions
More informationMath Models of OR: The Revised Simplex Method
Math Models of OR: The Revised Simplex Method John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA September 2018 Mitchell The Revised Simplex Method 1 / 25 Motivation Outline 1
More informationSlack Variable. Max Z= 3x 1 + 4x 2 + 5X 3. Subject to: X 1 + X 2 + X x 1 + 4x 2 + X X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0
Simplex Method Slack Variable Max Z= 3x 1 + 4x 2 + 5X 3 Subject to: X 1 + X 2 + X 3 20 3x 1 + 4x 2 + X 3 15 2X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0 Standard Form Max Z= 3x 1 +4x 2 +5X 3 + 0S 1 + 0S 2
More informationLecture 11 Linear programming : The Revised Simplex Method
Lecture 11 Linear programming : The Revised Simplex Method 11.1 The Revised Simplex Method While solving linear programming problem on a digital computer by regular simplex method, it requires storing
More informationPrelude to the Simplex Algorithm. The Algebraic Approach The search for extreme point solutions.
Prelude to the Simplex Algorithm The Algebraic Approach The search for extreme point solutions. 1 Linear Programming-1 x 2 12 8 (4,8) Max z = 6x 1 + 4x 2 Subj. to: x 1 + x 2
More informationLinear programs Optimization Geoff Gordon Ryan Tibshirani
Linear programs 10-725 Optimization Geoff Gordon Ryan Tibshirani Review: LPs LPs: m constraints, n vars A: R m n b: R m c: R n x: R n ineq form [min or max] c T x s.t. Ax b m n std form [min or max] c
More informationLecture 11: Post-Optimal Analysis. September 23, 2009
Lecture : Post-Optimal Analysis September 23, 2009 Today Lecture Dual-Simplex Algorithm Post-Optimal Analysis Chapters 4.4 and 4.5. IE 30/GE 330 Lecture Dual Simplex Method The dual simplex method will
More information21. Solve the LP given in Exercise 19 using the big-m method discussed in Exercise 20.
Extra Problems for Chapter 3. Linear Programming Methods 20. (Big-M Method) An alternative to the two-phase method of finding an initial basic feasible solution by minimizing the sum of the artificial
More informationStandard Form An LP is in standard form when: All variables are non-negativenegative All constraints are equalities Putting an LP formulation into sta
Chapter 4 Linear Programming: The Simplex Method An Overview of the Simplex Method Standard Form Tableau Form Setting Up the Initial Simplex Tableau Improving the Solution Calculating the Next Tableau
More informationLesson 27 Linear Programming; The Simplex Method
Lesson Linear Programming; The Simplex Method Math 0 April 9, 006 Setup A standard linear programming problem is to maximize the quantity c x + c x +... c n x n = c T x subject to constraints a x + a x
More informationSlide 1 Math 1520, Lecture 10
Slide 1 Math 1520, Lecture 10 In this lecture, we study the simplex method which is a powerful method for solving maximization/minimization problems developed in the late 1940 s. It has been implemented
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Math324 - Test Review 2 - Fall 206 MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Determine the vertex of the parabola. ) f(x) = x 2-0x + 33 ) (0,
More informationLecture 5 Simplex Method. September 2, 2009
Simplex Method September 2, 2009 Outline: Lecture 5 Re-cap blind search Simplex method in steps Simplex tableau Operations Research Methods 1 Determining an optimal solution by exhaustive search Lecture
More informationThe Simplex Method. Lecture 5 Standard and Canonical Forms and Setting up the Tableau. Lecture 5 Slide 1. FOMGT 353 Introduction to Management Science
The Simplex Method Lecture 5 Standard and Canonical Forms and Setting up the Tableau Lecture 5 Slide 1 The Simplex Method Formulate Constrained Maximization or Minimization Problem Convert to Standard
More informationSimplex Algorithm Using Canonical Tableaus
41 Simplex Algorithm Using Canonical Tableaus Consider LP in standard form: Min z = cx + α subject to Ax = b where A m n has rank m and α is a constant In tableau form we record it as below Original Tableau
More informationLecture 2: The Simplex method
Lecture 2 1 Linear and Combinatorial Optimization Lecture 2: The Simplex method Basic solution. The Simplex method (standardform, b>0). 1. Repetition of basic solution. 2. One step in the Simplex algorithm.
More informationPart 1. The Review of Linear Programming
In the name of God Part 1. The Review of Linear Programming 1.2. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Basic Feasible Solutions Key to the Algebra of the The Simplex Algorithm
More informationSensitivity Analysis
Dr. Maddah ENMG 500 /9/07 Sensitivity Analysis Changes in the RHS (b) Consider an optimal LP solution. Suppose that the original RHS (b) is changed from b 0 to b new. In the following, we study the affect
More informationTIM 206 Lecture 3: The Simplex Method
TIM 206 Lecture 3: The Simplex Method Kevin Ross. Scribe: Shane Brennan (2006) September 29, 2011 1 Basic Feasible Solutions Have equation Ax = b contain more columns (variables) than rows (constraints),
More informationThe Ellipsoid Algorithm
The Ellipsoid Algorithm John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA 9 February 2018 Mitchell The Ellipsoid Algorithm 1 / 28 Introduction Outline 1 Introduction 2 Assumptions
More informationDual Basic Solutions. Observation 5.7. Consider LP in standard form with A 2 R m n,rank(a) =m, and dual LP:
Dual Basic Solutions Consider LP in standard form with A 2 R m n,rank(a) =m, and dual LP: Observation 5.7. AbasisB yields min c T x max p T b s.t. A x = b s.t. p T A apple c T x 0 aprimalbasicsolutiongivenbyx
More informationCO350 Linear Programming Chapter 6: The Simplex Method
CO50 Linear Programming Chapter 6: The Simplex Method rd June 2005 Chapter 6: The Simplex Method 1 Recap Suppose A is an m-by-n matrix with rank m. max. c T x (P ) s.t. Ax = b x 0 On Wednesday, we learned
More informationDM545 Linear and Integer Programming. Lecture 7 Revised Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 7 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 2 Motivation Complexity of single pivot operation
More information4.4 The Simplex Method and the Standard Minimization Problem
. The Simplex Method and the Standard Minimization Problem Question : What is a standard minimization problem? Question : How is the standard minimization problem related to the dual standard maximization
More informationReview Solutions, Exam 2, Operations Research
Review Solutions, Exam 2, Operations Research 1. Prove the weak duality theorem: For any x feasible for the primal and y feasible for the dual, then... HINT: Consider the quantity y T Ax. SOLUTION: To
More informationAM 121: Intro to Optimization
AM 121: Intro to Optimization Models and Methods Lecture 6: Phase I, degeneracy, smallest subscript rule. Yiling Chen SEAS Lesson Plan Phase 1 (initialization) Degeneracy and cycling Smallest subscript
More information9.1 Linear Programs in canonical form
9.1 Linear Programs in canonical form LP in standard form: max (LP) s.t. where b i R, i = 1,..., m z = j c jx j j a ijx j b i i = 1,..., m x j 0 j = 1,..., n But the Simplex method works only on systems
More informationPart 1. The Review of Linear Programming
In the name of God Part 1. The Review of Linear Programming 1.5. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Formulation of the Dual Problem Primal-Dual Relationship Economic Interpretation
More informationSimplex tableau CE 377K. April 2, 2015
CE 377K April 2, 2015 Review Reduced costs Basic and nonbasic variables OUTLINE Review by example: simplex method demonstration Outline Example You own a small firm producing construction materials for
More information1. Algebraic and geometric treatments Consider an LP problem in the standard form. x 0. Solutions to the system of linear equations
The Simplex Method Most textbooks in mathematical optimization, especially linear programming, deal with the simplex method. In this note we study the simplex method. It requires basically elementary linear
More informationMATH 445/545 Test 1 Spring 2016
MATH 445/545 Test Spring 06 Note the problems are separated into two sections a set for all students and an additional set for those taking the course at the 545 level. Please read and follow all of these
More information(includes both Phases I & II)
Minimize z=3x 5x 4x 7x 5x 4x subject to 2x x2 x4 3x6 0 x 3x3 x4 3x5 2x6 2 4x2 2x3 3x4 x5 5 and x 0 j, 6 2 3 4 5 6 j ecause of the lack of a slack variable in each constraint, we must use Phase I to find
More informationThe augmented form of this LP is the following linear system of equations:
1 Consider the following LP given in standard form: max z = 5 x_1 + 2 x_2 Subject to 3 x_1 + 2 x_2 2400 x_2 800 2 x_1 1200 x_1, x_2 >= 0 The augmented form of this LP is the following linear system of
More informationMATH 445/545 Homework 2: Due March 3rd, 2016
MATH 445/545 Homework 2: Due March 3rd, 216 Answer the following questions. Please include the question with the solution (write or type them out doing this will help you digest the problem). I do not
More informationFoundations of Operations Research
Solved exercises for the course of Foundations of Operations Research Roberto Cordone The dual simplex method Given the following LP problem: maxz = 5x 1 +8x 2 x 1 +x 2 6 5x 1 +9x 2 45 x 1,x 2 0 1. solve
More informationNotes on Simplex Algorithm
Notes on Simplex Algorithm CS 9 Staff October 8, 7 Until now, we have represented the problems geometrically, and solved by finding a corner and moving around Now we learn an algorithm to solve this without
More informationA Review of Linear Programming
A Review of Linear Programming Instructor: Farid Alizadeh IEOR 4600y Spring 2001 February 14, 2001 1 Overview In this note we review the basic properties of linear programming including the primal simplex
More information(includes both Phases I & II)
(includes both Phases I & II) Dennis ricker Dept of Mechanical & Industrial Engineering The University of Iowa Revised Simplex Method 09/23/04 page 1 of 22 Minimize z=3x + 5x + 4x + 7x + 5x + 4x subject
More informationMath Homework 3: solutions. 1. Consider the region defined by the following constraints: x 1 + x 2 2 x 1 + 2x 2 6
Math 7502 Homework 3: solutions 1. Consider the region defined by the following constraints: x 1 + x 2 2 x 1 + 2x 2 6 x 1, x 2 0. (i) Maximize 4x 1 + x 2 subject to the constraints above. (ii) Minimize
More informationUnderstanding the Simplex algorithm. Standard Optimization Problems.
Understanding the Simplex algorithm. Ma 162 Spring 2011 Ma 162 Spring 2011 February 28, 2011 Standard Optimization Problems. A standard maximization problem can be conveniently described in matrix form
More information(P ) Minimize 4x 1 + 6x 2 + 5x 3 s.t. 2x 1 3x 3 3 3x 2 2x 3 6
The exam is three hours long and consists of 4 exercises. The exam is graded on a scale 0-25 points, and the points assigned to each question are indicated in parenthesis within the text. Problem 1 Consider
More informationSection Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010
Section Notes 9 IP: Cutting Planes Applied Math 121 Week of April 12, 2010 Goals for the week understand what a strong formulations is. be familiar with the cutting planes algorithm and the types of cuts
More informationDr. Maddah ENMG 500 Engineering Management I 10/21/07
Dr. Maddah ENMG 500 Engineering Management I 10/21/07 Computational Procedure of the Simplex Method The optimal solution of a general LP problem is obtained in the following steps: Step 1. Express the
More informationRevised Simplex Method
DM545 Linear and Integer Programming Lecture 7 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 2 Motivation Complexity of single pivot operation
More informationThe use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis:
Sensitivity analysis The use of shadow price is an example of sensitivity analysis. Duality theory can be applied to do other kind of sensitivity analysis: Changing the coefficient of a nonbasic variable
More informationx 4 = 40 +2x 5 +6x x 6 x 1 = 10 2x x 6 x 3 = 20 +x 5 x x 6 z = 540 3x 5 x 2 3x 6 x 4 x 5 x 6 x x
MATH 4 A Sensitivity Analysis Example from lectures The following examples have been sometimes given in lectures and so the fractions are rather unpleasant for testing purposes. Note that each question
More informationIE 400: Principles of Engineering Management. Simplex Method Continued
IE 400: Principles of Engineering Management Simplex Method Continued 1 Agenda Simplex for min problems Alternative optimal solutions Unboundedness Degeneracy Big M method Two phase method 2 Simplex for
More informationMath Models of OR: Traveling Salesman Problem
Math Models of OR: Traveling Salesman Problem John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA November 2018 Mitchell Traveling Salesman Problem 1 / 19 Outline 1 Examples 2
More informationIn Chapters 3 and 4 we introduced linear programming
SUPPLEMENT The Simplex Method CD3 In Chapters 3 and 4 we introduced linear programming and showed how models with two variables can be solved graphically. We relied on computer programs (WINQSB, Excel,
More informationIntroduction to Mathematical Programming IE406. Lecture 13. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 13 Dr. Ted Ralphs IE406 Lecture 13 1 Reading for This Lecture Bertsimas Chapter 5 IE406 Lecture 13 2 Sensitivity Analysis In many real-world problems,
More informationRelation of Pure Minimum Cost Flow Model to Linear Programming
Appendix A Page 1 Relation of Pure Minimum Cost Flow Model to Linear Programming The Network Model The network pure minimum cost flow model has m nodes. The external flows given by the vector b with m
More informationFarkas Lemma, Dual Simplex and Sensitivity Analysis
Summer 2011 Optimization I Lecture 10 Farkas Lemma, Dual Simplex and Sensitivity Analysis 1 Farkas Lemma Theorem 1. Let A R m n, b R m. Then exactly one of the following two alternatives is true: (i) x
More informationCPS 616 ITERATIVE IMPROVEMENTS 10-1
CPS 66 ITERATIVE IMPROVEMENTS 0 - APPROACH Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change
More informationThe dual simplex method with bounds
The dual simplex method with bounds Linear programming basis. Let a linear programming problem be given by min s.t. c T x Ax = b x R n, (P) where we assume A R m n to be full row rank (we will see in the
More informationExample. 1 Rows 1,..., m of the simplex tableau remain lexicographically positive
3.4 Anticycling Lexicographic order In this section we discuss two pivoting rules that are guaranteed to avoid cycling. These are the lexicographic rule and Bland s rule. Definition A vector u R n is lexicographically
More informationPart III: A Simplex pivot
MA 3280 Lecture 31 - More on The Simplex Method Friday, April 25, 2014. Objectives: Analyze Simplex examples. We were working on the Simplex tableau The matrix form of this system of equations is called
More informationMath 210 Finite Mathematics Chapter 4.2 Linear Programming Problems Minimization - The Dual Problem
Math 2 Finite Mathematics Chapter 4.2 Linear Programming Problems Minimization - The Dual Problem Richard Blecksmith Dept. of Mathematical Sciences Northern Illinois University Math 2 Website: http://math.niu.edu/courses/math2.
More informationWeek_4: simplex method II
Week_4: simplex method II 1 1.introduction LPs in which all the constraints are ( ) with nonnegative right-hand sides offer a convenient all-slack starting basic feasible solution. Models involving (=)
More informationChap6 Duality Theory and Sensitivity Analysis
Chap6 Duality Theory and Sensitivity Analysis The rationale of duality theory Max 4x 1 + x 2 + 5x 3 + 3x 4 S.T. x 1 x 2 x 3 + 3x 4 1 5x 1 + x 2 + 3x 3 + 8x 4 55 x 1 + 2x 2 + 3x 3 5x 4 3 x 1 ~x 4 0 If we
More informationWorked Examples for Chapter 5
Worked Examples for Chapter 5 Example for Section 5.2 Construct the primal-dual table and the dual problem for the following linear programming model fitting our standard form. Maximize Z = 5 x 1 + 4 x
More informationLinear Programming: Simplex Method CHAPTER The Simplex Tableau; Pivoting
CHAPTER 5 Linear Programming: 5.1. The Simplex Tableau; Pivoting Simplex Method In this section we will learn how to prepare a linear programming problem in order to solve it by pivoting using a matrix
More informationNon-Standard Constraints. Setting up Phase 1 Phase 2
Non-Standard Constraints Setting up Phase 1 Phase 2 Maximizing with Mixed Constraints Some maximization problems contain mixed constraints, like this: maximize 3x 1 + 2x 2 subject to 2x 1 + x 2 50 (standard)
More information6.2: The Simplex Method: Maximization (with problem constraints of the form )
6.2: The Simplex Method: Maximization (with problem constraints of the form ) 6.2.1 The graphical method works well for solving optimization problems with only two decision variables and relatively few
More informationCO350 Linear Programming Chapter 8: Degeneracy and Finite Termination
CO350 Linear Programming Chapter 8: Degeneracy and Finite Termination 27th June 2005 Chapter 8: Finite Termination 1 The perturbation method Recap max c T x (P ) s.t. Ax = b x 0 Assumption: B is a feasible
More informationMAT016: Optimization
MAT016: Optimization M.El Ghami e-mail: melghami@ii.uib.no URL: http://www.ii.uib.no/ melghami/ March 29, 2011 Outline for today The Simplex method in matrix notation Managing a production facility The
More informationSystems Analysis in Construction
Systems Analysis in Construction CB312 Construction & Building Engineering Department- AASTMT by A h m e d E l h a k e e m & M o h a m e d S a i e d 3. Linear Programming Optimization Simplex Method 135
More informationF 1 F 2 Daily Requirement Cost N N N
Chapter 5 DUALITY 5. The Dual Problems Every linear programming problem has associated with it another linear programming problem and that the two problems have such a close relationship that whenever
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 5: The Simplex method, continued Prof. John Gunnar Carlsson September 22, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 22, 2010
More informationYinyu Ye, MS&E, Stanford MS&E310 Lecture Note #06. The Simplex Method
The Simplex Method Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapters 2.3-2.5, 3.1-3.4) 1 Geometry of Linear
More informationCHAPTER 2. The Simplex Method
CHAPTER 2 The Simplex Method In this chapter we present the simplex method as it applies to linear programming problems in standard form. 1. An Example We first illustrate how the simplex method works
More information1 Review Session. 1.1 Lecture 2
1 Review Session Note: The following lists give an overview of the material that was covered in the lectures and sections. Your TF will go through these lists. If anything is unclear or you have questions
More informationmin 4x 1 5x 2 + 3x 3 s.t. x 1 + 2x 2 + x 3 = 10 x 1 x 2 6 x 1 + 3x 2 + x 3 14
The exam is three hours long and consists of 4 exercises. The exam is graded on a scale 0-25 points, and the points assigned to each question are indicated in parenthesis within the text. If necessary,
More informationIntroduce the idea of a nondegenerate tableau and its analogy with nondenegerate vertices.
2 JORDAN EXCHANGE REVIEW 1 Lecture Outline The following lecture covers Section 3.5 of the textbook [?] Review a labeled Jordan exchange with pivoting. Introduce the idea of a nondegenerate tableau and
More informationmin3x 1 + 4x 2 + 5x 3 2x 1 + 2x 2 + x 3 6 x 1 + 2x 2 + 3x 3 5 x 1, x 2, x 3 0.
ex-.-. Foundations of Operations Research Prof. E. Amaldi. Dual simplex algorithm Given the linear program minx + x + x x + x + x 6 x + x + x x, x, x. solve it via the dual simplex algorithm. Describe
More informationAlgebraic Simplex Active Learning Module 4
Algebraic Simplex Active Learning Module 4 J. René Villalobos and Gary L. Hogg Arizona State University Paul M. Griffin Georgia Institute of Technology Time required for the module: 50 Min. Reading Most
More informationLinear programming: algebra
: algebra CE 377K March 26, 2015 ANNOUNCEMENTS Groups and project topics due soon Announcements Groups and project topics due soon Did everyone get my test email? Announcements REVIEW geometry Review geometry
More informationMath 273a: Optimization The Simplex method
Math 273a: Optimization The Simplex method Instructor: Wotao Yin Department of Mathematics, UCLA Fall 2015 material taken from the textbook Chong-Zak, 4th Ed. Overview: idea and approach If a standard-form
More informationSpecial cases of linear programming
Special cases of linear programming Infeasible solution Multiple solution (infinitely many solution) Unbounded solution Degenerated solution Notes on the Simplex tableau 1. The intersection of any basic
More informationmaxz = 3x 1 +4x 2 2x 1 +x 2 6 2x 1 +3x 2 9 x 1,x 2
ex-5.-5. Foundations of Operations Research Prof. E. Amaldi 5. Branch-and-Bound Given the integer linear program maxz = x +x x +x 6 x +x 9 x,x integer solve it via the Branch-and-Bound method (solving
More informationCSC Design and Analysis of Algorithms. LP Shader Electronics Example
CSC 80- Design and Analysis of Algorithms Lecture (LP) LP Shader Electronics Example The Shader Electronics Company produces two products:.eclipse, a portable touchscreen digital player; it takes hours
More informationMetode Kuantitatif Bisnis. Week 4 Linear Programming Simplex Method - Minimize
Metode Kuantitatif Bisnis Week 4 Linear Programming Simplex Method - Minimize Outlines Solve Linear Programming Model Using Graphic Solution Solve Linear Programming Model Using Simplex Method (Maximize)
More information1 Implementation (continued)
Mathematical Programming Lecture 13 OR 630 Fall 2005 October 6, 2005 Notes by Saifon Chaturantabut 1 Implementation continued We noted last time that B + B + a q Be p e p BI + ā q e p e p. Now, we want
More information4.7 Sensitivity analysis in Linear Programming
4.7 Sensitivity analysis in Linear Programming Evaluate the sensitivity of an optimal solution with respect to variations in the data (model parameters). Example: Production planning max n j n a j p j
More informationORF 307: Lecture 2. Linear Programming: Chapter 2 Simplex Methods
ORF 307: Lecture 2 Linear Programming: Chapter 2 Simplex Methods Robert Vanderbei February 8, 2018 Slides last edited on February 8, 2018 http://www.princeton.edu/ rvdb Simplex Method for LP An Example.
More informationNote 3: LP Duality. If the primal problem (P) in the canonical form is min Z = n (1) then the dual problem (D) in the canonical form is max W = m (2)
Note 3: LP Duality If the primal problem (P) in the canonical form is min Z = n j=1 c j x j s.t. nj=1 a ij x j b i i = 1, 2,..., m (1) x j 0 j = 1, 2,..., n, then the dual problem (D) in the canonical
More informationAM 121: Intro to Optimization Models and Methods
AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 2: Intro to LP, Linear algebra review. Yiling Chen SEAS Lecture 2: Lesson Plan What is an LP? Graphical and algebraic correspondence Problems
More informationMath 354 Summer 2004 Solutions to review problems for Midterm #1
Solutions to review problems for Midterm #1 First: Midterm #1 covers Chapter 1 and 2. In particular, this means that it does not explicitly cover linear algebra. Also, I promise there will not be any proofs.
More informationLinear Programming Redux
Linear Programming Redux Jim Bremer May 12, 2008 The purpose of these notes is to review the basics of linear programming and the simplex method in a clear, concise, and comprehensive way. The book contains
More informationTRANSPORTATION PROBLEMS
Chapter 6 TRANSPORTATION PROBLEMS 61 Transportation Model Transportation models deal with the determination of a minimum-cost plan for transporting a commodity from a number of sources to a number of destinations
More informationOperations Research Lecture 2: Linear Programming Simplex Method
Operations Research Lecture 2: Linear Programming Simplex Method Notes taken by Kaiquan Xu@Business School, Nanjing University Mar 10th 2016 1 Geometry of LP 1.1 Graphical Representation and Solution Example
More informationMATH2070 Optimisation
MATH2070 Optimisation Linear Programming Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The standard Linear Programming (LP) Problem Graphical method of solving LP problem
More informationThe Simplex Method of Linear Programming
The Simplex Method of Linear Programming Online Tutorial 3 Tutorial Outline CONVERTING THE CONSTRAINTS TO EQUATIONS SETTING UP THE FIRST SIMPLEX TABLEAU SIMPLEX SOLUTION PROCEDURES SUMMARY OF SIMPLEX STEPS
More informationSimplex Method for LP (II)
Simplex Method for LP (II) Xiaoxi Li Wuhan University Sept. 27, 2017 (week 4) Operations Research (Li, X.) Simplex Method for LP (II) Sept. 27, 2017 (week 4) 1 / 31 Organization of this lecture Contents:
More informationChapter 4 The Simplex Algorithm Part I
Chapter 4 The Simplex Algorithm Part I Based on Introduction to Mathematical Programming: Operations Research, Volume 1 4th edition, by Wayne L. Winston and Munirpallam Venkataramanan Lewis Ntaimo 1 Modeling
More informationToday s class. Constrained optimization Linear programming. Prof. Jinbo Bi CSE, UConn. Numerical Methods, Fall 2011 Lecture 12
Today s class Constrained optimization Linear programming 1 Midterm Exam 1 Count: 26 Average: 73.2 Median: 72.5 Maximum: 100.0 Minimum: 45.0 Standard Deviation: 17.13 Numerical Methods Fall 2011 2 Optimization
More information1. Introduce slack variables for each inequaility to make them equations and rewrite the objective function in the form ax by cz... + P = 0.
3.4 Simplex Method If a linear programming problem has more than 2 variables, solving graphically is not the way to go. Instead, we ll use a more methodical, numeric process called the Simplex Method.
More informationExam 3 Review Math 118 Sections 1 and 2
Exam 3 Review Math 118 Sections 1 and 2 This exam will cover sections 5.3-5.6, 6.1-6.3 and 7.1-7.3 of the textbook. No books, notes, calculators or other aids are allowed on this exam. There is no time
More informationThe Simplex Method. Standard form (max) z c T x = 0 such that Ax = b.
The Simplex Method Standard form (max) z c T x = 0 such that Ax = b. The Simplex Method Standard form (max) z c T x = 0 such that Ax = b. Build initial tableau. z c T 0 0 A b The Simplex Method Standard
More information