Linear programs, convex polyhedra, extreme points
|
|
- Beryl Franklin
- 5 years ago
- Views:
Transcription
1 MVE165/MMG631 Extreme points of convex polyhedra; reformulations; basic feasible solutions; the simplex method Ann-Brith Strömberg
2 Linear programs, convex polyhedra, extreme points A linear optimization model a linear program n minimize z = c j x j subject to n a ij x j b i, x j 0, c j, a ij, b i : constant parameters i = 1,..., m j = 1,..., n Expressed in vector notation min s.t. z = c T x Ax b x 0 n c, x R n, b R m, A R m n The feasible region is a polyhedron, X R n + X := { x 0 n n } a ij x j b i, i = 1,..., m = { x 0 n Ax b }
3 Linear programs, convex polyhedra and extreme points (Ch. 4.1) Definition (Convex combination) A convex combination of the points x p, p = 1,..., P, is a point x that can be expressed as P x = λ p x p ; p=1 P λ p = 1; p=1 λ p 0, p = 1,..., P [Draw on the board]
4 Linear programs, convex polyhedra and extreme points (Ch. 4.1) Linear constraints form a convex set The feasible region of a linear program is a convex set, since for any two feasible points x 1 and x 2 and any λ [0, 1] it holds that and n ) a ij (λxj 1 + (1 λ)xj 2 = λ n a ij xj 1 + (1 λ) n a ij xj 2 λb i + (1 λ)b i = b i, i = 1,..., m λx 1 j + (1 λ)x 2 j 0, j = 1,..., n [Draw on the board]
5 Linear programs, convex polyhedra and extreme points (Ch. 4.1) Definition (Extreme point (Def. 4.2)) The point x k is an extreme point of the polyhedron X if x k X and it is not possible to express x k as a strict convex combination of two distinct points in X. I.e: Given x 1 X, x 2 X, and 0 < λ < 1, it holds that x k = λx 1 + (1 λ)x 2 only if x k = x 1 = x 2. [Draw on the board] Theorem (Optimal solution in an extreme point (Th. 4.2)) Assume that the feasible region X = {x 0 n Ax b} is non-empty and bounded. Then, the minimum value of the objective c T x is attained at (at least) one extreme point x k of X. [Proof on the board]
6 A general linear program notation Definition (Notation of linear programs) minimize or maximize subject to a i1 x a in x n x j c 1 x c n x n = 0 unrestricted in sign 0 b i, i = 1,..., m, j = 1,..., n The blue notation refers to the standard form
7 The standard form and the simplex method for linear programs (Ch. 4.2) Every linear program can be reformulated such that: all constraints are expressed as equalities with non-negative right hand sides all variables involved are restricted to be non-negative Referred to as the standard form These requirements streamline the calculations of the simplex method Software solvers (e.g., Cplex, GLPK, Clp, Gurobi) can handle also inequality constraints and unrestricted variables the reformulations are made automatically
8 The simplex method standard form reformulations Slack variables: n a ij x j b i, i x j 0, j n a ij x j +s i = b i, i x j 0, j s i 0, i The lego example: 2x 1 +x 2 6 2x 1 +2x 2 8 x 1, x 2 0 2x 1 +x 2 +s 1 = 6 2x 1 +2x 2 +s 2 = 8 x 1, x 2, s 1, s 2 0 s 1 and s 2 are called slack variables they fill out the (positive) distances between the left and right hand sides
9 The simplex method standard form reformulations Surplus variables: n a ij x j b i, i x j 0, j n a ij x j s i = b i, i x j 0, j s i 0, i Surplus variable s 3 (a different example): [ ] [ x1 + x x1 + x 2 s 3 = 800 x 1, x 2 0 x 1, x 2, s 3 0 ]
10 The simplex method standard form reformulations Suppose that b < 0: n n a j x j b ( a j )x j b x j 0, j x j 0, j n a j x j s = b x j 0, j s 0 Non-negative right hand side: [ ] [ ] [ ] x1 x 2 23 x1 + x 2 23 x1 + x 2 s 4 = 23 x 1, x 2 0 x 1, x 2 0 x 1, x 2, s 4 0
11 The simplex method standard form reformulations Suppose that some of the variables are unconstrained (here: k < n). Replace x j with x 1 j x 2 j for the corresponding indices: n a j x j b x j 0, j = 1,..., k k a j x j + n j=k+1 a j (xj 1 xj 2 ) + s = b x j 0, j = 1,..., k, xj 1 0, xj 2 0, j = k + 1,..., n s 0 Sign-restricted (non-negative) variables: [ ] [ x1 + x 2 10 x1 + x 2 1 x ] [ x1 + x x 1 0 x 1, x2 1, x x s ] 5 = 10 x 1, x2 1, x 2 2, s 5 0
12 Basic feasible solutions (Ch. 4.3) Consider m equations with n variables, where m n Set n m variables to zero and solve (if possible) the remaining (m m) system of equations If the solution is unique, it is called a basic solution A basic solution corresponds to an intersection (feasible (x 0) or infeasible (x 0)) of m hyperplanes in R m Each extreme point of the feasible set is an intersection of m hyperplanes such that all variable values are 0 Basic feasible solution extreme point of the feasible set a 11 x a 1n x n = b 1 x 1 0 a 21 x a 2n x n = b 2 x 2 0 a m1 x a mn x n = b m x n 0
13 Basic feasible solutions Assume that m < n and that b i 0, i = 1,..., m, and let c 1 a a 1n b 1 x 1 c =., A =....., b =., x =.. c n a m1... a mn x n Consider the linear program to b m minimize x subject to z = c T x Ax = b x 0 Partition x into m basic variables x B and n m non-basic variables x N, such that x = (x B, x N ). Analogously, let c = (c B, c N ) and A = (A B, A N ) (B, N) The matrix B R m m with inverse B 1 (if it exists)
14 Basic feasible solutions (Ch. 4.8) Rewrite the linear program as minimize z = c T B x B + c T N x N (1a) subject to Bx B + Nx N = b (1b) x B 0 m, x N 0 n m (1c) Multiply the equation (1b) with B 1 from the left: B 1 Bx B + B 1 Nx N = x B + B 1 Nx N = B 1 b x B = B 1 b B 1 Nx N (2) Replace x B in (1) by the expression (2): c T B x B+c T N x N = c T B B 1 (b Nx N )+c T N x N = c T B B 1 b+(c T N ct B B 1 N)x N minimize z = c T B B 1 b + (c T N ct B B 1 N)x N subject to B 1 b B 1 Nx N 0 m x N 0 n m
15 Basic feasible solutions The rewritten program minimize z = c T B B 1 b + (c T N ct B B 1 N)x N (3a) subject to B 1 b B 1 Nx N 0 m (3b) x N 0 n m (3c) At the basic solution defined by B {1,..., n}: Each non-basic variable takes the value 0, i.e., x N = 0 The basic variables take the values x B = B 1 b B 1 Nx N = B 1 b The value of the objective function is z = c T B B 1 b The basic solution is feasible if B 1 b 0 m
16 The simplex method: Optimality and feasibility and change of basis (Ch. 4.4) Optimality condition (for minimization) The basis B is optimal if c T N ct B B 1 N 0 n m (marginal values = reduced costs 0) If not, choose as entering variable j N the one with the lowest (negative) value of the reduced cost c j c T B B 1 A j Feasibility condition For all i B it holds that x i = (B 1 b) i (B 1 A j ) i x j Choose the leaving variable i B according to { (B i 1 } b) i = arg min i B (B 1 A j ) i (B 1 A j ) i > 0
17 Basic feasible solutions, example Constraints: x 1 23 (1) 0.067x 1 + x 2 6 (2) 3x 1 + 8x 2 85 (3) x 1, x 2 0 Add slack variables: x 1 +s 1 = 23 (1) 0.067x 1 +x 2 +s 2 = 6 (2) 3x 1 +8x 2 +s 3 = 85 (3) x 1, x 2, s 1, s 2, s 3 0 y 10 C (3) (1) B D 5 E (2) F I 1 A G H x
18 Basic and non-basic variables and solutions basic basic solution non-basic point feasible? variables variables (0, 0) s 1, s 2, s x 1, x 2 A yes s 1, s 2, x s , x 2 H no s 1, s 2, x x 8 8 1, s 3 C no s 1, x 1, s s 2, x 2 I no s 1, x 2, s s 2, x 1 B yes x 1, s 2, s s 15 1, x 2 G yes x 2, s 2, s s 1, x x 1, x 2, s s 2, s 3 D yes x 1, x 2, s s 15 1, s 3 F yes x 1, x 2, s s , s 2 E no y 10 C (3) (1) 5 B D E (2) F 1 I A G H x
19 y C B A (3) D F G (1) E 25 (2) H x I Basic feasible solutions correspond to solutions to the system of equations that fulfil non-negativity A: x 1 = x 2 = 0 B: x 1 = s 2 = 0 D: s 3 = s 2 = 0 F: s 3 = s 1 = 0 G: x 2 = s 1 = 0 s 1 = 23 s 2 = 6 s 3 = 85 x 1 +s 1 = x 1 +x 2 +s 2 = 6 3x 1 +8x 2 +s 3 = 85 s 1 = 23 x 2 = 6 8x 2 +s 3 = 85 x 1 +s 1 = x 1 +x 2 = 6 3x 1 +8x 2 = 85 x 1 = x 1 +x 2 +s 2 = 6 3x 1 +8x 2 = 85 x 1 = x 1 +s 2 = 6 3x 1 +s 3 = 85
20 y C B A (3) D F G (1) E 25 (2) H x I Basic infeasible solutions corresp. to solutions to the system of equations with one or more variables < 0 H: x 2 = s 3 = 0 C: x 1 = s 3 = 0 I: s 2 = x 2 = 0 -: s 1 = x 1 = 0 E: s 1 = s 2 = 0 x 1 +s 1 = x 1 +x 2 +s 2 = 6 3x 1 +8x 2 +s 3 = 85 x 1 +s 1 = x 1 +s 2 = 6 3x 1 = 85 s 1 = 23 x 2 +s 2 = 6 8x 2 = 85 x 1 +s 1 = x 1 = 6 3x 1 +s 3 = 85 0 = 23 x 2 +s 2 = 6 8x 2 +s 3 = 85 x 1 = x 1 +x 2 = 6 3x 1 +8x 2 +s 3 = 85
21 Basic feasible solutions and the simplex method Express the m basic variables in terms of the n m non-basic variables Example: Start at x 1 = x 2 = 0 s 1, s 2, s 3 are basic x 1 +s 1 = x 1 +x 2 +s 2 = 6 3x 1 +8x 2 +s 3 = 85 Express s 1, s 2, and s 3 in terms of x 1 and x 2 (non-basic): s 1 = 23 x 1 s 2 = x 1 x 2 s 3 = 85 3x 1 8x 2 We wish to maximize the objective function 2x 1 + 3x 2 Express the objective in terms of the non-basic variables: (maximize) z = 2x 1 + 3x 2 z 2x 1 3x 2 = 0
22 Basic feasible solutions and the simplex method The first basic solution can be represented as z +2x 1 +3x 2 = 0 (0) x 1 +s 1 = 23 (1) 1 15 x 1 + x 2 + s 2 = 6 (2) 3x 1 + 8x 2 + s 3 = 85 (3) Marginal values for increasing the non-basic variables x 1 and x 2 from zero: 2 and 3, resp. Choose x 2 let x 2 enter the basis Draw graph!! One basic variable (s 1, s 2, or s 3 ) must leave the basis. Which? The value of x 2 can increase until some basic variable reaches the value 0: (2) : s 2 = 6 x 2 0 x 2 6 (3) : s 3 = 85 8x 2 0 x s 2 will leave the basis } s 2 = 0 when x 2 = 6 (and s 3 = 37)
23 Change basis through row operations Eliminate s 2 from the basis, let x 2 enter the basis using row operations: z +2x 1 +3x 2 = 0 (0) x 1 +s 1 = 23 (1) 1 15 x 1 +x 2 +s 2 = 6 (2) 3x 1 +8x 2 +s 3 = 85 (3) z x 1 3s 2 = 18 (0) 3 (2) x 1 +s 1 = 23 (1) 0 (2) 1 15 x 1 +x 2 +s 2 = 6 (2) x 1 8s 2 +s 3 = 37 (3) 8 (2) Corresponding basic solution: s 1 = 23, x 2 = 6, s 3 = 37. Nonbasic variables: x 1 = s 2 = 0 The marginal value of x 1 is 9 5 > 0. Let x 1 enter the basis Which one should leave? s 1, x 2, or s 3?
24 Change basis... z x 1 3s 2 = 18 (0) x 1 +s 1 = 23 (1) 1 15 x 1 +x 2 +s 2 = 6 (2) x 1 8s 2 +s 3 = 37 (3) The value of x 1 can increase until some basic variable reaches the value 0: (1) : s 1 = 23 x 1 0 x 1 23 (2) : x 2 = x 1 0 x 1 90 (3) : s 3 = x 1 0 x 1 15 x 1 enters the basis and s 3 leaves the basis s 3 = 0 when x 1 = 15 Perform row operations: z +2.84s s 3 = 45 (0) (3) 15 s s s 3 = 8 (1) (3) x s s 3 = 5 (2) (3) 15 x s s 3 = 15 (3)
25 Change basis... z +2.84s s 3 = 45 (0) s s s 3 = 8 (1) x s s 3 = 5 (2) x s s 3 = 15 (3) Let s 2 enter the basis (marginal value > 0) The value of s 2 can increase until some basic variable = 0: (1) : s 1 = s 2 0 s (2) : x 2 = s 2 0 s s 1 = 0 when s (3) : x 1 = s 2 0 s = 2.47 s 2 enters the basis and s 1 will leave the basis Perform row operations: z 0.87s s 3 = 52 (0) (1) s 1 +s s 3 = 2.47 (1) x s s 3 = 2 (2) (1) x 1 +s 1 = 23 (3)+(1)
26 Optimal basic solution z 0.87s s 3 = s 1 +s s 3 = 2.47 x s s 3 = 2 x 1 +s 1 = 23 No marginal value is positive. No improvement can be made The optimal basis is given by s 2 = 2.47, x 2 = 2, and x 1 = 23 Non-basic variables: s 1 = s 3 = 0 Optimal value: z = 52 y x
27 Summary of the solution course basis z x 1 x 2 s 1 s 2 s 3 RHS z s s s z s x s z s x x z s x x
28 Solve the lego problem using the simplex method! maximize z = 1600x x 2 subject to 2x 1 + x 2 6 2x 1 + 2x 2 8 x 1, x 2 0 Homework!!
Summary 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 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 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 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 information3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions
A. LINEAR ALGEBRA. CONVEX SETS 1. Matrices and vectors 1.1 Matrix operations 1.2 The rank of a matrix 2. Systems of linear equations 2.1 Basic solutions 3. Vector spaces 3.1 Linear dependence and independence
More 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 informationMVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2017 04 07 Lecture 8 Linear and integer optimization with applications
More informationA Review of Linear Programming
A Review of Linear Programming Instructor: Farid Alizadeh IEOR 4600y Spring 2001 February 14, 2001 1 Overview In this note we review the basic properties of linear programming including the primal simplex
More informationMVE165/MMG630, Applied Optimization Lecture 6 Integer linear programming: models and applications; complexity. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming: models and applications; complexity Ann-Brith Strömberg 2011 04 01 Modelling with integer variables (Ch. 13.1) Variables Linear programming (LP) uses continuous
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 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 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. 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 informationIP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, You wish to solve the IP below with a cutting plane technique.
IP Cut Homework from J and B Chapter 9: 14, 15, 16, 23, 24, 31 14. You wish to solve the IP below with a cutting plane technique. Maximize 4x 1 + 2x 2 + x 3 subject to 14x 1 + 10x 2 + 11x 3 32 10x 1 +
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 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 informationBrief summary of linear programming and duality: Consider the linear program in standard form. (P ) min z = cx. x 0. (D) max yb. z = c B x B + c N x N
Brief summary of linear programming and duality: Consider the linear program in standard form (P ) min z = cx s.t. Ax = b x 0 where A R m n, c R 1 n, x R n 1, b R m 1,and its dual (D) max yb s.t. ya c.
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 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 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 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 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 informationLINEAR PROGRAMMING. Relation to the Text (cont.) Relation to Material in Text. Relation to the Text. Relation to the Text (cont.
LINEAR PROGRAMMING Relation to Material in Text After a brief introduction to linear programming on p. 3, Cornuejols and Tϋtϋncϋ give a theoretical discussion including duality, and the simplex solution
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 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 informationIntroduction to linear programming using LEGO.
Introduction to linear programming using LEGO. 1 The manufacturing problem. A manufacturer produces two pieces of furniture, tables and chairs. The production of the furniture requires the use of two different
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 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 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 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 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 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 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 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 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 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 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 informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 3: Linear Programming, Continued Prof. John Gunnar Carlsson September 15, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 15, 2010
More informationLinear Programming: 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 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 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 information4.6 Linear Programming duality
4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP Different spaces and objective functions but in general same optimal
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 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 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 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 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 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 informationSection Notes 9. IP: Cutting Planes. Applied Math 121. Week of April 12, 2010
Section Notes 9 IP: Cutting Planes Applied Math 121 Week of April 12, 2010 Goals for the week understand what a strong formulations is. be familiar with the cutting planes algorithm and the types of cuts
More 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 informationMS-E2140. Lecture 1. (course book chapters )
Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters 1.1-1.4) Linear programming problems and examples Problem manipulations and standard form problems Graphical representation
More informationEND3033 Operations Research I Sensitivity Analysis & Duality. to accompany Operations Research: Applications and Algorithms Fatih Cavdur
END3033 Operations Research I Sensitivity Analysis & Duality to accompany Operations Research: Applications and Algorithms Fatih Cavdur Introduction Consider the following problem where x 1 and x 2 corresponds
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 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 informationLecture 10: Linear programming. duality. and. The dual of the LP in standard form. maximize w = b T y (D) subject to A T y c, minimize z = c T x (P)
Lecture 10: Linear programming duality Michael Patriksson 19 February 2004 0-0 The dual of the LP in standard form minimize z = c T x (P) subject to Ax = b, x 0 n, and maximize w = b T y (D) subject to
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 informationLinear Programming. Operations Research. Anthony Papavasiliou 1 / 21
1 / 21 Linear Programming Operations Research Anthony Papavasiliou Contents 2 / 21 1 Primal Linear Program 2 Dual Linear Program Table of Contents 3 / 21 1 Primal Linear Program 2 Dual Linear Program Linear
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 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 informationDuality Theory, Optimality Conditions
5.1 Duality Theory, Optimality Conditions Katta G. Murty, IOE 510, LP, U. Of Michigan, Ann Arbor We only consider single objective LPs here. Concept of duality not defined for multiobjective LPs. Every
More informationAn example of LP problem: Political Elections
Linear Programming An example of LP problem: Political Elections Suppose that you are a politician trying to win an election. Your district has three different types of areas: urban, suburban, and rural.
More informationM340(921) Solutions Problem Set 6 (c) 2013, Philip D Loewen. g = 35y y y 3.
M340(92) Solutions Problem Set 6 (c) 203, Philip D Loewen. (a) If each pig is fed y kilograms of corn, y 2 kilos of tankage, and y 3 kilos of alfalfa, the cost per pig is g = 35y + 30y 2 + 25y 3. The nutritional
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 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 informationCHAPTER 2. The Simplex Method
CHAPTER 2 The Simplex Method In this chapter we present the simplex method as it applies to linear programming problems in standard form. 1. An Example We first illustrate how the simplex method works
More informationF 1 F 2 Daily Requirement Cost N N N
Chapter 5 DUALITY 5. The Dual Problems Every linear programming problem has associated with it another linear programming problem and that the two problems have such a close relationship that whenever
More informationIE 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 informationLift-and-Project Inequalities
Lift-and-Project Inequalities Q. Louveaux Abstract The lift-and-project technique is a systematic way to generate valid inequalities for a mixed binary program. The technique is interesting both on the
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 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 informationIntroduction to linear programming
Chapter 2 Introduction to linear programming 2.1 Single-objective optimization problem We study problems of the following form: Given a set S and a function f : S R, find, if possible, an element x S that
More informationMS-E2140. Lecture 1. (course book chapters )
Linear Programming MS-E2140 Motivations and background Lecture 1 (course book chapters 1.1-1.4) Linear programming problems and examples Problem manipulations and standard form Graphical representation
More informationThe Avis-Kalunzy Algorithm is designed to find a basic feasible solution (BFS) of a given set of constraints. Its input: A R m n and b R m such that
Lecture 4 Avis-Kaluzny and the Simplex Method Last time, we discussed some applications of Linear Programming, such as Max-Flow, Matching, and Vertex-Cover. The broad range of applications to Linear Programming
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 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 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 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 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 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 informationEE364a Review Session 5
EE364a Review Session 5 EE364a Review announcements: homeworks 1 and 2 graded homework 4 solutions (check solution to additional problem 1) scpd phone-in office hours: tuesdays 6-7pm (650-723-1156) 1 Complementary
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 informationCO 250 Final Exam Guide
Spring 2017 CO 250 Final Exam Guide TABLE OF CONTENTS richardwu.ca CO 250 Final Exam Guide Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4,
More informationIntroduction to optimization
Introduction to optimization Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 24 The plan 1. The basic concepts 2. Some useful tools (linear programming = linear optimization)
More informationInteger programming: an introduction. Alessandro Astolfi
Integer programming: an introduction Alessandro Astolfi Outline Introduction Examples Methods for solving ILP Optimization on graphs LP problems with integer solutions Summary Introduction Integer programming
More informationLinear and Integer Programming - ideas
Linear and Integer Programming - ideas Paweł Zieliński Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland http://www.im.pwr.wroc.pl/ pziel/ Toulouse, France 2012 Literature
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 informationCSC373: Algorithm Design, Analysis and Complexity Fall 2017 DENIS PANKRATOV NOVEMBER 1, 2017
CSC373: Algorithm Design, Analysis and Complexity Fall 2017 DENIS PANKRATOV NOVEMBER 1, 2017 Linear Function f: R n R is linear if it can be written as f x = a T x for some a R n Example: f x 1, x 2 =
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 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 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 informationA Parametric Simplex Algorithm for Linear Vector Optimization Problems
A Parametric Simplex Algorithm for Linear Vector Optimization Problems Birgit Rudloff Firdevs Ulus Robert Vanderbei July 9, 2015 Abstract In this paper, a parametric simplex algorithm for solving linear
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 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 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 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 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 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 informationFundamental Theorems of Optimization
Fundamental Theorems of Optimization 1 Fundamental Theorems of Math Prog. Maximizing a concave function over a convex set. Maximizing a convex function over a closed bounded convex set. 2 Maximizing Concave
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 informationRelation of Pure Minimum Cost Flow Model to Linear Programming
Appendix A Page 1 Relation of Pure Minimum Cost Flow Model to Linear Programming The Network Model The network pure minimum cost flow model has m nodes. The external flows given by the vector b with m
More information