Linear Programming and the Simplex method
|
|
- Oswald Conley
- 5 years ago
- Views:
Transcription
1 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
2 Outline Introduction to Linear Programming Simplex Basics Computational Details Demonstration Dual problem of LP Harald Enzinger, Michael Rath Jan 9, 2012 page 2/37
3 Outline Introduction to Linear Programming Simplex Basics Computational Details Demonstration Dual problem of LP Harald Enzinger, Michael Rath Jan 9, 2012 page 3/37
4 Formulation of a Linear Program minimize subject to c T x Ax b Cx = d The objective function c T x is a linear function of n decision variables x 1 to x n There can be linear inequality and equality constraints The constraints define a feasible set of solutions The goal is to find a feasible solution that minimizes the objective function Harald Enzinger, Michael Rath Jan 9, 2012 page 4/37
5 Geometric Interpretation of a Linear Equation in 2D ( ) a T a1 x = b with a = a 2 x = ( x1 x 2 a 1 x 1 + a 2 x 2 = b x 2 = a 1 a 2 x 1 + b a 2 ) Harald Enzinger, Michael Rath Jan 9, 2012 page 5/37
6 Proof of Geometric Interpretation a T x = a T (x + x ) = a T x + a T x = a x cos(0 ) + a x cos(90 ) = a x = b x = b a Harald Enzinger, Michael Rath Jan 9, 2012 page 6/37
7 Generalization to more Dimensions a T x = b dim x = n n = 3: Plane n > 3: Hyperplane a T x b or a T x b Halfspace that is defined by (Hyper-) Plane Harald Enzinger, Michael Rath Jan 9, 2012 page 7/37
8 Set of Equations a 11 a 1n x 1... a m1 a mn x n = b 1. b m Ax = b solution is an affine subspace dimension of solution space: n rank(a) Ax b Intersection of m Halfspaces Harald Enzinger, Michael Rath Jan 9, 2012 page 8/37
9 Visualization of a Linear Program Polyhedron represents feasible region (Hyper-) planes represent constant objective function value Objective function value is proportional to distance from origin Optimal solution lies on the surface of the polyhedron Optimal solution lies in a corner of the polyhedron Optimal solution is a global optimum Harald Enzinger, Michael Rath Jan 9, 2012 page 9/37
10 Special Cases of feasible region No intersection of halfspaces Optimal solution is unbounded Harald Enzinger, Michael Rath Jan 9, 2012 page 10/37
11 Canonical Form of a Linear Program maximize subject to c T x Ax b x 0 minimization of c T x is equal to maximization of c T x constraint a T x b is equal to constraint a T x b constraint a T x = b is equal to constraints a T x b and a T x b unbounded variable x i can be split into two bounded variables: x i unbounded x i = x i1 x i2 x i1 0 x i2 0 Harald Enzinger, Michael Rath Jan 9, 2012 page 11/37
12 Transformation to Standard Form Transform inequations to equations by introducing slack variables x n+1 to x n+m a T i x b i a T i x + x n+i = b i Ax b (A I)x = b a 11 a 1n a m1 a mn 0 1 x 1. x n x n+1. x n+m = b 1. b m Harald Enzinger, Michael Rath Jan 9, 2012 page 12/37
13 Basic Solutions a 11 a 1n 1 0 b a m1 a mn 0 1 b m A basis is a subset of m linearly independent columns Basic variables x B are variables that belong to the basis Non-basic variables x N are the remaining variables A basic solution is found by setting x B = A 1 B b and x N = 0 e.g. x T B = (x n+1 x n+m ) x T N = (x 1 x n ) x B = b x N = 0 Harald Enzinger, Michael Rath Jan 9, 2012 page 13/37
14 Corners of Polyhedron Relation of Basic Solutions and Corners Every basic solution corresponds to a corner of the polyhedron. x N = 0 Solution lies in intersection of hyperplanes H j, j N x B = A 1 B b is unique Solution is unique A unique intersection of n hyperplanes must be a corner. Additional Properties A basic solution / corner is feasible if all x B 0 A basic solution / corner is degenerated if there is an x B = 0 Harald Enzinger, Michael Rath Jan 9, 2012 page 14/37
15 Example for Basic Solutions and Edges n = 2 variables m = 3 constraints x 1 + x 2 4 2x 1 x 2 3 x 2 1 x 1 0 x 2 0 Harald Enzinger, Michael Rath Jan 9, 2012 page 15/37
16 Example for Basic Solutions and Edges N = {1, 2} B = {3, 4, 5} Edge is feasible and not degenerated x x 4 = 3 x T = (0, 0, 4, 3, 1) x 5 1 Harald Enzinger, Michael Rath Jan 9, 2012 page 16/37
17 Example for Basic Solutions and Edges N = {1, 3} B = {2, 4, 5} Edge is not feasible and not degenerated x x 4 = 3 x T = (0, 4, 0, 7, 3) x 5 1 Harald Enzinger, Michael Rath Jan 9, 2012 page 17/37
18 Example for Basic Solutions and Edges N = {4, 5} B = {1, 2, 3} Edge is feasible and degenerated x x 2 = 3 x T = (2, 1, 0, 0, 0) x 3 1 Harald Enzinger, Michael Rath Jan 9, 2012 page 18/37
19 Outline Introduction to Linear Programming Simplex Basics Computational Details Demonstration Dual problem of LP Harald Enzinger, Michael Rath Jan 9, 2012 page 19/37
20 The Simplex method Basic Idea Start at corner point initial basic solution Move along edge increase one variable at a time Select variable with largest improvement of z entering variable Move to next feasible corner point select leaving variable Repeat until optimal corner point reached no more improvement of z Harald Enzinger, Michael Rath Jan 9, 2012 page 20/37
21 The Simplex method Basic Idea Harald Enzinger, Michael Rath Jan 9, 2012 page 21/37
22 The Simplex method Requirements LP in standard form: maximize subject to Convert LP to standard form a i x b i: z = c x Ax = b x 0, b 0 Introduce slack variable a i x + s i = b i Example: 6x 1 + 4x x 1 + 4x 2 + s 1 = 24 a i x b i: Introduce surplus variable a i x S i = b i Example: x 1 + x x 1 + x 2 S 1 = 800 Harald Enzinger, Michael Rath Jan 9, 2012 page 22/37
23 The Simplex method - Computational Details Initialization Build tableau for canonical form Use slack variables as starting basic solution Basic x 1... x n s 1... s m Solution z c 1... c n z-row s 1 a a 1n b 1 s 1 -row s m a m1... a mn b m s m -row z-row corresponds to z c 1 x 1 c 2 x 2... c n x n = 0 Harald Enzinger, Michael Rath Jan 9, 2012 page 23/37
24 The Simplex method - Computational Details Optimality condition Choose variable to enter the basic solution Take the one with the most negative coefficient in objective equation (z-row) If there is none with negative coefficient, optimality has been reached Basic x 1 x 2 s 1 s 2 s 3 s 4 Solution z z-row s s 1 -row s s 2 -row s s 3 -row s s 4 -row Harald Enzinger, Michael Rath Jan 9, 2012 page 24/37
25 The Simplex method - Computational Details Feasibility condition Choose variable to leave the basic solution Take the one with the minimum non-negative ratio Ratios of {solution/entering variable coefficient} correspond to intercerpts of constraints with entering variable Basic x 1 x 2 s 1 s 2 s 3 s 4 Solution Ratio z s = 4 6 s = 6 s < 0 s Harald Enzinger, Michael Rath Jan 9, 2012 page 25/37
26 The Simplex method - Computational Details Swapping Entering and Leaving Variable Replace leaving var. in basic solution with entering var. Basic x 1 x 2 s 1 s 2 s 3 s 4 Solution z s s 1 -row s s 2 -row s s 3 -row s s 4 -row Harald Enzinger, Michael Rath Jan 9, 2012 page 26/37
27 The Simplex method - Computational Details Swapping Entering and Leaving Variable New pivot row = Current pivot row / Pivot element Basic x 1 x 2 s 1 s 2 s 3 s 4 Solution z x x 1 -row s s 2 -row s s 3 -row s s 4 -row Harald Enzinger, Michael Rath Jan 9, 2012 page 26/37
28 The Simplex method - Computational Details Swapping Entering and Leaving Variable New row = (Current row) - (its pivot col.coeff.) (New pivot row) Basic x 1 x 2 s 1 s 2 s 3 s 4 Solution z x x 1 -row s s 2 -row s s 3 -row s s 4 -row Harald Enzinger, Michael Rath Jan 9, 2012 page 26/37
29 The Simplex method - Computational Details Swapping Entering and Leaving Variable Solution of iteration Basic x 1 x 2 s 1 s 2 s 3 s 4 Solution 5 z x x 1 -row 4 s s 2 -row 5 1 s s 3 -row s s 4 -row Harald Enzinger, Michael Rath Jan 9, 2012 page 26/37
30 The Simplex method - Computational Details Getting initial basic feasible solution (BFS) For canonical form one can take slack variables for initial BFS (=) Constraints a i x = b i: Introduce artificial variable a i x + R i = b i ( ) Constraints a i x b i: Introduce surplus and artificial variable a i x S i + R i = b i Dealing with artificial variables Eliminate artificial variables using standard simplex to get BFS M-method or Two-phase Method Harald Enzinger, Michael Rath Jan 9, 2012 page 27/37
31 The Simplex method - Computational Details M-method Introduce high penalty into objective function for artificial variables Maximize z = c x MR Choose M accordingly to guarantee drop out of artificial variables Large M can result in roundoff errors that impair accuracy Basic x 1 x 2 x 3 R 1 R 2 Solution z R R Normalization Basic x 1 x 2 x 3 R 1 R 2 Solution z Harald Enzinger, Michael Rath Jan 9, 2012 page 28/37
32 The Simplex method - Computational Details Two-phase Method Solve the LP in two phases: Phase 1: Introduce new objective function to minimize the sum of artificial variables {Minimize r = i R i} {Maximize r = i R i} Phase 2: Perform usual simplex with solution obtained from Phase 1 Basic x 1 x 2 x 3 R 1 R 2 Solution r R R Normalization Basic x 1 x 2 x 3 R 1 R 2 Solution r Harald Enzinger, Michael Rath Jan 9, 2012 page 29/37
33 The Simplex method - Special Cases Degeneracy Happens if tie occurs for minimum ratio in Feasibility condition At least one basic variable will be zero in next iteration Model has at least one redundant constraint (overdetermined point) Cycling if objective value doesnt improve Alternative Optima Objective function parallel to constraint All points between corner points optimal solutions Harald Enzinger, Michael Rath Jan 9, 2012 page 30/37
34 The Simplex method - Demonstration Solving toy example graphically minimize x 1 x 2 subject to x 1 x 2 2 x 1 x 2 5 3x 1 x x 1 + x 2 27 x 1 + 5x 2 25 x 1 + x 2 3 4x 1 + x 2 0 Harald Enzinger, Michael Rath Jan 9, 2012 page 31/37
35 Harald Enzinger, Michael Rath Jan 9, 2012 page 32/37
36 Harald Enzinger, Michael Rath Jan 9, 2012 page 32/37
37 Harald Enzinger, Michael Rath Jan 9, 2012 page 32/37
38 Harald Enzinger, Michael Rath Jan 9, 2012 page 32/37
39 Harald Enzinger, Michael Rath Jan 9, 2012 page 32/37
40 Harald Enzinger, Michael Rath Jan 9, 2012 page 32/37
41 Harald Enzinger, Michael Rath Jan 9, 2012 page 32/37
42 Harald Enzinger, Michael Rath Jan 9, 2012 page 32/37
43 Harald Enzinger, Michael Rath Jan 9, 2012 page 32/37
44 Harald Enzinger, Michael Rath Jan 9, 2012 page 32/37
45 Outline Introduction to Linear Programming Simplex Basics Computational Details Demonstration Dual problem of LP Harald Enzinger, Michael Rath Jan 9, 2012 page 33/37
46 Dual of LP Definition Dual of LP defined from primal (original) LP model Optimal solution of one problem also provides solution to the other Rules to construct dual problem Define dual variable for each primal constraint Define dual constraint for each primal variable Primal constraint coefficients define left-hand side coefficients of dual constraint and its objective coefficient defines the right-hand side Objective coefficients of dual equal right-hand side of primal constraint equations Type of optimization switches (max min) Dual constraint type is determined by primal optimization type (min, max ) Harald Enzinger, Michael Rath Jan 9, 2012 page 34/37
47 Dual of LP Example Use rules on primal in equation form (Standard form) Primal in equation form Dual variables Minimize z = 15x x 2 + 0x 3 + 0x 4 subject to x 1 + 2x 2 x 3 + 0x 4 = 3 y 1 2x 1 4x 2 + 0x 3 + x 4 = 5 y 2 x 1, x 2, x 3, x 4 0 Dual Problem subject to Maximize w = 3y 1 + 5y 2 y 1 +2y y 1 4y 2 12 y 1 0 y 2 0 Harald Enzinger, Michael Rath Jan 9, 2012 page 35/37
48 References Rainer Burkard, Lecture Notes: Mathematische Optimierung, hatzl/vorlesung/mathoptss11/opt.pdf Juncheng Wei, Lecture Notes: Linear Programming, wei/lp11.html H.A. Taha, Operations Research: An Introduction, Pearson Prentice Hall, 8th Edition, 2007 Harald Enzinger, Michael Rath Jan 9, 2012 page 36/37
49
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationLP Duality: outline. Duality theory for Linear Programming. alternatives. optimization I Idea: polyhedra
LP Duality: outline I Motivation and definition of a dual LP I Weak duality I Separating hyperplane theorem and theorems of the alternatives I Strong duality and complementary slackness I Using duality
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 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 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 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 information1 Overview. 2 Extreme Points. AM 221: Advanced Optimization Spring 2016
AM 22: Advanced Optimization Spring 206 Prof. Yaron Singer Lecture 7 February 7th Overview In the previous lectures we saw applications of duality to game theory and later to learning theory. In this lecture
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationLecture 6 Simplex method for linear programming
Lecture 6 Simplex method for linear programming Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University,
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 informationLecture 2: The Simplex method. 1. Repetition of the geometrical simplex method. 2. Linear programming problems on standard form.
Lecture 2: The Simplex method. Repetition of the geometrical simplex method. 2. Linear programming problems on standard form. 3. The Simplex algorithm. 4. How to find an initial basic solution. Lecture
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 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 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 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 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 informationIntroduction to Operations Research
Introduction to Operations Research (Week 4: Linear Programming: More on Simplex and Post-Optimality) José Rui Figueira Instituto Superior Técnico Universidade de Lisboa (figueira@tecnico.ulisboa.pt) March
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 informationChapter 4 The Simplex Algorithm Part II
Chapter 4 The Simple Algorithm Part II Based on Introduction to Mathematical Programming: Operations Research, Volume 4th edition, by Wayne L Winston and Munirpallam Venkataramanan Lewis Ntaimo L Ntaimo
More informationOptimization methods NOPT048
Optimization methods NOPT048 Jirka Fink https://ktiml.mff.cuni.cz/ fink/ Department of Theoretical Computer Science and Mathematical Logic Faculty of Mathematics and Physics Charles University in Prague
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 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 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 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 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 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 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 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 informationLinear Programming. Chapter Introduction
Chapter 3 Linear Programming Linear programs (LP) play an important role in the theory and practice of optimization problems. Many COPs can directly be formulated as LPs. Furthermore, LPs are invaluable
More informationCivil Engineering Systems Analysis Lecture XII. Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics
Civil Engineering Systems Analysis Lecture XII Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics Today s Learning Objectives Dual Midterm 2 Let us look at a complex case
More informationOPERATIONS RESEARCH. Michał Kulej. Business Information Systems
OPERATIONS RESEARCH Michał Kulej Business Information Systems The development of the potential and academic programmes of Wrocław University of Technology Project co-financed by European Union within European
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 informationCSCI5654 (Linear Programming, Fall 2013) Lecture-8. Lecture 8 Slide# 1
CSCI5654 (Linear Programming, Fall 2013) Lecture-8 Lecture 8 Slide# 1 Today s Lecture 1. Recap of dual variables and strong duality. 2. Complementary Slackness Theorem. 3. Interpretation of dual variables.
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 informationDuality in Linear Programming
Duality in Linear Programming Gary D. Knott Civilized Software Inc. 1219 Heritage Park Circle Silver Spring MD 296 phone:31-962-3711 email:knott@civilized.com URL:www.civilized.com May 1, 213.1 Duality
More informationCO350 Linear Programming Chapter 8: Degeneracy and Finite Termination
CO350 Linear Programming Chapter 8: Degeneracy and Finite Termination 22th June 2005 Chapter 8: Finite Termination Recap On Monday, we established In the absence of degeneracy, the simplex method will
More informationLecture 11 Linear programming : The Revised Simplex Method
Lecture 11 Linear programming : The Revised Simplex Method 11.1 The Revised Simplex Method While solving linear programming problem on a digital computer by regular simplex method, it requires storing
More informationOptimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16: Linear programming. Optimization Problems
Optimization WS 13/14:, by Y. Goldstein/K. Reinert, 9. Dezember 2013, 16:38 2001 Linear programming Optimization Problems General optimization problem max{z(x) f j (x) 0,x D} or min{z(x) f j (x) 0,x D}
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 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 informationAnn-Brith Strömberg. Lecture 4 Linear and Integer Optimization with Applications 1/10
MVE165/MMG631 Linear and Integer Optimization with Applications Lecture 4 Linear programming: degeneracy; unbounded solution; infeasibility; starting solutions Ann-Brith Strömberg 2017 03 28 Lecture 4
More informationLecture 10: Linear programming duality and sensitivity 0-0
Lecture 10: Linear programming duality and sensitivity 0-0 The canonical primal dual pair 1 A R m n, b R m, and c R n maximize z = c T x (1) subject to Ax b, x 0 n and minimize w = b T y (2) subject 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 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 informationENGI 5708 Design of Civil Engineering Systems
ENGI 5708 Design of Civil Engineering Systems Lecture 04: Graphical Solution Methods Part 1 Shawn Kenny, Ph.D., P.Eng. Assistant Professor Faculty of Engineering and Applied Science Memorial University
More informationOptimization (168) Lecture 7-8-9
Optimization (168) Lecture 7-8-9 Jesús De Loera UC Davis, Mathematics Wednesday, April 2, 2012 1 DEGENERACY IN THE SIMPLEX METHOD 2 DEGENERACY z =2x 1 x 2 + 8x 3 x 4 =1 2x 3 x 5 =3 2x 1 + 4x 2 6x 3 x 6
More informationSupplementary lecture notes on linear programming. We will present an algorithm to solve linear programs of the form. maximize.
Cornell University, Fall 2016 Supplementary lecture notes on linear programming CS 6820: Algorithms 26 Sep 28 Sep 1 The Simplex Method We will present an algorithm to solve linear programs of the form
More informationAnswer the following questions: Q1: Choose the correct answer ( 20 Points ):
Benha University Final Exam. (ختلفات) Class: 2 rd Year Students Subject: Operations Research Faculty of Computers & Informatics Date: - / 5 / 2017 Time: 3 hours Examiner: Dr. El-Sayed Badr Answer the following
More information(P ) Minimize 4x 1 + 6x 2 + 5x 3 s.t. 2x 1 3x 3 3 3x 2 2x 3 6
The exam is three hours long and consists of 4 exercises. The exam is graded on a scale 0-25 points, and the points assigned to each question are indicated in parenthesis within the text. Problem 1 Consider
More 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 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 informationInteger Programming. The focus of this chapter is on solution techniques for integer programming models.
Integer Programming Introduction The general linear programming model depends on the assumption of divisibility. In other words, the decision variables are allowed to take non-negative integer as well
More information2.098/6.255/ Optimization Methods Practice True/False Questions
2.098/6.255/15.093 Optimization Methods Practice True/False Questions December 11, 2009 Part I For each one of the statements below, state whether it is true or false. Include a 1-3 line supporting sentence
More informationMATHEMATICAL PROGRAMMING I
MATHEMATICAL PROGRAMMING I Books There is no single course text, but there are many useful books, some more mathematical, others written at a more applied level. A selection is as follows: Bazaraa, Jarvis
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 informationMVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis
MVE165/MMG631 Linear and integer optimization with applications Lecture 5 Linear programming duality and sensitivity analysis Ann-Brith Strömberg 2017 03 29 Lecture 4 Linear and integer optimization with
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 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 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 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 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 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 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 information