MATH 4211/6211 Optimization Linear Programming
|
|
- Ethel Barker
- 5 years ago
- Views:
Transcription
1 MATH 4211/6211 Optimization Linear Programming Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0
2 The standard form of a Linear Program (LP) minimize subject to c T x Ax = b x 0 where x R n is the unknown variable; A R m n is given, where m < n and rank(a) = m; b R m is given. Xiaojing Ye, Math & Stat, Georgia State University 1
3 Other forms of LP can be converted to the standard form. For example, suppose an LP is given as maximize subject to c T x Ax b x 0 Then we can rewrite it as an equivalent standard form minimize subject to ( c) T x Ax + y = b x, y 0 where [x; y] R n+m is the variable to solve for now, and y is called the slack variable. If [x ; y ] T is a solution of the new problem, then x is a solution of the original problem. Xiaojing Ye, Math & Stat, Georgia State University 2
4 Example. Convert the LP below into the standard form maximize x 2 x 1 subject to 3x 1 = x 2 5 x 2 2 x 1 0 x 1 := x 1, then x 1 0 x 1 0 x 2 = u v where u, v 0 x u v 2 Introduce slack variables x 3, x 4 0 such that u v + x 3 = 2 and u v x 4 = 2 Xiaojing Ye, Math & Stat, Georgia State University 3
5 Example (cont). Now we obtain an equivalent problem: minimize x 1 u + v subject to 3x 1 + u v = 5 u v + x 3 = 2 u v x 4 = 2 x 1, u, v, x 3, x 4 0 Note that there are 5 variables now. Xiaojing Ye, Math & Stat, Georgia State University 4
6 Example. Suppose a factory wants to manufacture 4 products with the cost and budget (availability), as well as their profits, given in the table below. The goal is to maximize total profit. P1 P2 P3 P4 availability man weeks kg of material A boxes of material B profit Solution. Let x i be the quantity to manufacture product i, then the LP is maximize 6x 1 + 4x 2 + 7x 3 + 5x 4 subject to x 1 + 2x 2 + x 3 + 2x x 1 + 5x 2 + 3x 3 + 2x x 1 + 4x 2 + 9x x 3 75 x 1, x 2, x 3, x 4 0 Exercise: convert this into the standard form of LP. Xiaojing Ye, Math & Stat, Georgia State University 5
7 Geometric interpretation of the feasible set Ω = {x R n : Ax b, x 0}: Let a T i be the ith row of A for i = 1,..., m. Then a T i x b i is a half space. Hence Ax b is the intersection of m half spaces, which is a polyhedra. So is Ω. The objective c T x is a plane with slope defined on Ω, and the optimal point x is the point in Ω that has the minimum value c T x. Xiaojing Ye, Math & Stat, Georgia State University 6
8 Basic solutions of linear system Ax = b. Suppose A = [B D] where B R m m has rank(b) = m. Denote x B = B 1 b R m. Then x = is called a basic solution of Ax = b. [ ] xb 0 R n Xiaojing Ye, Math & Stat, Georgia State University 7
9 Definition. We introduce the following terms: x B R m : basic variables If x B has zero component(s), then x is called a degenerate basic solution B: basic columns of A. Note that in practice there are up to ( ) n m ways to choose the basic columns. x is called a feasible point if x Ω := {x R n : Ax = b, x 0}. x Ω is called an optimal (feasible) solution if c T x c T x for all x Ω. Xiaojing Ye, Math & Stat, Georgia State University 8
10 Properties of basic solutions Theorem (Fundamental Theorem of LP). For an LP with nonempty feasible set Ω, the following statements hold: (a) A basic feasible point exists. (b) If LP has solution, then there exists an optimal basic feasible solution. Xiaojing Ye, Math & Stat, Georgia State University 9
11 Proof. Part (a). Let x Ω (since Ω ), i.e., Ax = b and x 0. WLOG, assume x 1,..., x p > 0 and x p+1,..., x n = 0. Then where A = [a 1,..., a p,..., a n ]. Ax = x 1 a x p a p = b If a 1,..., a p are linearly independent, then p m and x is a basic feasible point. If a 1,..., a p are linearly dependent, then y 1,..., y p R not all zero such that Ay = y 1 a y p a p = 0 where y = [y 1,..., y p, 0,..., 0] T R n (WLOG we assume at least one y i > 0 otherwise take y = y), then we know A(x εy) = b for all ε. Xiaojing Ye, Math & Stat, Georgia State University 10
12 Proof (cont). Choose ε = min{x i /y i : y i > 0}, then x εy Ω and has only p 1 nonzero components. Repeat this until we find the basic columns of A and its corresponding basic feasible point. Xiaojing Ye, Math & Stat, Georgia State University 11
13 Proof (cont). Part (b). Let x Ω be optimal, and again WLOG assume x 1,..., x p > 0. If a 1,..., a p are linearly independent, then p m and x is a basic feasible solution. If a 1,..., a p are linearly dependent, then with the same argument as in (a), y 1,..., y p R not all zero such that Ay = y 1 a y p a p = 0 If c T y 0 (say > 0), then by choosing ε min{ x i /y i : y i 0}, we have x εy Ω and c T (x εy) = c T x εc T y < c T x, which contradicts to the optimality of x. Hence c T y = 0. So we can choose ε in the same way as in (a) to get x εy which has p 1 nonzeros. Repeat to obtain a basic feasible solution. Xiaojing Ye, Math & Stat, Georgia State University 12
14 Theorem. Consider an LP with nonempty Ω, then x is an extreme point of Ω iff x is a basic feasible point. In theory, we only need to examine the basic feasible points of Ω and find the optimal basic feasible solution of the LP. However, there could be a large amount of extreme points to examine. Xiaojing Ye, Math & Stat, Georgia State University 13
15 Now we study the Simplex Method designed for LP. Recall basic row operations to linear system Ax = b: interchange two rows multiply one row by a real nonzero scalar Adding a scalar multiple of one row to another row Each of these operations corresponds to an invertible matrix E R m premultiplying to A. Xiaojing Ye, Math & Stat, Georgia State University 14
16 Also recall that, to solve a linear system Ax = b, we first form the augmented matrix [A, b], then apply a series of row operations, say E 1,..., E t, to the matrix to obtain E t E 1 [A, b] = [I, D, B 1 b] where D is such that E t... E 1 A = [I, D] and B = (E t E 1 ) 1 R m m is invertible. Then a particular solution of Ax = b is x = [B 1 b; 0] R n. In addition, note that [ Dx D ; x D ] R n is a solution of [I, D]x = 0 for any x D R n m. Therefore, any solution of Ax = b can be written for some x D R n m as [ B x = 1 ] [ ] b DxD + 0 x D Xiaojing Ye, Math & Stat, Georgia State University 15
17 Suppose we have applied basic row operations and converted Ax = b to [I, Y ]x = y 0 (called the canonical form) where Y = y 1 m+1 y 1 n..... y m m+1 y m n R m (n m) y 0 = y 10. y m0 R m Note that the column y q = [y 1q ;... ; y mq ] R m gives the coefficients to represent a q using a 1,..., a m, where a i is the ith column of A: a q = y 1q a y mq a m = [a 1,..., a m ]y q Now we are using a 1,..., a m as basic columns, and x = [B 1 b; 0] is the corresponding basic solution to Ax = b. If B 1 b 0, then x is a basic feasible point of the LP. Xiaojing Ye, Math & Stat, Georgia State University 16
18 Now we want to move to another basic feasible point. To this end, we need to exchange one of a 1,..., a m with another a q (q > m) to form the new basic columns, find the corresponding basic solution x of Ax = b, making sure that x 0. Exchanging basic columns p and q where p m < q is simple: just apply basic row operations [I, Y ] so that the qth column becomes e p. Here e p R n is the vector with 1 as the pth component and 0 elsewhere. However, which a q we should choose to enter the basic columns, and which a p to leave? Xiaojing Ye, Math & Stat, Georgia State University 17
19 Since x = [y 10 ;... ; y m0 ; 0;... ; 0] R n + to Ax = b, we know is a basic solution corresponding y 10 a y m0 a m = b Suppose we decide to let a q enter the basic columns, then due to a q = y 1q a y mq a m = [a 1,..., a m ]y q we know for any ε 0 there is (y 10 εy 1q )a (y m0 εy mq )a m + εa q = b Xiaojing Ye, Math & Stat, Georgia State University 18
20 Note that y q have positive and nonpositive components (if all are nonpositive then the problem is unbounded), then for ε > 0 gradually increases from 0, one of the coefficients (say p) first becomes 0. We will choose a p to leave the basic columns. More precisely, we choose ε = min i {y i0 /y iq : y iq > 0}, and obtain the basic columns a 1,..., â p,..., a m, a q Xiaojing Ye, Math & Stat, Georgia State University 19
21 Now we consider which a q to enter the basic column. Ideally, we should choose a q such that c T x decreases the most. Recall that the current point is x = [y 0 ; 0] R n. If we choose a q to enter, then the objective function becomes c T [ y0 εy q 0 where z i = c T [1:m] y i for i = 0, 1,..., m. ] + εe q = z 0 + ε[c q (c 1 y 1q + + c m y mq )] = z 0 + (c q z q )ε Xiaojing Ye, Math & Stat, Georgia State University 20
22 If c q z q < 0 for some q, then choosing a q to enter can further reduce the objective function since ε > 0. If there are more than one such q, then choose the one with smallest index or the one with smallest c q z q. If c q z q 0 for all q, then the optimal basic point is reached. These answered which a q to enter, and when the simplex method should stop. Xiaojing Ye, Math & Stat, Georgia State University 21
23 To simplify the process, we consider the matrix form of the simplex method. Given the standard form of an LP minimize subject to c T x Ax = b x 0 we form the tableau of the problem as the matrix [ ] [ ] A b B D b c T = 0 c T B ct D 0 R (m+1) (n+1) Note that the tableau contains all information of the LP. Xiaojing Ye, Math & Stat, Georgia State University 22
24 Premultiplying the matrix [ B T 1 [ B 1 ] 0 0 T 1 ] [ B D b c T B ct D 0 Further premultiplying the matrix [ ] [ I 0 I B 1 D B 1 b c T B 1 c T B c T D 0 to the tableau, we obtain ] = [ I 0 c T B 1 ] = [ I B 1 D B 1 b c T B c T D 0 ] yields [ I B 1 D B 1 ] b 0 T c T D ct B B 1 D c T B B 1 b ] Xiaojing Ye, Math & Stat, Georgia State University 23
25 It is easy to check that [B 1 b; 0] R n is the basic solution c T D ct B B 1 D R n m contains the reduced cost coefficients, i.e., z q c q for q = m + 1,..., n c T B B 1 b R is the objective function Xiaojing Ye, Math & Stat, Georgia State University 24
26 According to the discussion above, the simplex method executes the following actions in order: find the index, say q, of the most negative component among c T D ct B B 1 D R n m ; find p = arg min i {y i0 /y iq : y iq > 0}; pivot the tableau about the (p, q) entry by basic row operations so that the column becomes 0 except the (p, q) entry which is 1. [1 : m, n + 1] gives the current basic solution (basic feasible point), the nonzeros in [m + 1, 1 : n] are the reduced cost coefficients, and the (m + 1, n + 1) entry is the negative of objective function. Xiaojing Ye, Math & Stat, Georgia State University 25
27 Example. Consider the following linear programming problem: maximize 7x 1 + 6x 2 subject to 2x 1 + x 2 3 Solve this LP using the simplex method. x 1 + 4x 2 4 x 1, x 2 0 Solution. We first convert this LP to the standard form: minimize 7x 1 6x 2 subject to 2x 1 + x 2 + x 3 = 3 x 1 + 4x 2 + x 4 = 4 x 1, x 2, x 3, x 4 0 Xiaojing Ye, Math & Stat, Georgia State University 26
28 Solution (cont). The tableau of this LP is where the upper left 2 4 submatrix corresponds to A = [a 1,..., a 4 ], c = [ 7; 6, 0; 0], and b = [3; 4]. Note that A is already in the canonical form: a 3, a 4 are the basic columns, and x = [0; 0; 3; 4] is the basic solution of Ax = b. Since 7 is the most negative term, we will let a 1 enter the basic column. Comparing 3/2 and 4/1, we see the former is smaller and hence decide to let a 3 leave the basic column. Xiaojing Ye, Math & Stat, Georgia State University 27
29 Now pivoting about the (1, 1) entry, we obtain Now we see 5/2 is the most negative term, so we let a 2 enter the basic columns. Comparing 3/2 5/2 = 3 and 1/2 7/2 = 5/7, we let a 4 leave the basic column. Then pivoting about the (2, 2) entry, we obtain There are no negative entries in the last row, so we stop. The optimal solution is x = [ 8 7, 5 7, 0, 0] and optimal value is 86 7 of the LP in its standard form. These correspond to the optimal solution x 1 = 8/7, x 2 = 5/7, and optimal value 86/7 of the original problem. 8 Xiaojing Ye, Math & Stat, Georgia State University 28
30 Starting the Simplex Method The simplex method discussed above is referred to the Phase II which requires an initial point to be a basic feasible point. Now we consider the Phase I which finds one of such basic feasible points. To this end, we introduce artificial variables y R m and consider the following artificial problem: minimize subject to 1 T y Ax + Ey = b x 0, y 0 where 1 = [1,..., 1] T R m, E is diagonal with E ii = sign(b i ). Xiaojing Ye, Math & Stat, Georgia State University 29
31 The artificial problem minimize subject to 1 T y Ax + Ey = b x 0, y 0 has an obvious basic feasible point [x; y] = [0;... ; 0; b 1 ;... ; b m ] with which we can directly apply the Phase II simplex method. Xiaojing Ye, Math & Stat, Georgia State University 30
32 Moreover, the artificial problem in Phase I has a solution iff the original problem has nonempty feasible set Ω. In this case, the artificial problem above have an optimal objective value 0 and optimal solution [x ; y ], such that y = 0 and x is a basic feasible point of the original LP problem: If Ω is nonempty, then there exists x Ω, i.e., Ax = b and x 0. So [x; 0] solves the artificial problem in Phase I. If the artificial problem has a solution such that 0 T y = 0, then y = 0, and x satisfies Ax = b and x 0, which means x Ω. Xiaojing Ye, Math & Stat, Georgia State University 31
Ω 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 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 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 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 informationLinear Programming. Murti V. Salapaka Electrical Engineering Department University Of Minnesota, Twin Cities
Linear Programming Murti V Salapaka Electrical Engineering Department University Of Minnesota, Twin Cities murtis@umnedu September 4, 2012 Linear Programming 1 The standard Linear Programming (SLP) problem:
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 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 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 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 informationOPERATIONS RESEARCH. Linear Programming Problem
OPERATIONS RESEARCH Chapter 1 Linear Programming Problem Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com MODULE - 2: Simplex Method for
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 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 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 informationChapter 1: Linear Programming
Chapter 1: Linear Programming Math 368 c Copyright 2013 R Clark Robinson May 22, 2013 Chapter 1: Linear Programming 1 Max and Min For f : D R n R, f (D) = {f (x) : x D } is set of attainable values of
More informationTHE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS. Operations Research I
LN/MATH2901/CKC/MS/2008-09 THE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS Operations Research I Definition (Linear Programming) A linear programming (LP) problem is characterized by linear functions
More information3 The Simplex Method. 3.1 Basic Solutions
3 The Simplex Method 3.1 Basic Solutions In the LP of Example 2.3, the optimal solution happened to lie at an extreme point of the feasible set. This was not a coincidence. Consider an LP in general form,
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 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 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 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 informationc) Place the Coefficients from all Equations into a Simplex Tableau, labeled above with variables indicating their respective columns
BUILDING A SIMPLEX TABLEAU AND PROPER PIVOT SELECTION Maximize : 15x + 25y + 18 z s. t. 2x+ 3y+ 4z 60 4x+ 4y+ 2z 100 8x+ 5y 80 x 0, y 0, z 0 a) Build Equations out of each of the constraints above by introducing
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 informationLinear programming. Saad Mneimneh. maximize x 1 + x 2 subject to 4x 1 x 2 8 2x 1 + x x 1 2x 2 2
Linear programming Saad Mneimneh 1 Introduction Consider the following problem: x 1 + x x 1 x 8 x 1 + x 10 5x 1 x x 1, x 0 The feasible solution is a point (x 1, x ) that lies within the region defined
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 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 informationThe Simplex Method. Formulate Constrained Maximization or Minimization Problem. Convert to Standard Form. Convert to Canonical Form
The Simplex Method 1 The Simplex Method Formulate Constrained Maximization or Minimization Problem Convert to Standard Form Convert to Canonical Form Set Up the Tableau and the Initial Basic Feasible Solution
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 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 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 informationCSCI 1951-G Optimization Methods in Finance Part 01: Linear Programming
CSCI 1951-G Optimization Methods in Finance Part 01: Linear Programming January 26, 2018 1 / 38 Liability/asset cash-flow matching problem Recall the formulation of the problem: max w c 1 + p 1 e 1 = 150
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 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 informationTermination, Cycling, and Degeneracy
Chapter 4 Termination, Cycling, and Degeneracy We now deal first with the question, whether the simplex method terminates. The quick answer is no, if it is implemented in a careless way. Notice that we
More informationDeveloping an Algorithm for LP Preamble to Section 3 (Simplex Method)
Moving from BFS to BFS Developing an Algorithm for LP Preamble to Section (Simplex Method) We consider LP given in standard form and let x 0 be a BFS. Let B ; B ; :::; B m be the columns of A corresponding
More informationMath 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 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 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 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 informationLINEAR PROGRAMMING I. a refreshing example standard form fundamental questions geometry linear algebra simplex algorithm
Linear programming Linear programming. Optimize a linear function subject to linear inequalities. (P) max c j x j n j= n s. t. a ij x j = b i i m j= x j 0 j n (P) max c T x s. t. Ax = b Lecture slides
More informationLecture slides by Kevin Wayne
LINEAR PROGRAMMING I a refreshing example standard form fundamental questions geometry linear algebra simplex algorithm Lecture slides by Kevin Wayne Last updated on 7/25/17 11:09 AM Linear programming
More informationRow Space and Column Space of a Matrix
Row Space and Column Space of a Matrix 1/18 Summary: To a m n matrix A = (a ij ), we can naturally associate subspaces of K n and of K m, called the row space of A and the column space of A, respectively.
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 informationSolutions of Linear system, vector and matrix equation
Goals: Solutions of Linear system, vector and matrix equation Solutions of linear system. Vectors, vector equation. Matrix equation. Math 112, Week 2 Suggested Textbook Readings: Sections 1.3, 1.4, 1.5
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 informationSummary of the simplex method
MVE165/MMG630, The simplex method; degeneracy; unbounded solutions; infeasibility; starting solutions; duality; interpretation Ann-Brith Strömberg 2012 03 16 Summary of the simplex method Optimality condition:
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 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 informationLinear Programming. Linear Programming I. Lecture 1. Linear Programming. Linear Programming
Linear Programming Linear Programming Lecture Linear programming. Optimize a linear function subject to linear inequalities. (P) max " c j x j n j= n s. t. " a ij x j = b i # i # m j= x j 0 # j # n (P)
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 informationLecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013
Lecture 6 & 7 Shuanglin Shao September 16th and 18th, 2013 1 Elementary matrices 2 Equivalence Theorem 3 A method of inverting matrices Def An n n matrice is called an elementary matrix if it can be obtained
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 informationFebruary 17, Simplex Method Continued
15.053 February 17, 2005 Simplex Method Continued 1 Today s Lecture Review of the simplex algorithm. Formalizing the approach Alternative Optimal Solutions Obtaining an initial bfs Is the simplex algorithm
More informationThe Simplex Algorithm
8.433 Combinatorial Optimization The Simplex Algorithm October 6, 8 Lecturer: Santosh Vempala We proved the following: Lemma (Farkas). Let A R m n, b R m. Exactly one of the following conditions is true:.
More information3. THE SIMPLEX ALGORITHM
Optimization. THE SIMPLEX ALGORITHM DPK Easter Term. Introduction We know that, if a linear programming problem has a finite optimal solution, it has an optimal solution at a basic feasible solution (b.f.s.).
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 information7.5 Operations with Matrices. Copyright Cengage Learning. All rights reserved.
7.5 Operations with Matrices Copyright Cengage Learning. All rights reserved. What You Should Learn Decide whether two matrices are equal. Add and subtract matrices and multiply matrices by scalars. Multiply
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 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 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 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 informationOPRE 6201 : 3. Special Cases
OPRE 6201 : 3. Special Cases 1 Initialization: The Big-M Formulation Consider the linear program: Minimize 4x 1 +x 2 3x 1 +x 2 = 3 (1) 4x 1 +3x 2 6 (2) x 1 +2x 2 3 (3) x 1, x 2 0. Notice that there are
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 informationMA 162: Finite Mathematics - Section 3.3/4.1
MA 162: Finite Mathematics - Section 3.3/4.1 Fall 2014 Ray Kremer University of Kentucky October 6, 2014 Announcements: Homework 3.3 due Tuesday at 6pm. Homework 4.1 due Friday at 6pm. Exam scores were
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 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 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 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 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 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 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 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 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 informationSpring 2017 CO 250 Course Notes TABLE OF CONTENTS. richardwu.ca. CO 250 Course Notes. Introduction to Optimization
Spring 2017 CO 250 Course Notes TABLE OF CONTENTS richardwu.ca CO 250 Course Notes Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4, 2018 Table
More information3 Development of the Simplex Method Constructing Basic Solution Optimality Conditions The Simplex Method...
Contents Introduction to Linear Programming Problem. 2. General Linear Programming problems.............. 2.2 Formulation of LP problems.................... 8.3 Compact form and Standard form of a general
More informationMATH 4211/6211 Optimization Constrained Optimization
MATH 4211/6211 Optimization Constrained Optimization Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 Constrained optimization
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 information4.5 Simplex method. LP in standard form: min z = c T x s.t. Ax = b
4.5 Simplex method LP in standard form: min z = c T x s.t. Ax = b x 0 George Dantzig (1914-2005) Examine a sequence of basic feasible solutions with non increasing objective function values until an optimal
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 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 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 informationSolutions to Review Questions, Exam 1
Solutions to Review Questions, Exam. What are the four possible outcomes when solving a linear program? Hint: The first is that there is a unique solution to the LP. SOLUTION: No solution - The feasible
More information"SYMMETRIC" PRIMAL-DUAL PAIR
"SYMMETRIC" PRIMAL-DUAL PAIR PRIMAL Minimize cx DUAL Maximize y T b st Ax b st A T y c T x y Here c 1 n, x n 1, b m 1, A m n, y m 1, WITH THE PRIMAL IN STANDARD FORM... Minimize cx Maximize y T b st Ax
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 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 informationMidterm Review. Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A.
Midterm Review Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapter 1-4, Appendices) 1 Separating hyperplane
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 informationFinite Mathematics Chapter 2. where a, b, c, d, h, and k are real numbers and neither a and b nor c and d are both zero.
Finite Mathematics Chapter 2 Section 2.1 Systems of Linear Equations: An Introduction Systems of Equations Recall that a system of two linear equations in two variables may be written in the general form
More informationOPTIMISATION 3: NOTES ON THE SIMPLEX ALGORITHM
OPTIMISATION 3: NOTES ON THE SIMPLEX ALGORITHM Abstract These notes give a summary of the essential ideas and results It is not a complete account; see Winston Chapters 4, 5 and 6 The conventions and notation
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 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 informationSummary of the simplex method
MVE165/MMG631,Linear and integer optimization with applications The simplex method: degeneracy; unbounded solutions; starting solutions; infeasibility; alternative optimal solutions Ann-Brith Strömberg
More informationContents. 4.5 The(Primal)SimplexMethod NumericalExamplesoftheSimplexMethod
Contents 4 The Simplex Method for Solving LPs 149 4.1 Transformations to be Carried Out On an LP Model Before Applying the Simplex Method On It... 151 4.2 Definitions of Various Types of Basic Vectors
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 informationMATH 373 Section A1. Final Exam. Dr. J. Bowman 17 December :00 17:00
MATH 373 Section A1 Final Exam Dr. J. Bowman 17 December 2018 14:00 17:00 Name (Last, First): Student ID: Email: @ualberta.ca Scrap paper is supplied. No notes or books are permitted. All electronic equipment,
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 informationWeek 2. The Simplex method was developed by Dantzig in the late 40-ties.
1 The Simplex method Week 2 The Simplex method was developed by Dantzig in the late 40-ties. 1.1 The standard form The simplex method is a general description algorithm that solves any LPproblem instance.
More informationMath 1314 Week #14 Notes
Math 3 Week # Notes Section 5.: A system of equations consists of two or more equations. A solution to a system of equations is a point that satisfies all the equations in the system. In this chapter,
More informationLinear Equation: a 1 x 1 + a 2 x a n x n = b. x 1, x 2,..., x n : variables or unknowns
Linear Equation: a x + a 2 x 2 +... + a n x n = b. x, x 2,..., x n : variables or unknowns a, a 2,..., a n : coefficients b: constant term Examples: x + 4 2 y + (2 5)z = is linear. x 2 + y + yz = 2 is
More informationMATH 2331 Linear Algebra. Section 1.1 Systems of Linear Equations. Finding the solution to a set of two equations in two variables: Example 1: Solve:
MATH 2331 Linear Algebra Section 1.1 Systems of Linear Equations Finding the solution to a set of two equations in two variables: Example 1: Solve: x x = 3 1 2 2x + 4x = 12 1 2 Geometric meaning: Do these
More informationLecture: Algorithms for LP, SOCP and SDP
1/53 Lecture: Algorithms for LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2018.html wenzw@pku.edu.cn Acknowledgement:
More information