Distributed Real-Time Control Systems. Lecture Distributed Control Linear Programming
|
|
- Constance York
- 5 years ago
- Views:
Transcription
1 Distributed Real-Time Control Systems Lecture Distributed Control Linear Programming 1
2 Linear Programs Optimize a linear function subject to a set of linear (affine) constraints. Many problems can be posed as linear programs and have wide application in operations research: scheduling assignment problems supply chain management automation optimal pricing transportation 2
3 Example: Mr. Silva s Electronics, Lda Mr. Silva has an electronics company that produces two products: (P1) MP3 players (P2) Alarm Clocks. MP3 players can be sold at 7 and Alarm Clocks at 5. The company has a stock of 100 NIMH battery cells and 240 push buttons. Each MP3 player needs 2 battery cells and 4 pushbuttons. Each Alarm Clock needs 1 battery cell and 3 pushbuttons. How many items of each product should Mr. Silva produce to maximize his profit? 3
4 Example: Mr. Silva s Electronics, Lda x 1 : amount of MP3 players to produce x 2 : amount of Alarm clocks to produce Maximize Profit: Battery Cells constraint: Push Buttons constraint: Positivity constraints: 7x 1 + 5x 2 2x 1 +1x x 1 + 3x x 1 0, x 2 0 4
5 Example: Mr. Silva s Electronics, Lda maximize c T x subject to Ax b, x 0! x = x 1 x 2 c =! 7 5! A = ! b =
6 Example: Mr. Silva s Electronics, Lda x x 1 +1x When constraints are written as: v T i x + b i 0 then, their gradient (v i ), points toward the feasible region. v 3 apple 1 0 apple 0 1 x 1 0 v 1 v 1 = v 2 = v 2 x 2 0 4x 1 + 3x x 1 v 3 = apple 2 1 v 4 = apple 4 3 v 4 6
7 Example: Mr. Silva s Electronics, Lda x x 1 +1x x 2 0 Feasible Region 4x 1 + 3x x x 1 7
8 Example: Mr. Silva s Electronics, Lda x 2 Profit level sets Feasible Region! 7 5 Profit Gradient x 1 8
9 Example: Mr. Silva s Electronics, Lda x 2 Optimal Solution 2x 1 +1x 2 =100! 4x 1 + 3x 2 x 1 = 240 x 2 =! ! ! x 1 x 2 =! Feasible Region x 1 9
10 Properties of linear programs Feasible regions are convex polyhedra. Both minimization and maximization problems are convex (linear functions are both convex and concave). Local optima are also global optima. 10
11 Unboundedness: If the feasible set is unbounded in the direction of the gradient, there is no finite solution (solution at infinity) Infeasibility: If the conjunction of the constraint is the empty set. The problem is impossible (no solution) Impossible Cases 11
12 Degenerate Cases Non-uniqueness: If the gradient is orthogonal to a constraint with optimal solutions, all corners associated to that constraint are also optima (multiple solutions) Gauge freedom: Multiple corners at the same point. Solution is unique but some algorithms may have problems with this. constraint 2 continuum of optimal solutions constraint 1 constraint 3 12
13 Solutions to Linear Programs Unfortunately most real-world problems have more than two variables. Graphical methods are not possible. Two main types of approaches: Simplex methods: iterate over sequences of extreme points (vertices) of the feasibility polyhedron. Interior point methods: iterate on the interior of the feasibility region. Performance depends on problem type. 13
14 Simplex methods Start on a feasible solution (vertex) of the problem and move along edges to a neighboor with a better cost. Stop when minimum is reached or unbounded edge visited. NOTE: Requires an initial feasible solution at a vertex. 14
15 Standard equality form minimize c T x subject to Ax = b, x 0, b 0 Minimization instead of maximization. Only equality constraints. All variables non-negative. All entries of vector b non-negative. 15
16 Conversion to Standard Equality Form If problem is max z convert it to min z. If there are constraints with negative right hand side, multiply them by -1 To convert a unconstrained variables x, replace it by two new non-negative variables x + -x -. max 7x 1 + 5x 2 min 7x 1 5x 2 x 1 2x 2 8 x 1 + 2x 2 8 x 1 unrestricted x 1 = x 1 + x 1, x 1 + 0, x
17 Conversion to Standard Equality Form Convert lower-than-orequal inequalities to equalities by adding nonnegative slack variables. Convert greater-than-orequal inequalities to equalities by subtracting non-negative surplus variables. 4x 1 + 3x x 1 + 3x 2 + s 1 = 240, s 1 0 x 1 + 2x 2 8 x 1 + 2x 2 s 2 = 8, s 2 0 Set each slack and surplus variables s coefficients in the cost function to zero. 17
18 Example: Mr. Silva s Electronics, Lda x 1 : amount of MP3 players to produce x 2 : amount of Alarm clocks to produce s 1 : amount of unused battery cells. s 2 : amount of unused push buttons. Minimize negative profit: Battery Cells constraint: Push Buttons constraint: Positivity constraints: 7x 1 5x 2 2x 1 + x 2 + s 1 =100 4x 1 + 3x 2 + s 2 = 240 x 1 0, x 2 0, s 1 0, s
19 Example: Mr. Silva s Electronics, Lda Linear Program in Standard Equality form: minimize c T x subject to Ax = b, x 0, b 0! x = x 1 x 2 s 1 s 2 c = ! A = ! b =
20 Definitions minimize c T x subject to Ax = b, x 0 x R n b R d A R d n c R n c i R A i R d T! T h i = c i A i H = h i { } i=1...n G H - i th entry of vector c - i th column of matrix A - problem column - set of all problem columns - A subset of the problem columns d = number of affine constraits = number of rows of A = number of slack/surplus variables n = number of original + slack/surplus variables c G A G x G - cost vector reconstructed from columns in G - constraint matrix reconstructed from columns in G - decision variables reconstructed from columns in G 20
21 Table Form! H 0 b Fully represents the LP in standard equality form H x 1 7 x 2 5 s 1 0 s A b c 21
22 Basis Assume rank(a)=d. A set B of exactly d columns is called a basis if rank(a B )=d Example. B = {h 3, h 4 } h 3 h A B 22
23 Basic Solutions Basic solution is a solution x composed of d basic variables x B 0, and a set of n-d non-basic variables x N =0. A basic variable is a variable with only non-negativity constraints. A basic solution is feasible if all basic variables are positive. Example: x = [ ] Basic variables: s 1 = 100 s 2 = 240 Non-basic variables: x 1 = 0 x 2 = This is a trivial basic solution and can be used to initialize the simplex search. 23
24 Computing Basic Solutions Having selected a basis B, a basic solution can be computed by solving the linear system:! A B x B = b x N = 0! x B = A 1 B b x N = 0 The associated cost is: z B = c B T x B The solution is feasible if all elements of x B are nonnegative. 24
25 Example: Mr. Silva s Electronics, Lda Computing a non-trivial basic solution. Let the basis be B = {h 2,h 3 }. c B b A 1 B = 0 1/ 3 1 1/ 3 [ ] T = A B 1 b = x B = x 2, s Feasible Region x B T A B FEASIBLE BASIC SOLUTION
26 Example: Mr. Silva s Electronics, Lda Now let the basis be B = {h 2,h 4 }. A 1 b = apple c B x B =[x 2,s 2 ] T = [100, 60] T A B b x x 2 0 2x 1 +1x Feasible Region x B 4x 1 + 3x x 2 0 NON FEASIBLE BASIC SOLUTION x 1 26
27 Adjacent Bases Two basis B 1 and B 2 are said to be adjacent if only one variable differs from one to the other, i.e. there exists an entering column e and a leaving column l such that: e B 2, l B 1, B 2 = { B 1 e} \ { l} Example: B 1 and B 2 are adjacent bases: e = h 2, l = h B 2 B 1 27
28 Perturbation Analysis To evaluate the effect of changing from a basis to an adjacent one, let us consider: B current basis x B current basic solution x h non-basic variable, corresponding to column h. Let us perturb the solution by allowing x h to have values above 0 (feasible). The basic variables will change their value to x B and the solution must verify: Ax = b A B A h x B x h = b x B = A B 1 (b A h x h ) x 0 B = x B A 1 B A hx h 28
29 Example: Mr. Silva s Electronics, Lda Perturbed solution: Example: B = {h 2, h 3 } A h = A 1, x h = x 1 x 0 B = apple x 0 B = x B A 1 B A hx h ( x 0 2 = x 1 s 0 1 = x 1 apple apple 2 4 x 1 A h = A 4, x h = s 2 x 0 B = apple ( x 0 2 = s 2 s 0 1 = s 2 apple apple 0 1 x 1 29
30 Graphical Analysis Perturbations around the current solution (green dot). A unit increase in the variable x 1 will make the solution travel along the green arrow and decrease 4/3 on x x 2 x 2 = 4 3 x 1 x 2 = 1 3 s 2 A unit increase in variable s 2 will make the solution travel along the red arrow and decrease 1/3 on x x 1 30
31 Reduced cost Given a basis B and a single non-basic column h, its reduced cost represents its contribution to the cost (unitary cost variation) if it enters the basis: z = c T! x = c T B c h! x B x h z = c B T A B 1 (b A h x h )+ c h x h z = c B T x B + (c h c B T A B 1 A h )x h What we gain by adding one element of this variable to the solution c h = c h c B T A B 1 A h What we loose by consuming the resources required. 31
32 Example: Mr. Silva s Electronics, Lda Reduced costs: c h = c h c B T A B 1 A h Example: B = {h 2, h 3 } c h = c h A h T c 1 = c c 4 = c ( A B ) T c B 0 1 1/ 3 1/ / 3 1/ c B A 1 A /3 5/3 A B reduced costs 32
33 Graphical Analysis The cost variation is the inner product of the cost gradient with the perturbation vector. 80 x 2 4x 1 + 3x 2 = 240 c 1 = c 1 x = T x 1 apple x 1 +1x 2 = x 1 = 1 3 x 1 Cost Gradient 33
34 Analysis Current solution: x =! Reduced costs: c = 1/ / 3 A 1 A /3 5/3 A B Adding a unit of MP3 Player (x 1 ) has a value of 7 but in the current solution it requires 4 unavailable push buttons, that must be removed from alarm clocks. Because one alarm clock uses 3 push buttons, removing 4 push buttons will penalize us in 4/3 of the value of the alarm clock (5). Therefore we gain 7 but loose 20/3, so the net gain is 1/3. Adding a unit of a push button (s 2 ) has no value and forces us to remove 1 push button from an Alarm clock. By the same reasoning as before, we loose 1/3 of the value of an alarm clock, i.e. 5/3. 34
35 The entering column Any column whose reduced cost is negative can enter the basis: c h = c h A h T ( 1 A ) T B c B < 0 Often it is chosen the column with the minimal negative cost: T e = argmin{c h A h h ( 1 A ) T B c B c h < 0} 35
36 The leaving column Given an entering column e we are allowing the nonbasic variable x e to grow from zero to a positive value. As x e grows, what is the first basic variable reaching value 0? x x e x 1 36
37 The leaving column The basic variables will change as (check the Perturbation Analysis slide):! A B A e! x B x e x B = A B 1 (b A e x e ) = b 37
38 The leaving column 2/2 To assure feasibility we need: x 0 B = A 1 B (b A ex e ) 0 (x 0 B) j =(A 1 B b) j (A 1 B A e) j x e The first variable x j reaching 0 as x e grows enters the non basic variable set. j = argmin ( A 1 B b) j A ( A 1 B A ) B e j ( 1 A ) e > 0 j 0, 8j x e apple (A 1 B b) j (A 1 B A, (A 1 B e) A e) j > 0, 8j j ( 38
39 Optimal Solutions Fundamental theorems: If an LP has an optimal feasible solution, then it has an optimal feasible basic solution. Every fully non-degenerate LP has at most one optimal solution. If an LP has an optimal solution and is non-degenerate, then there exists a sequence of adjacent bases from any basis B to the unique optimal basis B*. 39
40 Basic Simplex Procedure 1. Let a feasible basis B be given. 2. While there exists an entering column e such that e B, c e < 0 find a leaving basic column l such that { B e} \ { l} is still a feasible basis. 3. Exchange l with e to find a new basis. This operation is denoted Pivot. 40
41 The initial basis Choose a subset of the columns of A forming an diagonal matrix (easily invertible), arising from slack variables. For constraints without slack variables, add an artificial variable with large associated cost M. Advantage: Initial basis is feasible. 41
42 Initial Basis : Artificial Variables Artificial variables allow an initial identity basis. Greater-than-or-equal constraints take surplus variables instead of slack variables. 2x 1 + x =) 2x 1 + x 2 s 1 + a 1 = 100, s 1,a 1 0 Equality constraits have neither slack nor surplus variables. 4x 1 +3x 2 = 240 =) 4x 1 +3x 2 + a 2 = 240, a
43 Initial Basis : Example b i s must be non-negative min 7x 1 5x 2 ( 2x 1 + x s.t. 4x 1 3x ( 2x 1 + x x 1 3x ( 2x 1 + x 2 s 1 + a 1 = 100 4x 1 3x 2 s 2 + a 2 = 240 x 1 x 2 s 1 s 2 a 1 a 2 b M M Initial basis 43
44 The iterations As seen in the previous slides the inverse of the basis matrix A B plays an important role in many operations. Computing the basic solution x B = A B 1 b Computing the reduced cost c h = c h c B T A B 1 A h Select the entering column T e = argmin{c h A h h Selecting the leaving column j = argmin ( A 1 B b) A 1 j B A e 1 ( A B ) T c B c h < 0} ( ) A j ( 1 B A e ) > 0 j { } 44
45 Gauss Elimination When the initial basis is the identity, the computation of the inverse can be done in a simple way with Gaussian elimination at each pivot operation, and the problem table transformed so as the new basis is the identity again. [A B A N ] apple xb x N = b A B 1 I A 1 B A apple x B N = A 1 x B b N Having the basis as the identity is very useful because the solution, entering and leaving columns can be checked by inspection. 45
46 Gauss Elimination Remember Mr. Silva. c c T Bx B = b T c B A b 46
47 Gauss Elimination Starting with identity basis x 1 x 2 s 1 s 2 b A B 47
48 Gauss Elimination We want to make columns 1 enter the basis and column 3 leave the basis x 1 x 2 s 1 s 2 b e l A B 48
49 Gauss Elimination The new basis will be composed by columns 1 and x 1 x 2 s 1 s 2 b A B A B We have to make linear combinations of the rows of [A b] to let the identity matrix emerge from columns 1 and 4. 49
50 Gauss Elimination Locate the pivot element a je in the entering column e at the row where the leaving column had value x 1 x 2 s 1 s 2 b Pivot A B The objective is to make the pivot equal to 1 and all other elements of that column equal to 0 50
51 Gauss Elimination Divide the pivot line a j by the pivot value a je. a j a j / a je Pivot x 1 x 2 s 1 s 2 b A B 51
52 Gauss Elimination Divide the pivot line a j by the pivot value a je. a j a j / a je Pivot x 1 x 2 s 1 s 2 b A B 52
53 Gauss Elimination Let the remaining lines be a i = a i a ie a j a i a i a ie a j Pivot x 1 x 2 s 1 s 2 b A B 53
54 Gauss Elimination Let the remaining lines be a i = a i a ie a j a i a i a ie a j Pivot x 1 x 2 s 1 s 2 b A B 54
55 Gauss Elimination Let the remaining lines be a i = a i a ie a j a i a i a ie a j Pivot x 1 x 2 s 1 s 2 b A B 55
56 Gauss Elimination The new basic solution is now x 1 = 50, s 2 = 40 The associated cost is x 1 x 2 s 1 s 2 b 3 Pivot A B 56
57 Simple computations Once the basis is the identity, computations are simpler: x B = b j = argmin c h = c h c B T A h e = argmin{c h A T h c B c h < 0} h ( b ) j A e ( ) j ( A e ) j > 0 { } 57
58 The Simplex Algorithm (1/2) 1. Put the problem in standard equality form for minimization with enough slack/auxiliary variables to have a initial identity basis. 2. Determine which variable to enter the solution. Identify the column with the lowest negative reduced cost. This is the pivot column e. e = argmin{c h A T h c B c h < 0} h 3. Determine which variable to replace. Consider only rows with positive values in the pivot column. Divide each amount in the quantity column (last column) by the corresponding number of the entering column. The row with the smallest non-negative number is the pivot row j. If all are negative, the problem is unbounded. Exit. j = argmin ( b ) j A e ( ) j ( A e ) j > 0 { } 58
59 The Simplex Algorithm (2/2) 4. Compute new values for the pivot row. Divide all elements by the pivot number. a j a j / a je 5. Compute new values for the remaining rows. Take the element of this row at the pivot column, multiply it by the pivot row, and subtract the result from itself. a i a i a ie a j 6. Compute the reduced costs. If all are non-negative, the algorithm converged, goto 7. Otherwise goto 2. c h = c h c B T A h 7. If an artificial variable is in the basis, the problem is unfeasible. Otherwise this is the optimal solution. Exit. 59
60 Mr. Silva Full Solution Step 1 Table Form
61 Mr. Silva Full Solution Step 2 Compute reduced costs and choose entering column e = argmin{c h A T h c B c h < 0} h 61
62 Mr. Silva Full Solution Step 3 Determine which variable to replace j = argmin ( b ) j A e ( ) j ( A e ) j > 0 { } 62
63 Mr. Silva Full Solution Step 4 Normalize Pivot Row a j a j / a je 63
64 Mr. Silva Full Solution Step 5 Compute remaining rows a i a i a ie a j 64
65 Mr. Silva Full Solution Step 6 Recompute reduced costs c h = c h c B T A h Goto 2. 65
66 Mr. Silva Full Solution Step 2 Choose entering column e = argmin{c h A T h c B c h < 0} h 66
67 Mr. Silva Full Solution Step 3 Determine which variable to replace j = argmin ( b ) j A e ( ) j ( A e ) j > 0 { } 67
68 Mr. Silva Full Solution Step 4 Normalize Pivot Row a j a j / a je 68
69 Mr. Silva Full Solution Step 5 Compute remaining rows a i a i a ie a j 69
70 Mr. Silva Full Solution Step 6 Re-compute reduced costs c h = c h c B T A h All reduced costs positive: converged. 70
71 Mr. Silva Full Solution Step 7 Conclude No artificial variable in the basis. Optimal solution: x 1 = 30, x 2 = 40, remaining 0. 71
72 Homework Formulate the illumination control problem with two luminaires as a linear program with energy minimization. Solve the problem for a sensible set of values for the cost and coupling constraints. 72
Standard 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 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 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 informationThe Dual Simplex Algorithm
p. 1 The Dual Simplex Algorithm Primal optimal (dual feasible) and primal feasible (dual optimal) bases The dual simplex tableau, dual optimality and the dual pivot rules Classical applications of linear
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 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 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 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 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 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 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 informationIntroduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Module - 03 Simplex Algorithm Lecture 15 Infeasibility In this class, we
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 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 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 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 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 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 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 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 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 informationThe Simplex Algorithm and Goal Programming
The Simplex Algorithm and Goal Programming In Chapter 3, we saw how to solve two-variable linear programming problems graphically. Unfortunately, most real-life LPs have many variables, so a method is
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 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 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 informationLinear Programming, Lecture 4
Linear Programming, Lecture 4 Corbett Redden October 3, 2016 Simplex Form Conventions Examples Simplex Method To run the simplex method, we start from a Linear Program (LP) in the following standard simplex
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 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 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 informationUNIT-4 Chapter6 Linear Programming
UNIT-4 Chapter6 Linear Programming Linear Programming 6.1 Introduction Operations Research is a scientific approach to problem solving for executive management. It came into existence in England during
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 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 informationLinear programs, convex polyhedra, extreme points
MVE165/MMG631 Extreme points of convex polyhedra; reformulations; basic feasible solutions; the simplex method Ann-Brith Strömberg 2015 03 27 Linear programs, convex polyhedra, extreme points A linear
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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationThe Graphical Method & Algebraic Technique for Solving LP s. Métodos Cuantitativos M. En C. Eduardo Bustos Farías 1
The Graphical Method & Algebraic Technique for Solving LP s Métodos Cuantitativos M. En C. Eduardo Bustos Farías The Graphical Method for Solving LP s If LP models have only two variables, they can be
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 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 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 informationLinear Programming: Simplex
Linear Programming: Simplex Stephen J. Wright 1 2 Computer Sciences Department, University of Wisconsin-Madison. IMA, August 2016 Stephen Wright (UW-Madison) Linear Programming: Simplex IMA, August 2016
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 informationThe Simplex Algorithm
The Simplex Algorithm How to Convert an LP to Standard Form Before the simplex algorithm can be used to solve an LP, the LP must be converted into a problem where all the constraints are equations and
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 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 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 informationLinear Programming Inverse Projection Theory Chapter 3
1 Linear Programming Inverse Projection Theory Chapter 3 University of Chicago Booth School of Business Kipp Martin September 26, 2017 2 Where We Are Headed We want to solve problems with special structure!
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 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 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 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 information56:270 Final Exam - May
@ @ 56:270 Linear Programming @ @ Final Exam - May 4, 1989 @ @ @ @ @ @ @ @ @ @ @ @ @ @ Select any 7 of the 9 problems below: (1.) ANALYSIS OF MPSX OUTPUT: Please refer to the attached materials on the
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 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 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 informationThe simplex algorithm
The simplex algorithm The simplex algorithm is the classical method for solving linear programs. Its running time is not polynomial in the worst case. It does yield insight into linear programs, however,
More informationMATH 4211/6211 Optimization Linear Programming
MATH 4211/6211 Optimization Linear Programming Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 The standard form of a Linear
More informationLinear Programming. H. R. Alvarez A., Ph. D. 1
Linear Programming H. R. Alvarez A., Ph. D. 1 Introduction It is a mathematical technique that allows the selection of the best course of action defining a program of feasible actions. The objective of
More information56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker
56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker Answer all of Part One and two (of the four) problems of Part Two Problem: 1 2 3 4 5 6 7 8 TOTAL Possible: 16 12 20 10
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 information4. Duality and Sensitivity
4. Duality and Sensitivity For every instance of an LP, there is an associated LP known as the dual problem. The original problem is known as the primal problem. There are two de nitions of the dual pair
More information15-780: LinearProgramming
15-780: LinearProgramming J. Zico Kolter February 1-3, 2016 1 Outline Introduction Some linear algebra review Linear programming Simplex algorithm Duality and dual simplex 2 Outline Introduction Some linear
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 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 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 informationSimplex method(s) for solving LPs in standard form
Simplex method: outline I The Simplex Method is a family of algorithms for solving LPs in standard form (and their duals) I Goal: identify an optimal basis, as in Definition 3.3 I Versions we will consider:
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 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 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 informationDuality in LPP Every LPP called the primal is associated with another LPP called dual. Either of the problems is primal with the other one as dual. The optimal solution of either problem reveals the information
More information56:171 Operations Research Midterm Exam--15 October 2002
Name 56:171 Operations Research Midterm Exam--15 October 2002 Possible Score 1. True/False 25 _ 2. LP sensitivity analysis 25 _ 3. Transportation problem 15 _ 4. LP tableaux 15 _ Total 80 _ Part I: True(+)
More informationDr. S. Bourazza Math-473 Jazan University Department of Mathematics
Dr. Said Bourazza Department of Mathematics Jazan University 1 P a g e Contents: Chapter 0: Modelization 3 Chapter1: Graphical Methods 7 Chapter2: Simplex method 13 Chapter3: Duality 36 Chapter4: Transportation
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 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 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 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 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 informationSensitivity Analysis and Duality in LP
Sensitivity Analysis and Duality in LP Xiaoxi Li EMS & IAS, Wuhan University Oct. 13th, 2016 (week vi) Operations Research (Li, X.) Sensitivity Analysis and Duality in LP Oct. 13th, 2016 (week vi) 1 /
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 informationChapter 2: Linear Programming Basics. (Bertsimas & Tsitsiklis, Chapter 1)
Chapter 2: Linear Programming Basics (Bertsimas & Tsitsiklis, Chapter 1) 33 Example of a Linear Program Remarks. minimize 2x 1 x 2 + 4x 3 subject to x 1 + x 2 + x 4 2 3x 2 x 3 = 5 x 3 + x 4 3 x 1 0 x 3
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 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 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 information56:171 Operations Research Fall 1998
56:171 Operations Research Fall 1998 Quiz Solutions D.L.Bricker Dept of Mechanical & Industrial Engineering University of Iowa 56:171 Operations Research Quiz
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 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 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 informationAM 121 Introduction to Optimization: Models and Methods Example Questions for Midterm 1
AM 121 Introduction to Optimization: Models and Methods Example Questions for Midterm 1 Prof. Yiling Chen Fall 2018 Here are some practice questions to help to prepare for the midterm. The midterm will
More information