CSE 460. Today we will look at" Classes of Optimization Problems" Linear Programming" The Simplex Algorithm"
|
|
- Wilfrid Mosley
- 5 years ago
- Views:
Transcription
1 CSE 460 Linear Programming" Today we will look at" Classes of Optimization Problems" Linear Programming" The Simplex Algorithm"
2 Classes of Optimization Problems" Optimization" unconstrained"..." linear" constrained" non-linear" real-valued" integer" quadratic"..." max v x..." f ( v x ) subject to C( v x )
3 Solution Spaces" A solution space or feasible region is the union of all points" in the domain that satisfy the problem constraints. " The most important distinction is between convex and " non-convex solution spaces:" Convexity means that any interpolation between " feasible points only yields feasible points."
4 Local and Global Optima" Plot of an objective function for a non-convex problem" with local maxima at a and b. " Only the one at b is a global maximum. " Convex problems are generally easier to solve because" Theorem: Any local extremum for a maximization problem" " on a convex feasible region (and concave " " objective function) is a global extremum."
5 Convex Optimization Problems" Convex problems are by far easier to solve " (computationally less expensive). We will therefore first look " at linear programming in the domain of real numbers."
6 Calories (1000) Adequate Minimum Cost Diet" Protein (grams) Calcium (grams) Iron (mg) Vitamin A (1000 IU) Thiamine (B1) (mg) Riboflavin (mg) Niacin (mg) Allowanc e Flour Milk Cheese Liver Cabbage Spinach Sweet Potatoes Lima Beans Navy Beans Nutrition Values in units per Dollar cost (194)" Ascorbin (mg) One of the first automated linear optimization problems" G. Stigler. The cost of expenditure. Journal of Farm Economics, 194"... there does not appear to be any direct method of finding the " minimum... " G. Dantzig. Linear Programming and Extensions,Princeton Univ. Press, 1963." manually with desktop calculator: 120 person-days" with Simplex on IBM 701: 4 minutes (1947)"
7 Linear Programming" max v x f( v x ) subject to C( v x ) where f( v x ) =f(x 1,Kx n ) is a linear function f : R n R and C( v x ) = c 1 (x 1,Kx n ) K c k (x 1,K,x n ) is a conjunction of linear inequalities c i (x 1,K,x n ) j w i,j x j k i
8 Gauss-Jordan Elimination" Let us first review how a system of linear equations is solved." This is performed by Gauss-Jordan Elimination:" Example:" (1) "3x+y-z "= "1" (2) "7x-2y+z "= "1" (3) " y+z "= "0" by (3) "z=-y" (1.1) "3x+y+y "= "1" (1.2) "7x- 2y- y "= "1" by (1.1) y=/2-1/2*x" (1.2.1) "17/2*x" "= "17/2" "x " "= "1" more elegantly:" X Y Z R
9 Application Example" A company wants to optimize their production plan for three products" B/C/D with the following resource requirements and limits:" B C D Capacity Finishing Labor Machine Time Profit maximize" profit "f(x*) = 3.0 x[b] x[c] x[d]" subject to "c(x*) = 2.0 x[b] x[c] x[d] <= 30.0" " " and 1.0 x[b] x[c] x[d] <= 2.0" " " and 2.0 x[b] x[c] x[d] <= 20.0" " " and x[b]>=0 and x[c]>=0 and x[d]>=0 "
10 Slack Variables" transform to standard form by introducing slack variables" the slack measures the unused part of a resource "(i.e. how tight a constraint is)" s[f] == 30 2 x[b] 2 x[c] x[d] s[l] == 3 x[b] 2 x[c] 3 x[d] s[m] == 20 2 x[b] x[c] x[d] Note: All slack variables must always be positive! " s[_] >= 0. " "In standard form the x[i] must also be positive." e.g. {x[b] -> 1, x[c] -> 2, x[d] -> 3} yields s[f] == 21 s[l] == 11 s[m] == 13
11 Basic Feasible Solution" A basic feasible solution is a point in the feasible region" (i.e. a valuation of the problem variables) that fulfils all " problem constraints, i.e. a point at which " all explicit problem constraints are fulfilled and" all slack variables are positive" z == 3 x[b] + x[c] + 3 x[d] s[f] == 30 2 x[b] 2 x[c] x[d] s[l] == 3 x[b] 2 x[c] 3 x[d] s[m] == 20 2 x[b] x[c] x[d] trivial solution: " "{x[b] -> 0, x[c] -> 0, x[d] -> 0} z=0" better: " " "{x[b] -> 1, x[c] -> 2, x[d] -> 3} z=14" even better: " "{x[b] -> 2, x[c] -> 4, x[d] -> } z=2" impossible: " "{x[b] -> 3, x[c] -> 4, x[d] -> } s[l]<0
12 Simplex Algorithm: Idea" The solution to a linear programming problem can be found" by iterative improvement:" (1) take any feasible solution" (2) check whether any resources are left" (3) check whether exchanging some activity (product)" improves the solution" (4) if so, exchange & repeat from step (2)" otherwise the optimum is reached."
13 Simplex: Geometric Interpretation" tight constraint! s[i]=0" feasible region! Observe that the optimimum of the objective function can" only exists at a corner point of the simplex:" The objective function is linear. " Imagine the objective plane z=f(x,y)=ax+by" At all other points some resource has reserves that can be utilized by producing more, thus optimizing profit"
14 How to start?" We will return to the problem of finding a good initial solution later. " In the example case (and in many practical cases), the trivial solution " (x*=0*) is feasible, but this is not always true." For now it seems reasonable to start with a solution in which only " a single activity is chosen. " This should be the most profitable activity (here product B) and it " should be as large as possible, i.e. to the point where the most limiting " constraint becomes tight (here s[m]). " productionplan = { x[b] -> 10, x[c] -> 0, x[d] -> 0}; z == 30 s[f] == 21 s[l] == 11 s[m] == 13
15 Economic Position" The row of the tableau that specifies the limiting constraint is called" the Pivot Row." s[m] == 20 2 x[b] x[c] x[d] Solving the Pivot row for the current activity yields" x[b] ==10 s[m] 2 x[c] 2 x[d] 2 This describes the current activity in terms of other possible activities" and available resources." Replacing this into the objective function yields:" 30 3s[m] 2 x[c] 2 3x[d] 2 This is the economic position at the current tentative production plan."
16 Shadow Prices" 30 3s[m] 2 x[c] 2 3x[d] 2 intercept" shadow price (3/2)" opportunity cost (3/2)" The intercept gives the profit for the current production plan" The shadow price gives the amount by which the profit could be "increased if this resource constraint could be relaxed (i.e. the "break even price for buying more of this resource)" The opportunity cost gives the potential increase of profit " by increasing the respective activity "after accounting for necessary reduction in the current activity!(e.g. one unit less b enables us to produce two more units d with the same price ($3) as b unless another constraint becomes tight.)" This interpretation is only valid" while the current limiting constraint remains binding!" (i.e. in particular for the current tentative production plan)"
17 Solution Revision" Obviously, the opportunity costs should lead our way for revising" the production plan if we want to maximize profit." Linearity of the problem implies that we should substitute as much of" the activity with the highest opportunity cost (here D) as the " resource constraints permit." To find the most limiting constraint we substitute the pivot row " (solved for the current activity x[b]) into the constraints:" s[f] ==10+s[m] x[c] s[l] ==1+ s[m] 2 3x[c] 2 x[d] 2 x[b] ==10+ s[m] 2 x[c] 2 x[d] 2
18 Stopping Condition" By comparison of the coefficients we can see that s[l] will be the " limiting constraint for x[d] " Obviously we can replace 6 units of D (for 3 units of B)" before the s[l] becomes tight." The new production plan is thus {x[b] -> 7, x[c] -> 0, x[d] -> 6} z == 39 s[f] == 10 s[l] == 0 s[m] == 0 Is this optimal???" We have to repeat the above process until no improvement possible." What is a reasonable stopping condition?" When all opportunity costs are less or equal zero (<=0)," the current solution must be optimal and we can stop."
19 Pivoting" 1. "identify best substitute x[j] from highest opportunity cost" 2. "identify limiting resource s[i]" 3. "select pivot row according to (2)" 4. "solve pivot row for variable x[j]". "substitute (4) in all other equations" 6a. "terminate if all opportunity costs are negative or zero" 6b "otherwise goto step 1"
20 z == 3 x[b] + x[c] + 3 x[d] s[f] == 30 2 x[b] 2 x[c] x[d] s[l] == 3 x[b] 2 x[c] 3 x[d] s[m] == 20 2 x[b] x[c] x[d] pivoting on x[b] / s[m] yields:" z == 30 3s[m] x[c] x[d] 2 s[f] == 10 + s[m] x[c] s[l] == 1 + s[m] 2 3x[c] x[d] 2 2 x[b] == 10 + s[m] 2 x[c] 2 x[d] 2 pivoting on x[d] / s[l] yields the optimum solution:" z == 39 3s[l] 6s[m] 7x[c] s[f] == 10 + s[m] x[c] x[d] == 6 2s[l] + s[m] 3x[c] x[b] == 7 + s[l] 3s[m] x[c]
21 Terminology" In linear programming, the problem representation by a set" of equations, like we have used them, is called a dictionary." z == 39 3s[l] 6s[m] 7x[c] s[f] == 10 + s[m] x[c] x[d] == 6 2s[l] + s[m] 3x[c] x[b] == 7 + s[l] 3s[m] x[c] A more compact representation by a matrix of coefficients used" in actual implementations is called the tableau. The left-hand side" variables (i.e. the variables that do only occur in one equation) are " called basic. All other variables are called non-basic." The final dictionary/tableau yields the optimum solution by setting " all non-basic variables to zero."
22 Potential Problems" Optimum not found" Optimum non-existent" Non-termination" Problem" unbounded" Problem" infeasible" Cycling" abort if there" is no limiting resource" for some pivot." Relax " constraints &" check feasibility" In practice almost irrelevant" can be avoided by clever" choice of pivot elements." See: " V. Chvatal. Linear Programming." W.H. Freeman, 1983."?"?"?" e.g." max (x+y)" s.t. x-y <= 0"
23 Degenerate Solutions & Cycling" A basic feasible solution is called degenerate" if at least one of the basic variables takes the value 0." => the next pivot does not necessarily change the solution" "(possibly only variables with value 0 are swapped)" => Cycling can occur (worst case)" Bland s Anti-Cycling Rule" Number the variables." In case of ties, let the lowest numbered variable enter the basis." If there is a tie for choosing the exit variable, use the lowest numbered variable."
24 Relaxing a Linear System" A linear problem is infeasible if the constraints are too restrictive." z == x[1] x[2] + x[3] s[1] == 4 2 x[1] + x[2] 2 x[3] s[2] == - 2 x[1] + 3 x[2] x[3] s[3] == -1 + x[1] x[2] + 2 x[3] The trivial solution is infeasible. Is the problem feasible at all?" To answer this question we add a so-called artificial variable a[0]" to the system, such that the system is always feasible." The original system is feasible iff there is a solution to the" relaxed system with a[0]=0:" z == a[0] s[1] == 4 + a[0] 2 x[1] + x[2] 2 x[3] s[2] == - + a[0] 2 x[1] + 3 x[2] x[3] s[3] == -1 + a[0] + x[1] x[2] + 2 x[3] most stringent" constraint"
25 Checking Feasibility" By pivoting on the artificial variable a[0] (and the most negative" intercept) we get a basic feasible solution for the relaxed system" z == - s[2] 2 x[1] + 3 x[2] x[3] s[1] == 9 + s[2] 2 x[2] x[3] a[0] == + s[2] + 2 x[1] 3 x[2] + x[3] s[3] == 4 + s[2] + 3 x[1] 4 x[2] + 3 x[3] Applying the Simplex method to this tableau yields the final tableau" z == a[0] s[1] == 3 + 2a[0] s[3] x[1] x[3] == 8 + 4a[0] + s[2] + 3s[3] x[1] x[2] == 11 3a[0] + 2s[2] + s[3] + 3x[1] Therefore the original problem is feasible with x*={0, 11/, 8/} "
26 Artificial Variables" More generally, for any linear problem we can introduce " artificial variables a[i] that make the relaxed problem trivially feasible." transform each equation b i = into a i = +b i k i x i if b i 0 and a i = b i + k i x i if b i < 0 k i x i For example" Can be rewritten to" Note however that, because of the s[i], here we would not need all a[i]"
27 Two Phase Simplex" We can now answer the question how we obtain a basic feasible " solution for a linear programming problem. We simply perform " two phases of Simplex optimization:" (1) "relax the original problem with artificial variables a[i]" "obtain the trivial initial solution for the relaxed problem " " "by substituting for a[i] in the objective function -sum(a[i])" "drive sum(a[i]) to 0 by maximizing -sum(a[i]) using Simplex" (2a) "If the optimal value of the objective function is >0" "the original problem is infeasible" (2b) "Otherwise set a[i]=0 in the final tableau of the revised problem" "substitute the resulting equations of the final tableau from phase I" "into the original objective function" (2c) "combine revised objective function with equations from phase I" "..and perform Simplex on the thus obtained tableau."
28 Example " For the example problem, we start phase II with the tableau" z == 3 2s[2] + 2s[3] + x[1] s[1] == 3 s[3] x[1] x[2] == s[2] + s[3] + 3x[1] x[3] == 8 + s[2] + 3s[3] x[1] ( originally: x[1]-x[2]+x[3] )" For this tableau Simplex generates the solution" z == 3 2s[1] s[2] x[1] s[3] == 3 s[1] x[1] x[2] == 14 x[3] == 17 s[1] + 2s[2] + 2x[1] + 3s[1] + s[2] 4x[1]
29 Redundant Constraints " It can happen that not all artificial variables are parametric" (non-basic) after phase we cannot set them to zero!" Let the equation for this variable be" a j = 0 + c i a i + c i ʹ x i intercept must be 0, otherwise problem is infeasible" Two possibilities:" All variables on the RHS are artificial:" Delete this equation and the artificial variable aj." This happens if one of the original constraints was redundant. At least one (non-artificial) variable Xi has a coefficient non-zero:" pivot out aj (Xi enters basis)." Repeat until all artificial variables are zero."
30 Minimization" Of course, Simplex can also handle minimization problems, because" min v x max v x f( v x ) subject to C( v x ) is the same as" f( v x ) subject to C( v x ) Also other inequalities and equalities are easily translated" to standard form:" : x i c 0 c x i s = c x i s 0 : x i c 0 x i c s = x i c s 0 =: x i = c x i c x i c unrestricted variables : x i = x i + x i x i + 0 x i 0 This way of handling equations increases the tableau significantly. "
31 Complexity" Linear Programming is known to be polynomial" (by reduction to LSI - linear strict inequalities)" Ax < B+ε Simplex is exponential in the worst-case" (construct a polytope with exponentially many vertices" such that Simplex may trace all vertices)" but well-behaved in practice!"
32 Summary" Today we have looked at" Classes of Optimization Problems" Linear Programming" The Simplex Algorithm" Homework" Execute Simplex manually on a small problem" Read Simplex in Winston and/or Marriott & Stuckey"
Integer Programming! Using linear programming to solve discrete problems
Integer Programming! Using linear programming to solve discrete problems Solving Discrete Problems Linear programming solves continuous problem! problems over the reai numbers.! For the remainder of the
More informationLinear Programming Problems
Linear Programming Problems Two common formulations of linear programming (LP) problems are: min Subject to: 1,,, 1,2,,;, max Subject to: 1,,, 1,2,,;, Linear Programming Problems The standard LP problem
More informationLinear Programming. Linear programming provides methods for allocating limited resources among competing activities in an optimal way.
University of Southern California Viterbi School of Engineering Daniel J. Epstein Department of Industrial and Systems Engineering ISE 330: Introduction to Operations Research - Deterministic Models Fall
More informationOptimization of Design. Lecturer:Dung-An Wang Lecture 8
Optimization of Design Lecturer:Dung-An Wang Lecture 8 Lecture outline Reading: Ch8 of text Today s lecture 2 8.1 LINEAR FUNCTIONS Cost Function Constraints 3 8.2 The standard LP problem Only equality
More information5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY
5. DUAL LP, SOLUTION INTERPRETATION, AND POST-OPTIMALITY 5.1 DUALITY Associated with every linear programming problem (the primal) is another linear programming problem called its dual. If the primal involves
More informationOutline. CS38 Introduction to Algorithms. Linear programming 5/21/2014. Linear programming. Lecture 15 May 20, 2014
5/2/24 Outline CS38 Introduction to Algorithms Lecture 5 May 2, 24 Linear programming simplex algorithm LP duality ellipsoid algorithm * slides from Kevin Wayne May 2, 24 CS38 Lecture 5 May 2, 24 CS38
More informationNOTATION AND TERMINOLOGY
15.053x, Optimization Methods in Business Analytics Fall, 2016 October 4, 2016 A glossary of notation and terms used in 15.053x Weeks 1, 2, 3, 4 and 5. (The most recent week's terms are in blue). NOTATION
More informationChapter II. Linear Programming
1 Chapter II Linear Programming 1. Introduction 2. Simplex Method 3. Duality Theory 4. Optimality Conditions 5. Applications (QP & SLP) 6. Sensitivity Analysis 7. Interior Point Methods 1 INTRODUCTION
More informationLinear and Integer Programming :Algorithms in the Real World. Related Optimization Problems. How important is optimization?
Linear and Integer Programming 15-853:Algorithms in the Real World Linear and Integer Programming I Introduction Geometric Interpretation Simplex Method Linear or Integer programming maximize z = c T x
More informationAdvanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 2 Review Dr. Ted Ralphs IE316 Quiz 2 Review 1 Reading for The Quiz Material covered in detail in lecture Bertsimas 4.1-4.5, 4.8, 5.1-5.5, 6.1-6.3 Material
More informationMATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS
MATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS GRADO EN A.D.E. GRADO EN ECONOMÍA GRADO EN F.Y.C. ACADEMIC YEAR 2011-12 INDEX UNIT 1.- AN INTRODUCCTION TO OPTIMIZATION 2 UNIT 2.- NONLINEAR PROGRAMMING
More informationIntroduction to Linear Programming
Introduction to Linear Programming Eric Feron (updated Sommer Gentry) (updated by Paul Robertson) 16.410/16.413 Historical aspects Examples of Linear programs Historical contributor: G. Dantzig, late 1940
More informationSection Notes 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017
Section Notes 5 Review of Linear Programming Applied Math / Engineering Sciences 121 Week of October 15, 2017 The following list of topics is an overview of the material that was covered in the lectures
More informationLinear Programming. them such that they
Linear Programming l Another "Sledgehammer" in our toolkit l Many problems fit into the Linear Programming approach l These are optimization tasks where both the constraints and the objective are linear
More informationLinear programming II João Carlos Lourenço
Decision Support Models Linear programming II João Carlos Lourenço joao.lourenco@ist.utl.pt Academic year 2012/2013 Readings: Hillier, F.S., Lieberman, G.J., 2010. Introduction to Operations Research,
More information4.1 Graphical solution of a linear program and standard form
4.1 Graphical solution of a linear program and standard form Consider the problem min c T x Ax b x where x = ( x1 x ) ( 16, c = 5 ), b = 4 5 9, A = 1 7 1 5 1. Solve the problem graphically and determine
More information3 INTEGER LINEAR PROGRAMMING
3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=
More informationRead: H&L chapters 1-6
Viterbi School of Engineering Daniel J. Epstein Department of Industrial and Systems Engineering ISE 330: Introduction to Operations Research Fall 2006 (Oct 16): Midterm Review http://www-scf.usc.edu/~ise330
More informationProgramming, numerics and optimization
Programming, numerics and optimization Lecture C-4: Constrained optimization Łukasz Jankowski ljank@ippt.pan.pl Institute of Fundamental Technological Research Room 4.32, Phone +22.8261281 ext. 428 June
More informationPart 4. Decomposition Algorithms Dantzig-Wolf Decomposition Algorithm
In the name of God Part 4. 4.1. Dantzig-Wolf Decomposition Algorithm Spring 2010 Instructor: Dr. Masoud Yaghini Introduction Introduction Real world linear programs having thousands of rows and columns.
More informationLinear Programming. Course review MS-E2140. v. 1.1
Linear Programming MS-E2140 Course review v. 1.1 Course structure Modeling techniques Linear programming theory and the Simplex method Duality theory Dual Simplex algorithm and sensitivity analysis Integer
More informationLinear Programming Motivation: The Diet Problem
Agenda We ve done Greedy Method Divide and Conquer Dynamic Programming Network Flows & Applications NP-completeness Now Linear Programming and the Simplex Method Hung Q. Ngo (SUNY at Buffalo) CSE 531 1
More informationArtificial Intelligence
Artificial Intelligence Combinatorial Optimization G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 1 GG A.I. 1/34 Outline 1 Motivation 2 Geometric resolution
More information3. The Simplex algorithmn The Simplex algorithmn 3.1 Forms of linear programs
11 3.1 Forms of linear programs... 12 3.2 Basic feasible solutions... 13 3.3 The geometry of linear programs... 14 3.4 Local search among basic feasible solutions... 15 3.5 Organization in tableaus...
More informationCSE 40/60236 Sam Bailey
CSE 40/60236 Sam Bailey Solution: any point in the variable space (both feasible and infeasible) Cornerpoint solution: anywhere two or more constraints intersect; could be feasible or infeasible Feasible
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More informationDiscrete Optimization. Lecture Notes 2
Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The
More informationCivil Engineering Systems Analysis Lecture XIV. Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics
Civil Engineering Systems Analysis Lecture XIV Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics Today s Learning Objectives Dual 2 Linear Programming Dual Problem 3
More informationLinear programming and duality theory
Linear programming and duality theory Complements of Operations Research Giovanni Righini Linear Programming (LP) A linear program is defined by linear constraints, a linear objective function. Its variables
More information16.410/413 Principles of Autonomy and Decision Making
16.410/413 Principles of Autonomy and Decision Making Lecture 17: The Simplex Method Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 10, 2010 Frazzoli (MIT)
More informationSome Advanced Topics in Linear Programming
Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,
More informationLecture 9: Linear Programming
Lecture 9: Linear Programming A common optimization problem involves finding the maximum of a linear function of N variables N Z = a i x i i= 1 (the objective function ) where the x i are all non-negative
More informationAdvanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material
More informationCOLUMN GENERATION IN LINEAR PROGRAMMING
COLUMN GENERATION IN LINEAR PROGRAMMING EXAMPLE: THE CUTTING STOCK PROBLEM A certain material (e.g. lumber) is stocked in lengths of 9, 4, and 6 feet, with respective costs of $5, $9, and $. An order for
More informationGraphs that have the feasible bases of a given linear
Algorithmic Operations Research Vol.1 (2006) 46 51 Simplex Adjacency Graphs in Linear Optimization Gerard Sierksma and Gert A. Tijssen University of Groningen, Faculty of Economics, P.O. Box 800, 9700
More informationCS675: Convex and Combinatorial Optimization Spring 2018 The Simplex Algorithm. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Spring 2018 The Simplex Algorithm Instructor: Shaddin Dughmi Algorithms for Convex Optimization We will look at 2 algorithms in detail: Simplex and Ellipsoid.
More informationLinear Programming Terminology
Linear Programming Terminology The carpenter problem is an example of a linear program. T and B (the number of tables and bookcases to produce weekly) are decision variables. The profit function is an
More informationThe Simplex Algorithm
The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly
More informationLinear Programming: Introduction
CSC 373 - Algorithm Design, Analysis, and Complexity Summer 2016 Lalla Mouatadid Linear Programming: Introduction A bit of a historical background about linear programming, that I stole from Jeff Erickson
More informationCSC 8301 Design & Analysis of Algorithms: Linear Programming
CSC 8301 Design & Analysis of Algorithms: Linear Programming Professor Henry Carter Fall 2016 Iterative Improvement Start with a feasible solution Improve some part of the solution Repeat until the solution
More informationDuality. Primal program P: Maximize n. Dual program D: Minimize m. j=1 c jx j subject to n. j=1. i=1 b iy i subject to m. i=1
Duality Primal program P: Maximize n j=1 c jx j subject to n a ij x j b i, i = 1, 2,..., m j=1 x j 0, j = 1, 2,..., n Dual program D: Minimize m i=1 b iy i subject to m a ij x j c j, j = 1, 2,..., n i=1
More informationHow to Solve a Standard Maximization Problem Using the Simplex Method and the Rowops Program
How to Solve a Standard Maximization Problem Using the Simplex Method and the Rowops Program Problem: Maximize z = x + 0x subject to x + x 6 x + x 00 with x 0 y 0 I. Setting Up the Problem. Rewrite each
More informationIntroduction. Linear because it requires linear functions. Programming as synonymous of planning.
LINEAR PROGRAMMING Introduction Development of linear programming was among the most important scientific advances of mid-20th cent. Most common type of applications: allocate limited resources to competing
More informationAM 121: Intro to Optimization Models and Methods Fall 2017
AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 10: Dual Simplex Yiling Chen SEAS Lesson Plan Interpret primal simplex in terms of pivots on the corresponding dual tableau Dictionaries
More informationLecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize.
Cornell University, Fall 2017 CS 6820: Algorithms Lecture notes on the simplex method September 2017 1 The Simplex Method We will present an algorithm to solve linear programs of the form maximize subject
More informationCHAPTER 3 LINEAR PROGRAMMING: SIMPLEX METHOD
CHAPTER 3 LINEAR PROGRAMMING: SIMPLEX METHOD Linear programming is optimization problem where the objective function is linear and all equality and inequality constraints are linear. This problem was first
More informationGraphing Linear Inequalities in Two Variables.
Many applications of mathematics involve systems of inequalities rather than systems of equations. We will discuss solving (graphing) a single linear inequality in two variables and a system of linear
More informationHeuristic Optimization Today: Linear Programming. Tobias Friedrich Chair for Algorithm Engineering Hasso Plattner Institute, Potsdam
Heuristic Optimization Today: Linear Programming Chair for Algorithm Engineering Hasso Plattner Institute, Potsdam Linear programming Let s first define it formally: A linear program is an optimization
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More informationDM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions
More informationDEGENERACY AND THE FUNDAMENTAL THEOREM
DEGENERACY AND THE FUNDAMENTAL THEOREM The Standard Simplex Method in Matrix Notation: we start with the standard form of the linear program in matrix notation: (SLP) m n we assume (SLP) is feasible, and
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 - 03 Tabular form (Minimization) In this
More informationAdvanced Algorithms Linear Programming
Reading: Advanced Algorithms Linear Programming CLRS, Chapter29 (2 nd ed. onward). Linear Algebra and Its Applications, by Gilbert Strang, chapter 8 Linear Programming, by Vasek Chvatal Introduction to
More informationWEEK 4 REVIEW. Graphing Systems of Linear Inequalities (3.1)
WEEK 4 REVIEW Graphing Systems of Linear Inequalities (3.1) Linear Programming Problems (3.2) Checklist for Exam 1 Review Sample Exam 1 Graphing Linear Inequalities Graph the following system of inequalities.
More informationLinear Programming Problems: Geometric Solutions
Linear Programming Problems: Geometric s Terminology Linear programming problems: problems where we must find the optimum (minimum or maximum) value of a function, subject to certain restrictions. Objective
More informationFinite Math Linear Programming 1 May / 7
Linear Programming Finite Math 1 May 2017 Finite Math Linear Programming 1 May 2017 1 / 7 General Description of Linear Programming Finite Math Linear Programming 1 May 2017 2 / 7 General Description of
More information5.3 Cutting plane methods and Gomory fractional cuts
5.3 Cutting plane methods and Gomory fractional cuts (ILP) min c T x s.t. Ax b x 0integer feasible region X Assumption: a ij, c j and b i integer. Observation: The feasible region of an ILP can be described
More informationChapter 3 Linear Programming: A Geometric Approach
Chapter 3 Linear Programming: A Geometric Approach Section 3.1 Graphing Systems of Linear Inequalities in Two Variables y 4x + 3y = 12 4 3 4 x 3 y 12 x y 0 x y = 0 2 1 P(, ) 12 12 7 7 1 1 2 3 x We ve seen
More informationAMATH 383 Lecture Notes Linear Programming
AMATH 8 Lecture Notes Linear Programming Jakob Kotas (jkotas@uw.edu) University of Washington February 4, 014 Based on lecture notes for IND E 51 by Zelda Zabinsky, available from http://courses.washington.edu/inde51/notesindex.htm.
More informationUnit.9 Integer Programming
Unit.9 Integer Programming Xiaoxi Li EMS & IAS, Wuhan University Dec. 22-29, 2016 (revised) Operations Research (Li, X.) Unit.9 Integer Programming Dec. 22-29, 2016 (revised) 1 / 58 Organization of this
More informationUNIT 2 LINEAR PROGRAMMING PROBLEMS
UNIT 2 LINEAR PROGRAMMING PROBLEMS Structure 2.1 Introduction Objectives 2.2 Linear Programming Problem (LPP) 2.3 Mathematical Formulation of LPP 2.4 Graphical Solution of Linear Programming Problems 2.5
More informationAhigh school curriculum in Algebra 2 contains both solving systems of linear equations,
The Simplex Method for Systems of Linear Inequalities Todd O. Moyer, Towson University Abstract: This article details the application of the Simplex Method for an Algebra 2 class. Students typically learn
More informationComputational Methods. Constrained Optimization
Computational Methods Constrained Optimization Manfred Huber 2010 1 Constrained Optimization Unconstrained Optimization finds a minimum of a function under the assumption that the parameters can take on
More informationLINEAR PROGRAMMING INTRODUCTION 12.1 LINEAR PROGRAMMING. Three Classical Linear Programming Problems (L.P.P.)
LINEAR PROGRAMMING 12 INTRODUCTION ou are familiar with linear equations and linear inequations in one and two variables. They can be solved algebraically or graphically (by drawing a line diagram in case
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More informationSimulation. Lecture O1 Optimization: Linear Programming. Saeed Bastani April 2016
Simulation Lecture O Optimization: Linear Programming Saeed Bastani April 06 Outline of the course Linear Programming ( lecture) Integer Programming ( lecture) Heuristics and Metaheursitics (3 lectures)
More informationDepartment of Mathematics Oleg Burdakov of 30 October Consider the following linear programming problem (LP):
Linköping University Optimization TAOP3(0) Department of Mathematics Examination Oleg Burdakov of 30 October 03 Assignment Consider the following linear programming problem (LP): max z = x + x s.t. x x
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 1.0 Introduction Linear programming
More informationExample Graph the inequality 2x-3y 12. Answer - start with the = part. Graph the line 2x - 3y = 12. Linear Programming: A Geometric Approach
Linear Programming: A Geometric Approach 3.1: Graphing Systems of Linear Inequalities in Two Variables Example Graph the inequality 2x-3y 12. Answer - start with the = part. Graph the line 2x - 3y = 12.
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 16 Cutting Plane Algorithm We shall continue the discussion on integer programming,
More informationInteger Programming Theory
Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x
More informationLinear Optimization. Andongwisye John. November 17, Linkoping University. Andongwisye John (Linkoping University) November 17, / 25
Linear Optimization Andongwisye John Linkoping University November 17, 2016 Andongwisye John (Linkoping University) November 17, 2016 1 / 25 Overview 1 Egdes, One-Dimensional Faces, Adjacency of Extreme
More informationAn iteration of the simplex method (a pivot )
Recap, and outline of Lecture 13 Previously Developed and justified all the steps in a typical iteration ( pivot ) of the Simplex Method (see next page). Today Simplex Method Initialization Start with
More information4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
4 LINEAR PROGRAMMING (LP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 Mathematical programming (optimization) problem: min f (x) s.t. x X R n set of feasible solutions with linear objective function
More informationResource Allocation (p. 254)
Linear Optimization 4.2 120 Resource Allocation (p. 254) Determine the linear program corresponding to the following problem. A farmer has set aside 18 acres of land to be used entirely for plots of grapes,
More informationCS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension
CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture
More informationCopyright 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin Introduction to the Design & Analysis of Algorithms, 2 nd ed., Ch.
Iterative Improvement Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change the current feasible
More informationChapter 4: The Mechanics of the Simplex Method
Chapter 4: The Mechanics of the Simplex Method The simplex method is a remarkably simple and elegant algorithmic engine for solving linear programs. In this chapter we will examine the internal mechanics
More informationLecture notes on Transportation and Assignment Problem (BBE (H) QTM paper of Delhi University)
Transportation and Assignment Problems The transportation model is a special class of linear programs. It received this name because many of its applications involve determining how to optimally transport
More information5 Day 5: Maxima and minima for n variables.
UNIVERSITAT POMPEU FABRA INTERNATIONAL BUSINESS ECONOMICS MATHEMATICS III. Pelegrí Viader. 2012-201 Updated May 14, 201 5 Day 5: Maxima and minima for n variables. The same kind of first-order and second-order
More informationConstrained Optimization COS 323
Constrained Optimization COS 323 Last time Introduction to optimization objective function, variables, [constraints] 1-dimensional methods Golden section, discussion of error Newton s method Multi-dimensional
More informationCivil Engineering Systems Analysis Lecture XV. Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics
Civil Engineering Systems Analysis Lecture XV Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics Today s Learning Objectives Sensitivity Analysis Dual Simplex Method 2
More informationLinear Programming Duality and Algorithms
COMPSCI 330: Design and Analysis of Algorithms 4/5/2016 and 4/7/2016 Linear Programming Duality and Algorithms Lecturer: Debmalya Panigrahi Scribe: Tianqi Song 1 Overview In this lecture, we will cover
More informationGENERAL ASSIGNMENT PROBLEM via Branch and Price JOHN AND LEI
GENERAL ASSIGNMENT PROBLEM via Branch and Price JOHN AND LEI Outline Review the column generation in Generalized Assignment Problem (GAP) GAP Examples in Branch and Price 2 Assignment Problem The assignment
More informationLP-Modelling. dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven. January 30, 2008
LP-Modelling dr.ir. C.A.J. Hurkens Technische Universiteit Eindhoven January 30, 2008 1 Linear and Integer Programming After a brief check with the backgrounds of the participants it seems that the following
More informationUnconstrained Optimization Principles of Unconstrained Optimization Search Methods
1 Nonlinear Programming Types of Nonlinear Programs (NLP) Convexity and Convex Programs NLP Solutions Unconstrained Optimization Principles of Unconstrained Optimization Search Methods Constrained Optimization
More informationVARIANTS OF THE SIMPLEX METHOD
C H A P T E R 6 VARIANTS OF THE SIMPLEX METHOD By a variant of the Simplex Method (in this chapter) we mean an algorithm consisting of a sequence of pivot steps in the primal system using alternative rules
More informationThe Simplex Algorithm. Chapter 5. Decision Procedures. An Algorithmic Point of View. Revision 1.0
The Simplex Algorithm Chapter 5 Decision Procedures An Algorithmic Point of View D.Kroening O.Strichman Revision 1.0 Outline 1 Gaussian Elimination 2 Satisfiability with Simplex 3 General Simplex Form
More informationCASE STUDY. fourteen. Animating The Simplex Method. case study OVERVIEW. Application Overview and Model Development.
CASE STUDY fourteen Animating The Simplex Method case study OVERVIEW CS14.1 CS14.2 CS14.3 CS14.4 CS14.5 CS14.6 CS14.7 Application Overview and Model Development Worksheets User Interface Procedures Re-solve
More informationOptimization Methods in Management Science
Problem Set Rules: Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 6, Due: Thursday April 11th, 2013 1. Each student should hand in an individual problem set. 2. Discussing
More informationChapter 1 Linear Programming. Paragraph 4 The Simplex Algorithm
Chapter Linear Programming Paragraph 4 The Simplex Algorithm What we did so far By combining ideas of a specialized algorithm with a geometrical view on the problem, we developed an algorithm idea: Find
More informationFundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology Madras.
Fundamentals of Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture No # 06 Simplex Algorithm Initialization and Iteration (Refer Slide
More informationLinear Programming. Readings: Read text section 11.6, and sections 1 and 2 of Tom Ferguson s notes (see course homepage).
Linear Programming Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory: Feasible Set, Vertices, Existence of Solutions. Equivalent formulations. Outline
More informationLecture 4: Linear Programming
COMP36111: Advanced Algorithms I Lecture 4: Linear Programming Ian Pratt-Hartmann Room KB2.38: email: ipratt@cs.man.ac.uk 2017 18 Outline The Linear Programming Problem Geometrical analysis The Simplex
More informationLinear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.
Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 50
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 50 CS 473: Algorithms, Spring 2018 Introduction to Linear Programming Lecture 18 March
More informationLecture Notes 2: The Simplex Algorithm
Algorithmic Methods 25/10/2010 Lecture Notes 2: The Simplex Algorithm Professor: Yossi Azar Scribe:Kiril Solovey 1 Introduction In this lecture we will present the Simplex algorithm, finish some unresolved
More informationLinear Programming: A Geometric Approach
Chapter 3 Linear Programming: A Geometric Approach 3.1 Graphing Systems of Linear Inequalities in Two Variables The general form for a line is ax + by + c =0. The general form for a linear inequality is
More informationBCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D.
Linear Programming Module Outline Introduction The Linear Programming Model Examples of Linear Programming Problems Developing Linear Programming Models Graphical Solution to LP Problems The Simplex Method
More informationEcon 172A - Slides from Lecture 2
Econ 205 Sobel Econ 172A - Slides from Lecture 2 Joel Sobel September 28, 2010 Announcements 1. Sections this evening (Peterson 110, 8-9 or 9-10). 2. Podcasts available when I remember to use microphone.
More information