Math Models of OR: Some Definitions
|
|
- Nicholas Wright
- 5 years ago
- Views:
Transcription
1 Math Models of OR: Some Definitions John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY USA September 2018 Mitchell Some Definitions 1 / 20
2 Active constraints Outline 1 Active constraints 2 Basic feasible solutions 3 Simplex directions 4 Optimal solutions Mitchell Some Definitions 2 / 20
3 Active constraints Active constraints Definition Let x be a feasible solution to a linear optimization problem. A constraint of the LOP is active at x if it is satisfied at equality by the point x. Note that equality constraints are active at any feasible point. Inequality constraints may be active at some feasible points and inactive at other feasible points. Mitchell Some Definitions 3 / 20
4 Active constraints Example For example, consider the linear optimization problem min x IR 2 2x 1 x 2 subject to x 1 x 2 2 3x 1 + x 2 10 x j 0, j = 1, 2 (1) We add slack variables to get an equivalent problem in standard form: min x IR 2 2x 1 x 2 subject to x 1 x 2 + x 3 = 2 3x 1 + x 2 + x 4 = 10 x j 0, j = 1,..., 4 (2) Mitchell Some Definitions 4 / 20
5 Active constraints Example Graphing the problem in the original (x 1, x 2 )-space gives: x x 1 + x 2 = 10 5 x 1 x 2 = 2 0 (3, 1) x 1 point x active inequalities inactive inequalities (3,1) x 1 x 2 2, 3x 1 + x 2 10 x 1 0, x 2 0 (1,2) none all (0,7) x 1 0 x 1 x 2 2, 3x 1 + x 2 10, x 2 0 (2,4) 3x 1 + x 2 10 x 1 x 2 2, x 1 0, x 2 0 Mitchell Some Definitions 5 / 20
6 Active constraints Example Graphing the problem in the original (x 1, x 2 )-space gives: x x 1 + x 2 = 10 5 (1, 2) x 1 x 2 = 2 x 1 point x active inequalities inactive inequalities (3,1) x 1 x 2 2, 3x 1 + x 2 10 x 1 0, x 2 0 (1,2) none all (0,7) x 1 0 x 1 x 2 2, 3x 1 + x 2 10, x 2 0 (2,4) 3x 1 + x 2 10 x 1 x 2 2, x 1 0, x 2 0 Mitchell Some Definitions 5 / 20
7 Example Active constraints Graphing the problem in the original (x 1, x 2 )-space gives: x 2 10 (0, 7) 5 3x 1 + x 2 = 10 x 1 x 2 = x 1 point x active inequalities inactive inequalities (3,1) x 1 x 2 2, 3x 1 + x 2 10 x 1 0, x 2 0 (1,2) none all (0,7) x 1 0 x 1 x 2 2, 3x 1 + x 2 10, x 2 0 (2,4) 3x 1 + x 2 10 x 1 x 2 2, x 1 0, x 2 0 Mitchell Some Definitions 5 / 20
8 Active constraints Example Graphing the problem in the original (x 1, x 2 )-space gives: x x 1 + x 2 = 10 5 (2, 4) x 1 x 2 = x 1 point x active inequalities inactive inequalities (3,1) x 1 x 2 2, 3x 1 + x 2 10 x 1 0, x 2 0 (1,2) none all (0,7) x 1 0 x 1 x 2 2, 3x 1 + x 2 10, x 2 0 (2,4) 3x 1 + x 2 10 x 1 x 2 2, x 1 0, x 2 0 Mitchell Some Definitions 5 / 20
9 Active constraints Example Now consider the formulation with explicit slacks in standard form. The equality constraints are both active at any feasible point. A (possibly empty) subset of the nonnegativity constraints are active. x 2 10 x 4 = 0 5 x 3 = 0 0 (3, 1) x 1 point x active inequalities inactive inequalities (3,1,0,0) x 3 0, x 4 0 x 1 0, x 2 0 (1,2,3,5) none all (0,7,9,3) x 1 0 x 2 0, x 3 0, x 4 0 (2,4,4,0) x 4 0 x 1 0, x 2 0, x 3 0 Mitchell Some Definitions 6 / 20
10 Active constraints Example Now consider the formulation with explicit slacks in standard form. The equality constraints are both active at any feasible point. A (possibly empty) subset of the nonnegativity constraints are active. x 2 10 x 4 = 0 5 (1, 2) x 3 = 0 x 1 point x active inequalities inactive inequalities (3,1,0,0) x 3 0, x 4 0 x 1 0, x 2 0 (1,2,3,5) none all (0,7,9,3) x 1 0 x 2 0, x 3 0, x 4 0 (2,4,4,0) x 4 0 x 1 0, x 2 0, x 3 0 Mitchell Some Definitions 6 / 20
11 Active constraints Example Now consider the formulation with explicit slacks in standard form. The equality constraints are both active at any feasible point. A (possibly empty) subset of the nonnegativity constraints are active. x 2 10 (0, 7) 5 x 4 = 0 x 3 = point x active inequalities inactive inequalities (3,1,0,0) x 3 0, x 4 0 x 1 0, x 2 0 (1,2,3,5) none all (0,7,9,3) x 1 0 x 2 0, x 3 0, x 4 0 (2,4,4,0) x 4 0 x 1 0, x 2 0, x 3 0 Mitchell Some Definitions 6 / 20 x 1
12 Active constraints Example Now consider the formulation with explicit slacks in standard form. The equality constraints are both active at any feasible point. A (possibly empty) subset of the nonnegativity constraints are active. x 2 10 x 4 = 0 5 (2, 4) x 3 = x 1 point x active inequalities inactive inequalities (3,1,0,0) x 3 0, x 4 0 x 1 0, x 2 0 (1,2,3,5) none all (0,7,9,3) x 1 0 x 2 0, x 3 0, x 4 0 (2,4,4,0) x 4 0 x 1 0, x 2 0, x 3 0 Mitchell Some Definitions 6 / 20
13 Basic feasible solutions Outline 1 Active constraints 2 Basic feasible solutions 3 Simplex directions 4 Optimal solutions Mitchell Some Definitions 7 / 20
14 Basic feasible solutions Example Our standard form linear optimization problem has the form min x IR n c T x subject to Ax = b x 0 where A is an m n matrix, b IR m, and x, c IR n. Mitchell Some Definitions 8 / 20
15 Basic feasible solutions Basic sequence A canonical form tableau for a linear optimization problem in standard form contains the m columns of the identity matrix, as in, for example: x 1 x 2 x 3 x 4 x The first column of the identity appears in the x 5 -column, the second in the x 1 -column, and the third in the x 3 -column. This gives us a basic sequence S = (5, 1, 3) associated with the canonical form tableau. The tableau is in canonical form with respect to the basic sequence S. Mitchell Some Definitions 9 / 20
16 Basic feasible solutions Basic and nonbasic variables x 1 x 2 x 3 x 4 x The variables corresponding to the columns of the identity are the basic variables, so x 5, x 1, and x 3 for the example. The remaining variables are the nonbasic variables, so x 2 and x 4 for the example. The basic feasible solution corresponding to the canonical form tableau is obtained by setting the nonbasic variables equal to zero and then finding the unique solution for the basic variables. In the example, once we set x 2 = x 4 = 0, the only solution to the system Ax = b is x 5 = 3, x 1 = 1, and x 3 = 13. In general, a basic feasible solution has m basic variables (one for each row) and n m nonbasic variables. Mitchell Some Definitions 10 / 20
17 Basic feasible solutions Basic and nonbasic variables x 1 x 2 x 3 x 4 x The variables corresponding to the columns of the identity are the basic variables, so x 5, x 1, and x 3 for the example. The remaining variables are the nonbasic variables, so x 2 and x 4 for the example. The basic feasible solution corresponding to the canonical form tableau is obtained by setting the nonbasic variables equal to zero and then finding the unique solution for the basic variables. In the example, once we set x 2 = x 4 = 0, the only solution to the system Ax = b is x 5 = 3, x 1 = 1, and x 3 = 13. In general, a basic feasible solution has m basic variables (one for each row) and n m nonbasic variables. Mitchell Some Definitions 10 / 20
18 Basic feasible solutions Basic and nonbasic variables x 1 x 2 x 3 x 4 x The variables corresponding to the columns of the identity are the basic variables, so x 5, x 1, and x 3 for the example. The remaining variables are the nonbasic variables, so x 2 and x 4 for the example. The basic feasible solution corresponding to the canonical form tableau is obtained by setting the nonbasic variables equal to zero and then finding the unique solution for the basic variables. In the example, once we set x 2 = x 4 = 0, the only solution to the system Ax = b is x 5 = 3, x 1 = 1, and x 3 = 13. In general, a basic feasible solution has m basic variables (one for each row) and n m nonbasic variables. Mitchell Some Definitions 10 / 20
19 Basic feasible solutions Extreme points Each basic feasible solution is an extreme point or corner point of the set of feasible solutions to a standard form LOP. P = {x IR n : Ax = b, x 0} Each extreme point corresponds to at least one basic sequence. It may correspond to more than one basic sequence if one of the basic variables is equal to zero; we will return to this point later, and the complications it may cause. We will also define extreme points more formally later. Mitchell Some Definitions 11 / 20
20 Simplex directions Outline 1 Active constraints 2 Basic feasible solutions 3 Simplex directions 4 Optimal solutions Mitchell Some Definitions 12 / 20
21 Simplex directions A pivot In a simplex pivot, one of the nonbasic variables becomes a basic variable and one of the basic variables becomes nonbasic. For example, pivoting on entry a 14 in this canonical form tableau: x 1 x 2 x 3 x 4 x leads to the canonical form tableau R 0 + 2R 1, R 2 + 2R 1, R 3 3R 1 x 1 x 2 x 3 x 4 x The basic sequence has been updated from (5, 1, 3) to (4, 1, 3). The variable x 4 has replaced the variable x 5 in the basis. Mitchell Some Definitions 13 / 20
22 Simplex directions Change in x If we let x 0 IR 5 denote the old BFS and x 1 IR 5 denote the new one, we have x 0 0 = 13 0, x 1 0 = 4 3, x 1 x 0 0 = 9 3 = Notice that the change x 1 x 0 is expressed as a scale factor multiplied by a vector. The scale factor is equal to the minimum ratio calculated when determining the pivot element, 3 for the example. Mitchell Some Definitions 14 / 20
23 Simplex directions Change in x If we let x 0 IR 5 denote the old BFS and x 1 IR 5 denote the new one, we have x 0 0 = 13 0, x 1 0 = 4 3, x 1 x 0 0 = 9 3 = Notice that the change x 1 x 0 is expressed as a scale factor multiplied by a vector. The scale factor is equal to the minimum ratio calculated when determining the pivot element, 3 for the example. Mitchell Some Definitions 14 / 20
24 Simplex directions Change in x If we let x 0 IR 5 denote the old BFS and x 1 IR 5 denote the new one, we have x 0 0 = 13 0, x 1 0 = 4 3, x 1 x 0 0 = 9 3 = Notice that the change x 1 x 0 is expressed as a scale factor multiplied by a vector. The scale factor is equal to the minimum ratio calculated when determining the pivot element, 3 for the example. Mitchell Some Definitions 14 / 20
25 Simplex directions Simplex direction The direction is called the simplex direction and can be derived from the pivot column in the original tableau: d = 1 3 (x 1 x 0 ) = negative of a 24, row corresponding to x 1 0, for a variable staying nonbasic negative of a 34, row corresponding to x 3 1, for the variable entering the basis negative of a 14, row corresponding to x 5 Simplex directions always have this structure: 1 for the variable entering the basis 0 for the other nonbasic variables negative of the appropriate entry in the pivot column for the old basic variables Mitchell Some Definitions 15 / 20
26 Simplex directions Edges If a basic feasible solution can be obtained from another one via a single simplex pivot, we say the basic feasible solutions are adjacent. Geometrically, this corresponds to moving along an edge of the feasible region. We will define edges more formally later. Mitchell Some Definitions 16 / 20
27 Optimal solutions Outline 1 Active constraints 2 Basic feasible solutions 3 Simplex directions 4 Optimal solutions Mitchell Some Definitions 17 / 20
28 Optimal solutions Global and local optimality For a general optimization problem: Want to find a globally optimal solution: the best possible feasible solution. May have to be satisfied with finding a locally optimal solution: there is no better point in a neighborhood of the current point. For a linear optimization problem, any locally optimal solution is globally optimal. Mitchell Some Definitions 18 / 20
29 Optimal solutions Edges If a standard form LOP has an optimal solution then it has an optimal solution that is a BFS. The simplex algorithm will find such an optimal solution. It may have multiple optimal solutions, corresponding to a face of the set of feasible solutions. Each optimal BFS can be reached from any other optimal BFS by a sequence of pivots that only visits optimal basic feasible solutions. Mitchell Some Definitions 19 / 20
30 Optimal solutions An example where every feasible solution is optimal Let x be a feasible point where none of the inequality constraints are active. The only way the point x can be optimal is if every feasible solution is optimal. For example, the point x = (2, 1, 2) is feasible for the LOP: min x IR 3 3x 1 + 8x x 3 subject to 3x 1 2x 2 + 4x 3 = 12 x 1 + 4x 2 + x 3 = 4 x j 0 For this problem, the objective function is a linear combination of the constraints. In particular, we have 3x 1 + 8x x 3 = 2 (3x 1 2x 2 + 4x 3 ) + 3 ( x 1 + 4x 2 + x 3 ) = 2(12) + 3(4) = 36 for any feasible point. So every feasible point is optimal. Mitchell Some Definitions 20 / 20
Math 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: Handling Upper Bounds in Simplex
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 Introduction Outline
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationThe Simplex Method for Solving a Linear Program Prof. Stephen Graves
The Simplex Method for Solving a Linear Program Prof. Stephen Graves Observations from Geometry feasible region is a convex polyhedron an optimum occurs at a corner point possible algorithm - search over
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 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 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 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 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 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 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 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 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 informationAM 121: Intro to Optimization Models and Methods Fall 2018
AM 121: Intro to Optimization Models and Methods Fall 2018 Lecture 5: The Simplex Method Yiling Chen Harvard SEAS Lesson Plan This lecture: Moving towards an algorithm for solving LPs Tableau. Adjacent
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 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 informationIE 400 Principles of Engineering Management. The Simplex Algorithm-I: Set 3
IE 4 Principles of Engineering Management The Simple Algorithm-I: Set 3 So far, we have studied how to solve two-variable LP problems graphically. However, most real life problems have more than two variables!
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 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 informationLinear Programming and the Simplex method
Linear Programming and the Simplex method Harald Enzinger, Michael Rath Signal Processing and Speech Communication Laboratory Jan 9, 2012 Harald Enzinger, Michael Rath Jan 9, 2012 page 1/37 Outline Introduction
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 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 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 informationΩ R n is called the constraint set or feasible set. x 1
1 Chapter 5 Linear Programming (LP) General constrained optimization problem: minimize subject to f(x) x Ω Ω R n is called the constraint set or feasible set. any point x Ω is called a feasible point We
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 informationECE 307 Techniques for Engineering Decisions
ECE 7 Techniques for Engineering Decisions Introduction to the Simple Algorithm George Gross Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign ECE 7 5 9 George
More information9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS
SECTION 9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS 557 9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS In Sections 9. and 9., you looked at linear programming problems that occurred in standard form. The constraints
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 information4.3 Minimizing & Mixed Constraints
Mathematics : Mattingly, Fall 6 8 4. Minimizing & Mixed Constraints So far, you have seen how to solve one type of problem: Standard Maximum. The objective function is to be maximized.. Constraints use..
More informationSimplex Method in different guises
Simplex Method in different guises The Furniture problem Max 0x + 0x 2 + 20x, subject to x 0, 8x + x 2 + 2x 48, 4x + 2x 2 +.x 20, 2x +.x 2 +.x 8. Canonical form: slack variables s = (s, s 2, s ) 0. Constraints
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 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 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 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 informationChapter 5 Linear Programming (LP)
Chapter 5 Linear Programming (LP) General constrained optimization problem: minimize f(x) subject to x R n is called the constraint set or feasible set. any point x is called a feasible point We consider
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 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 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 informationChapter 3, Operations Research (OR)
Chapter 3, Operations Research (OR) Kent Andersen February 7, 2007 1 Linear Programs (continued) In the last chapter, we introduced the general form of a linear program, which we denote (P) Minimize Z
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 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 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 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 information3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions
A. LINEAR ALGEBRA. CONVEX SETS 1. Matrices and vectors 1.1 Matrix operations 1.2 The rank of a matrix 2. Systems of linear equations 2.1 Basic solutions 3. Vector spaces 3.1 Linear dependence and independence
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 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 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 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 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 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 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 informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 3: Linear Programming, Continued Prof. John Gunnar Carlsson September 15, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 15, 2010
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 informationLecture 4: Algebra, Geometry, and Complexity of the Simplex Method. Reading: Sections 2.6.4, 3.5,
Lecture 4: Algebra, Geometry, and Complexity of the Simplex Method Reading: Sections 2.6.4, 3.5, 10.2 10.5 1 Summary of the Phase I/Phase II Simplex Method We write a typical simplex tableau as z x 1 x
More informationProfessor Alan H. Stein October 31, 2007
Mathematics 05 Professor Alan H. Stein October 3, 2007 SOLUTIONS. For most maximum problems, the contraints are in the form l(x) k, where l(x) is a linear polynomial and k is a positive constant. Explain
More informationCO350 Linear Programming Chapter 5: Basic Solutions
CO350 Linear Programming Chapter 5: Basic Solutions 1st June 2005 Chapter 5: Basic Solutions 1 On Monday, we learned Recap Theorem 5.3 Consider an LP in SEF with rank(a) = # rows. Then x is bfs x is extreme
More informationPart 1. The Review of Linear Programming Introduction
In the name of God Part 1. The Review of Linear Programming 1.1. Spring 2010 Instructor: Dr. Masoud Yaghini Outline The Linear Programming Problem Geometric Solution References The Linear Programming Problem
More informationDistributed Real-Time Control Systems. Lecture Distributed Control Linear Programming
Distributed Real-Time Control Systems Lecture 13-14 Distributed Control Linear Programming 1 Linear Programs Optimize a linear function subject to a set of linear (affine) constraints. Many problems can
More informationChapter 1 Linear Programming. Paragraph 5 Duality
Chapter 1 Linear Programming Paragraph 5 Duality What we did so far We developed the 2-Phase Simplex Algorithm: Hop (reasonably) from basic solution (bs) to bs until you find a basic feasible solution
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 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 informationThe Simplex Method: An Example
The Simplex Method: An Example Our first step is to introduce one more new variable, which we denote by z. The variable z is define to be equal to 4x 1 +3x 2. Doing this will allow us to have a unified
More informationIntroduction to the Simplex Algorithm Active Learning Module 3
Introduction to the Simplex Algorithm Active Learning Module 3 J. René Villalobos and Gary L. Hogg Arizona State University Paul M. Griffin Georgia Institute of Technology Background Material Almost any
More informationLinear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004
Linear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004 1 In this section we lean about duality, which is another way to approach linear programming. In particular, we will see: How to define
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 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 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 informationLinear Programming: Simplex Algorithm. A function of several variables, f(x) issaidtobelinear if it satisþes the two
Linear Programming: Simplex Algorithm A function of several variables, f(x) issaidtobelinear if it satisþes the two conditions: (i) f(x + Y )f(x) +f(y )and(ii)f(αx) αf(x), where X and Y are vectors of
More informationGauss-Jordan Elimination for Solving Linear Equations Example: 1. Solve the following equations: (3)
The Simple Method Gauss-Jordan Elimination for Solving Linear Equations Eample: Gauss-Jordan Elimination Solve the following equations: + + + + = 4 = = () () () - In the first step of the procedure, we
More informationIntroduction to optimization
Introduction to optimization Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 24 The plan 1. The basic concepts 2. Some useful tools (linear programming = linear optimization)
More informationMotivating examples Introduction to algorithms Simplex algorithm. On a particular example General algorithm. Duality An application to game theory
Instructor: Shengyu Zhang 1 LP Motivating examples Introduction to algorithms Simplex algorithm On a particular example General algorithm Duality An application to game theory 2 Example 1: profit maximization
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 informationFoundations of Operations Research
Solved exercises for the course of Foundations of Operations Research Roberto Cordone Gomory cuts Given the ILP problem maxf = 4x 1 +3x 2 2x 1 +x 2 11 x 1 +2x 2 6 x 1,x 2 N solve it with the Gomory cutting
More information4.5 Simplex method. min z = c T x s.v. Ax = b. LP in standard form
4.5 Simplex method min z = c T x s.v. Ax = b x 0 LP in standard form Examine a sequence of basic feasible solutions with non increasing objective function value until an optimal solution is reached or
More informationLecture Simplex Issues: Number of Pivots. ORIE 6300 Mathematical Programming I October 9, 2014
ORIE 6300 Mathematical Programming I October 9, 2014 Lecturer: David P. Williamson Lecture 14 Scribe: Calvin Wylie 1 Simplex Issues: Number of Pivots Question: How many pivots does 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 informationCO 602/CM 740: Fundamentals of Optimization Problem Set 4
CO 602/CM 740: Fundamentals of Optimization Problem Set 4 H. Wolkowicz Fall 2014. Handed out: Wednesday 2014-Oct-15. Due: Wednesday 2014-Oct-22 in class before lecture starts. Contents 1 Unique Optimum
More informationSection 4.1 Solving Systems of Linear Inequalities
Section 4.1 Solving Systems of Linear Inequalities Question 1 How do you graph a linear inequality? Question 2 How do you graph a system of linear inequalities? Question 1 How do you graph a linear inequality?
More information