Linear Programming has been used to:
|
|
- Prosper Walton
- 6 years ago
- Views:
Transcription
1 Linear Programming Linear programming became important during World War II: used to solve logistics problems for the military. Linear Programming (LP) was the first widely used form of optimization in the process industries and is still the dominant form today. Linear Programming has been used to: schedule production, choose feedstocks, determine new product feasibility, handle constraints for process controllers, here is still a considerable amount of research taking place in this area today.
2 Linear Programming All Linear Programs can be written in the form: min c11 + c22 + c33 + K + cn i subject to: a + a + a + K + a! b n n 1 a + a + a + K + a! b n n 2 a + a + a + K + a! b m1 1 m2 2 m3 3 mn n m n 0!! i b i " 0 l, i note that all of the functions in this optimization problem are linear in the variables i.
3 Linear Programming In mathematical short-hand this problem can be re-written: min c subject to : A " b 0 " " l b! 0 Note that: 1) the objective function is linear, 2) the constraints are linear, convention 3) the variables are defined as non-negative, 4) all elements of b are non-negative. convention
4 Linear Programming A Simple Eample: A market gardener has a small plot of land she wishes to use to plant cabbages and tomatoes. From past eperience she knows that her garden will yield about 1.5 tons of cabbage per acre or 2 tons of tomatoes per acre. Her eperience also tells her that cabbages require 20 lbs of fertilizer per acre, whereas tomatoes require 60 lbs of fertilizer per acre. She epects that her efforts will produce $600/ton of cabbages and $750/ton of tomatoes. Unfortunately, the truck she uses to take her produce to market is getting old, so she doesn't think that it will transport anymore than 3 tons of produce to market at harvest time. She has also found that she only has 60 lbs of fertilizer. What combination of cabbages and tomatoes should she plant to maimize her profits?
5 Linear Programming he optimization problem is: In the general matri LP form:
6 Linear Programming We can solve this problem graphically: 3 fertilizer increasing profit c (acres) 2 profit contours 1 feasible region trucking 1 2 t (acres) We know that for well-posed LP problems, the solution lies at a verte of the feasible region. So all we have to do is try all of the constraint intersection points.
7 Linear Programming Check each verte: c t P() / / So our market gardener should plant 1.2 acres in cabbages and 0.6 acres in tomatoes. She will then make $1980 in profit. his graphical procedure is adequate when the optimization problem is simple. For optimization problems which include more variables and constraints this approach becomes impractical.
8 Linear Programming Our eample was well-posed, which means there was an unique optimum. It is possible to formulate LP problems which are ill-posed or degenerate. here are three main types of degeneracy which must be avoided in Linear Programming: 1) unbounded solutions, - not enough independent constraints. 2) no feasible region, - too many or conflicting constraints. 3) non-unique solution, - too many solutions, - dependence between profit function and a few of the constraints.
9 Linear Programming 1) Unbounded Solution: improving performance constraint 1 2 As we move up either the 1 -ais or the constraint the objective function improves without limit. In industrial-scale problems with many variables and constraints, this situation can arise when: there are too few constraints. there is linear dependence among the constraints.
10 Linear Programming 2) No Feasible Region: improving performance 1 2 Any value of violates some set of constraints. his situation occurs most often in industrial-scale LP problems when too many constraints are specified and some of them conflict.
11 Linear Programming 3) Non-Unique Solution: improving performance 1 feasible region optimum P() anywhere on this line segment. 2 Profit contour is parallel to constraint or:! P " C i!
12 Linear Programming Our market gardener eample had the form: min - [ ] subject to : ' 1.5 % & 20 2 $ 60 " # ( ' 3 $ % 60 " & # where :! [ acres cabbages acres tomatoes]. We need a more systematic approach to solving these problems, particularly when there are many variables and constraints. SIPLEX method (Dantzig). always move to a verte which improves the value of the objective function.
13 Linear Programming SIPLEX Algorithm 1) Convert problem to standard form with: positive right-hand sides, lower bounds of zero. 2) Introduce slack / surplus variables: change all inequality constraints to equality constraints. 3) Define an initial feasible basis: choose a starting set of variable values which satisfy all of the constraints. 4) Determine a new basis which improves objective function: select a new verte with a better value of P(). 5) ransform the equations: perform row reduction on the equation set. 6) Repeat Steps 4 & 5 until no more improvement in the objective function is possible.
14 Linear Programming arket Gardener Revisited he problem was written: ma c,t 900 c t subject to : 1.5 c + 2 t! 3 20 c + 60 t! 60 1) in standard form, the problem is: trucking fertilizer min - [ ] subject to : ( 1.5 & ' 20 2 % ( 3 % 60 # ) & 60 # $ ' $ " 0 where! [ c t].
15 Linear Programming arket Gardener Revisited 2) Introduce slack variables ( or convert all inequality constraints to equality constraints): min c,t subject to : or in matri form: -900 c t 1.5 c + 2 t 20 c + 60 t + s 1 + s 2 c, t,s 1 = = 60,s 3 2! 0 trucking fertilizer min - [ ] subject to : ( 1.5 & ' % = 1 # $ " 0 ( 3 % & 60 # ' $ where! [ c t s s ]. 1 2
16 Linear Programming arket Gardener Revisited 3) Define an initial basis and set up tableau: choose the slacks as the initial basic variables, this is equivalent to starting at the origin. the initial tableau is: c t s 1 s 2 b basis variables s 1 s objective function coefficients objective function value
17 Linear Programming arket Gardener Revisited 4) Determine the new basis: eamine the objective function coefficients and choose a variable with a negative weight. (you want to decrease the objective function because you are minimizing. Usually we will choose the most negative weight, but this is not necessary). this variable will be brought into the basis. divide each element of b by the corresponding constraint coefficient of the new basic variable. the variable which will be removed from the basis is in the pivot row (given by the smallest positive ratio of b i /a ij ). new non-basic variable new basic variable c t s 1 s 2 b s 1 s b 1 /a 12 = 3/2 b 2 /a 22 = pivo t most negative coefficient, bring "t" into the basis
18 Linear Programming arket Gardener Revisited 5) ransform the constraint equations: perform row reduction on the constraint equations to make the pivot element 1 and all other elements of the pivot column 0. c t s 1 s 2 b s 1 t 5/6 1/ /30 1/ i) new row #2 = row #2 / 60 ii) new row #1 = row #1-2new row #2 iii) new row #3 = row # new row #2
19 Linear Programming arket Gardener Revisited 6) Repeat Steps 4 & 5 until no more improvement is possible: pivot s 1 t c t s 1 s 2 b 5/6 1/ /30 1/ the new tableau is: c t s 1 s 2 b c t /5-1/3-1/25 3/100 6/5 3/ no further improvements are possible, since there are no more negative coefficients in the bottom row of the tableau
20 Linear Programming arket Gardener Revisited he final tableau is: optimal acres of cabbages & tomatoes c t s 1 s 2 b c t /5-1/3-1/25 3/100 6/5 3/ optimal basis contains both cabbages and tomatoes. maimum profit shadow prices Reduced cost Dual variables Lagrange ultipliers Kuhn-ucker multipliers
21 Linear Programming arket Gardener Revisited Recall that we could graph the market garden problem: 3 fertilizer increasing profit c (acres) 2 profit contours 1 feasible region trucking start 1 2 t (acres) We can track how the SIPLEX algorithm moved through the feasible region. he SIPLEX algorithm started at the origin. hen moved along the tomato ais (this was equivalent to introducing tomatoes into the basis) to the fertilizer constraint. he algorithm then moved up the fertilizer constraint until it found the intersection with the trucking constraint, which is the optimal solution.
22 SIPLEX Algorithm (atri Form) o develop the matri form for the Linear Programming problem: min c subject to: A! b " 0 we introduce the slack variables and partition, A and c as follows: basic " B % = $!!! ' $ ' # $ N &' non-basic [ ] A = B N c = " c B % $!!! ' $ ' # $ c N &' hen, the Linear Programming problem becomes: min subject to: c + c B B N N B + N = b B N,! 0 B N
23 SIPLEX Algorithm (atri Form) Feasible values of the basic variables ( B ) can be defined in terms of the values for non-basic variables ( N ): [ N ] -1 = B b - N B he value of the objective function is given by: [ ] P( ) = c BB -1 b - N N + c N N or: [ ] P( ) = c BB -1 b + c N - c BB -1 N N hen, the tableau we used to solve these problems can be represented as: B N b B I B -1 N B -1 b 0-1 [ c c B N] - N - -1 B c B b B
24 SIPLEX Algorithm (atri Form) he Simple Algorithm is: 1) form the B and N matrices. Calculate B -1. 2) calculate the shadow prices (reduced costs) of the nonbasic variables ( N ): -1 [ c N c BB N] - - 3) calculate B -1 N and B -1 b. 4) find the pivot element by performing the ratio test using the column corresponding to the most negative shadow price. 5) the pivot column corresponds to the new basic variable and the pivot row corresponds to the new non-basic variable. odify the B and N matrices accordingly. Calculate B -1. 6) repeat steps 2 through 5 until there are no negative shadow prices remaining.
25 SIPLEX Algorithm (atri Form) his method is computationally inefficient because you must calculate a complete inverse of the matri B at each iteration of the SIPLEX algorithm. here are several variations on the Revised SIPLEX algorithm which attempt to minimize the computations and memory requirements of the method. Eamples of these can be found in: Chvatal Edgar & Himmelblau (references in 7.7) Fletcher Gill, urray and Wright
26 Duality & Linear Programming any of the traditional advanced topics in LP analysis and research are based on the so-called method of Lagrange. his approach to constrained optimization:. originated from the study of orbital motion.. has proven etremely useful in the development of, optimality conditions for constrained problems, duality theory, optimization algorithms, sensitivity analysis. Consider the general Linear programming problem: min c subject to: A! b his problem is often called the Primal problem to indicate that it is defined in terms of the Primal variables ().
27 Duality & Linear Programming You form the Lagrangian of this optimization problem as follows: L(,") = c - " A! b [ ] objective function P() Lagrange multipliers constraints g() Notice that the Lagrangian is a scalar function of two sets of variables: the Primal variables, and the Dual variables (or Lagrange multipliers) λ. Up until now we have been calling the Lagrange multipliers λ the shadow prices. We can develop the Dual problem first be re-writing the Lagrangian as: L(,!) = [ c - A " b ]! which can be re-arranged to yield: [ A " c] L( ", ) = b " -! his Lagrangian looks very similar to the previous one ecept that the Lagrange multipliers λ and problem variables have switched places.
28 Duality & Linear Programming In fact this re-arranged form is the Lagrangian for the maimization problem: ma b # # subject to: A # " c # his formulation is often called the Dual problem to indicate that it is defined in terms of the Dual variables λ.! 0 It is worth noting that in our market gardener eample, if we calculate the optimum value of the objective function using the Primal variables : P( ) Primal = c = 900 & $ % 6 5 #! + " & 3 # 1500$! =1980 % 5 " and using the Dual variables λ : P(! ) = b Dual! = 3 ( 480) + 60( 9) = 1980 we get the same result. here is a simple eplanation for this that we will eamine later.
29 Duality & Linear Programming Besides being of theoretical interest, the Dual problem formulation can have practical advantages in terms of ease of solution. Consider that the Primal problem was formulated as: min c subject to: A As we saw earlier, problems with inequality constraints of this form often present some difficulty in determining an initial feasible starting point. hey usually require a Phase 1 starting procedure such as the Big method.! b he Dual problem had the form: ma b # # subject to: A # " c # Problems such as these are usually easy to start since λ =0 is a feasible point. hus no Phase 1 starting procedure is required.! 0 As a result you may want to consider solving the Dual problem, when the origin is not a feasible starting point for the Primal problem.
30 Optimality Conditions & Linear Programming Consider the linear programming problem: min c subject to:! $ N b # & '! " % " # $ b & N % active inactive if equality constraints are present, they can be used to eliminate some of the elements of, thereby reducing the dimensionality of the optimization problem. rows of the coefficient matri () are linearly independent. In our market gardener eample, the problem looked like: g 4 c (acres) 2 1 g 1 feasible region active g 2 g 1 - fertilizer g 2 - trucking g 3 - non-negativity tomatoes g 4 - non-negativity cabbages 1 2 t (acres) g 3
31 Optimality Conditions & Linear Programming Form the Lagrangian: L(,!) = c -! [ -b ] -! N [ N -b N ] At the optimum, we know that the Lagrange multipliers (shadow prices) for the inactive inequality constraints are zero (i.e. λ N =0). Also, since at the optimum the active inequality constraints are eactly satisfied:! b = 0 hen, notice that at the optimum: L (,! ) = P( ) = c At the optimum, we have seen that the shadow prices for the active inequality constraints must all be non-negative (i.e. λ 0). hese multiplier values told us how much the optimum value of the objective function would increase if the associated constraint was moved into the feasible region, for a minimization problem. Finally, the optimum (,λ ) must be a stationary point of the Lagrangian: " " l L( L(,! ) =,! ) = " P( ) -(! ) g ( ) = c -(! ) ( g ( )) = ( -b ) = 0 = 0
32 Optimality Conditions & Linear Programming hus, necessary and sufficient conditions for an optimum of a Linear Programming problem are: 1) the rows of the active set matri () must be linearly independent, 2) the active set are eactly satisfied at the optimum point : 3) the Lagrange multipliers for the inequality constraints are: b = " " N = 0! 0 this is sometimes epressed as: (" )[ b ] + ( )[ N! b ] = 0! " N N 4) the optimum point (,λ ) is a stationary point of the Lagrangian: " L(,! ) = 0
33 Optimality Conditions & Linear Programming his 2 variable optimization problem has an optimum at the intersection of the g 1 and g 2 constraints, and can be depicted as: g 2 profit contours g 1 g 1 P 1 feasible region g 2 2
34 Linear Programming & Sensitivity Analysis Usually there is some uncertainty associated with the values used in an optimization problem. After we have solved an optimization problem, we are often interested in knowing how the optimal solution will change as specific problem parameters change. his is called by a variety of names, including: sensitivity analysis, post-optimality analysis, parametric programming. In our Linear Programming problems we have made use of pricing information, but we know such prices can fluctuate. Similarly the demand / availability information we have used is also subject to some fluctuation. Consider that in our market gardener problem, we might be interested in determining how the optimal solution changes when: the price of vegetables changes, the amount of available fertilizer changes, we buy a new truck.
35 Linear Programming & Sensitivity Analysis In the market gardener eample, we had: 3 fertilizer increasing profit c (acres) 2 profit contours 1 feasible region trucking 1 2 t (acres) Changes in the pricing information (c ) affects the slope of the objective function contours. Changes to the right-hand sides of the inequality constraints (b), translates the constraints without affecting their slope. Changes to the coefficient matri of the constraints (A) affects the slopes of the corresponding constraints.
36 Linear Programming & Sensitivity Analysis For the general Linear Programming problem: we had the Lagrangian: or in terms of the active and inactive inequality constraints: Recall that at the optimum: " " # L( L( min c subject to:,# ) = c A,# ) = - # = 0 [ - b ] = 0 = 0 Notice that the first two sets of equations are linear in the variables of interest (,λ ) and they can be solved to yield:! b #! N [ A b] L(,") = P( ) -" g( ) = c! "! [! b ]! [ N b ] L(,") = c! " "! N N! = ( = -1 ) b -1 c
37 Linear Programming & Sensitivity Analysis hen, as we discussed previously, it follows that: P( ) = c = c -1 b = (! ) b = b! We now have epressions for the complete solution of our Linear Programming problem in terms of the problem parameters. In this course we will only consider two types of variation in our nominal optimization problem including: 1) changes in the right-hand side of constraints (b). Such changes occur with variation in the supply / demand of materials, product quality requirements and so forth. 2) pricing (c) changes. he economics used in optimization are rarely known eactly. For the more difficult problem of determining the effects of uncertainty in the coefficient matri (A) on the optimization results see: Gal,., Postoptimal Analysis, Parametric Programming and Related opics, cgraw-hill, Forbes, J.F., and.e. arlin, odel Accuracy for Economic Optimizing Controllers: he Bias Update Case, Ind. Eng. Chem. Res., 33, pp , 1994.
38 Linear Programming & Sensitivity Analysis For small (differential) changes in b, which do not change the active constraint set: shadow prices! P( ) =! l b = l b [( ) ] ( ) -1 # & -1 % (! b =! b[ b ] = % " " " ( $ % 0 ' ( -1 # c & % (! b l =! b % " " " ( = $ % 0 ' ( b 0 inverse of constraint coefficient matri Note that the Lagrange multipliers are not a function of b as long as the active constraint set does not change. For small (differential) changes in c, which do not change the active constraint set: ( c P( ( ( c c ) = ( = c ( [ c ] = ( ' 1 [ b ] c ) = &( ) c# &( ) # $! $! ) = ( c $ ' ' '! = $ ' ' '! $! $! % 0 " % 0 "
39 Linear Programming & Sensitivity Analysis Note that is not an eplicit function of the vector c and will not change so long as the active set remains fied. If a change in c causes an element of λ to become negative, then will jump to a new verte. Also it is worth noting that the optimal values P( ), and λ are all affected by changes in the elements of the constraint coefficient matri (). his is beyond the scope of the course and the interested student can find some detail in the references previously provided. here is a simple geometrical interpretation for most of these results. Consider the 2 variable Linear Programming problem: min 1,2 subject to: c c22! g1( ) $! a111 + a122 $ # g2( ) & = # a211 + a22 & 2 = A ' b # & # & "# %& "# %& Note that the set of inequality constraints can be epressed: A "( g1 % " % $ = $!!! ' ( g ' 2 = $ ' ) b $ ' $!!!' # $ N &' $ ' # &
40 Linear Programming Summary Linear Programs (LP) have the form: min c subject to : A! b 0!! upper the solution of a well-posed LP is uniquely determined by the intersection of the active constraints. most LPs are solved using the SIPLEX method. commercial computer codes used the Revised SIPLEX algorithm (more efficient). optimization studies include: solution to the nominal optimization problem, a sensitivity study to determine how uncertainty in the assumed problem parameter values affect the optimum.
41 Interior Point ethods Recall that the SIPLEX method solved the LP problem by walking around the boundary of the feasible region. he algorithm moved from verte to verte on the boundary. Interior Point methods move through the feasible region toward the optimum. his is accomplished by: 1) Converting the LP problem into an unconstrained problem using Barrier Functions for the constraints at each new point (iterate), 2) Solving the optimality conditions for the resulting unconstrained problem, 3) Repeating until converged. his is a very active research area and some eciting developments have occurred in the last two decades.
42 Interior Point ethods 3 fertilizer increasing profit c (acres) 2 profit contours 1 trucking 1 2 t (acres)
43 Linear Programming Problems 1. Kirkman Brothers Ice Cream Parlours sell three different flavours of Dairy Sweet ice milk: chocolate, vanilla, and banana. Due to etremely hot weather and a high demand for its products, Kirkman has run short of its supply of ingredients: milk, sugar and cream. Hence, Kirkman will not be able to fill all of the orders its has from its retail outlets (the ice cream parlours). Due to these circumstances, Kirkman has to make the best amounts of the three flavours given the restricted supply of the basic ingredients. he company will then ration the ice milk to its retail outlets. Kirkman has collected the following data on profitability of the various flavours and amounts of each ingredient required for each flavour: flavour milk (gal/gal) Sugar (lbs/gal) cream (gal/gal) Profit ($/gal) chocolate vanilla banana $1.00 $0.90 $0.95 Kirkman has 180 gal. of milk, 150 lbs. of sugar and 60 gal. of cream available.
44 Linear Programming Problems Continued a) What mi of ice cream flavours will maimize the company s profit. Report your complete solution. b) Using your solution determine the effects of changes in the availability of milk, sugar and cream on the profit. c) What is the most effective way to increase your profit?
45 Workshop Problems - Linear Programming 2. A jeweler makes rings, earrings, pins, and necklaces. She wishes to work no more than 40 hours per week. It takes her 2 hours to make a ring, 2 hours to make a pair of earrings, 1 hour to make a pin and 4 hours to make a necklace. She estimates that she can sell no more than 10 rings, 10 pairs of earrings, 15 pins and 3 necklaces in a single week. he jeweler charges $50 for a ring, $80 for a pair of earrings, $25 for a pin, and $200 for a necklace. She would like to determine how many rings, pairs of earrings, pins and necklaces she should make each week in order to produce the largest possible gross earnings. a) What mi of jewelry will maimize the company s profit. Report your complete solution. b) Using your solution determine the effects of changes in the availability of number of work hours per week, number of hours to required to produce each type of jewelry and the demand for each type of jewelry on the profit. c) What is the most effective way to increase your profit? d) Comment on whether you think it was appropriate to solve this problem with a conventional LP algorithm. hen is an inflection point. Otherwise, if the first higher-order, non-zero derivative is even:
Chapter 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 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 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 informationIntro to Linear Programming. The problem that we desire to address in this course is loosely stated below.
. Introduction Intro to Linear Programming The problem that we desire to address in this course is loosely stated below. Given a number of generators make price-quantity offers to sell (each provides their
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 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 informationLECTURE 13: SOLUTION METHODS FOR CONSTRAINED OPTIMIZATION. 1. Primal approach 2. Penalty and barrier methods 3. Dual approach 4. Primal-dual approach
LECTURE 13: SOLUTION METHODS FOR CONSTRAINED OPTIMIZATION 1. Primal approach 2. Penalty and barrier methods 3. Dual approach 4. Primal-dual approach Basic approaches I. Primal Approach - Feasible Direction
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 information4 Linear Programming (LP) E. Amaldi -- Foundations of Operations Research -- Politecnico di Milano 1
4 Linear Programming (LP) E. Amaldi -- Foundations of Operations Research -- Politecnico di Milano 1 Definition: A Linear Programming (LP) problem is an optimization problem: where min f () s.t. X n the
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 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 informationLinear Mathematical Programming (LP)
Linear Mathematical Programming (LP) A MP is LP if : The objective function is linear where The set is defined by linear equality or inequality constraints c f T ) = ( ],..., [ n T c c c = = n b A where
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 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 informationLinear Programming. Revised Simplex Method, Duality of LP problems and Sensitivity analysis
Linear Programming Revised Simple Method, Dualit of LP problems and Sensitivit analsis Introduction Revised simple method is an improvement over simple method. It is computationall more efficient and accurate.
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 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 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 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 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 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 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 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 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 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 informationContents. I Basics 1. Copyright by SIAM. Unauthorized reproduction of this article is prohibited.
page v Preface xiii I Basics 1 1 Optimization Models 3 1.1 Introduction... 3 1.2 Optimization: An Informal Introduction... 4 1.3 Linear Equations... 7 1.4 Linear Optimization... 10 Exercises... 12 1.5
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 informationMatrix Representations
CONDENSED LESSON 6. Matri Representations In this lesson, ou Represent closed sstems with transition diagrams and transition matrices Use matrices to organize information Sandra works at a da-care center.
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 informationChapter 4 Section 1 Graphing Linear Inequalities in Two Variables
Chapter 4 Section 1 Graphing Linear Inequalities in Two Variables Epressions of the tpe + 2 8 and 3 > 6 are called linear inequalities in two variables. A solution of a linear inequalit in two variables
More informationChapter 3: Towards the Simplex Method for Efficient Solution of Linear Programs
Chapter 3: Towards the Simplex Method for Efficient Solution of Linear Programs The simplex method, invented by George Dantzig in 1947, is the basic workhorse for solving linear programs, even today. While
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 informationAn introduction to pplex and the Simplex Method
An introduction to pplex and the Simplex Method Joanna Bauer Marc Bezem Andreas Halle November 16, 2012 Abstract Linear programs occur frequently in various important disciplines, such as economics, management,
More informationSimplex Method. Introduction:
Introduction: Simple Method In the previous chapter, we discussed about the graphical method for solving linear programming problems. Although the graphical method is an invaluable aid to understand the
More informationDiscuss mainly the standard inequality case: max. Maximize Profit given limited resources. each constraint associated to a resource
Sensitivity Analysis Discuss mainly the standard inequality case: ma s.t. n a i, z n b, i c i,, m s.t.,,, n ma Maimize Profit given limited resources each constraint associated to a resource Alternate
More informationThese notes are in two parts: this part has topics 1-3 above.
IEEM 0: Linear Programming and Its Applications Outline of this series of lectures:. How can we model a problem so that it can be solved to give the required solution 2. Motivation: eamples of typical
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 informationCSE 460. Today we will look at" Classes of Optimization Problems" Linear Programming" The Simplex Algorithm"
CSE 460 Linear Programming" Today we will look at" Classes of Optimization Problems" Linear Programming" The Simplex Algorithm" Classes of Optimization Problems" Optimization" unconstrained"..." linear"
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 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 informationIntroduction to Optimization
Introduction to Optimization Constrained Optimization Marc Toussaint U Stuttgart Constrained Optimization General constrained optimization problem: Let R n, f : R n R, g : R n R m, h : R n R l find min
More informationFebruary 10, 2005
15.053 February 10, 2005 The Geometry of Linear Programs the geometry of LPs illustrated on DTC Announcement: please turn in homework solutions now with a cover sheet 1 Goal of this Lecture 3 mathematical
More informationSolutions for Operations Research Final Exam
Solutions for Operations Research Final Exam. (a) The buffer stock is B = i a i = a + a + a + a + a + a 6 + a 7 = + + + + + + =. And the transportation tableau corresponding to the transshipment problem
More informationDesign and Analysis of Algorithms (V)
Design and Analysis of Algorithms (V) An Introduction to Linear Programming Guoqiang Li School of Software, Shanghai Jiao Tong University Homework Assignment 2 is announced! (deadline Apr. 10) Linear Programming
More informationSection Notes 4. Duality, Sensitivity, and the Dual Simplex Algorithm. Applied Math / Engineering Sciences 121. Week of October 8, 2018
Section Notes 4 Duality, Sensitivity, and the Dual Simplex Algorithm Applied Math / Engineering Sciences 121 Week of October 8, 2018 Goals for the week understand the relationship between primal and dual
More informationChapter 7. Linear Programming Models: Graphical and Computer Methods
Chapter 7 Linear Programming Models: Graphical and Computer Methods To accompany Quantitative Analysis for Management, Eleventh Edition, by Render, Stair, and Hanna Power Point slides created by Brian
More information4.1 The original problem and the optimal tableau
Chapter 4 Sensitivity analysis The sensitivity analysis is performed after a given linear problem has been solved, with the aim of studying how changes to the problem affect the optimal solution In particular,
More informationSelected Topics in Column Generation
Selected Topics in Column Generation February 1, 2007 Choosing a solver for the Master Solve in the dual space(kelly s method) by applying a cutting plane algorithm In the bundle method(lemarechal), a
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 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 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 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 informationECE 307- Techniques for Engineering Decisions
ECE 307- echniques for Engineering Decisions Dualit Concepts in Linear Programming George Gross Department of Electrical and Computer Engineering Universit of Illinois at Urbana-Champaign ECE 307 2006
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 informationCME307/MS&E311 Theory Summary
CME307/MS&E311 Theory Summary Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/~yyye http://www.stanford.edu/class/msande311/
More information1.1 What is Microeconomics?
1.1 What is Microeconomics? Economics is the study of allocating limited resources to satisfy unlimited wants. Such a tension implies tradeoffs among competing goals. The analysis can be carried out at
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 informationChapter 3 Path Optimization
Chapter 3 Path Optimization Background information on optimization is discussed in this chapter, along with the inequality constraints that are used for the problem. Additionally, the MATLAB program for
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 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 information5 The Theory of the Simplex Method
5 The Theory of the Simplex Method Chapter 4 introduced the basic mechanics of the simplex method. Now we shall delve a little more deeply into this algorithm by examining some of its underlying theory.
More informationSupplemental Problems MAT (Prepared by Prof. Urmi Ghosh-Dastidar)
Supplemental Problems MAT 3770 (Prepared by Prof. Urmi Ghosh-Dastidar) 1. Use Lagrange Multiplier methods to find the stationary values of z: (a) z = y, subject to + y = (b) z = (y+4), subject to + y =
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 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 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 informationCME307/MS&E311 Optimization Theory Summary
CME307/MS&E311 Optimization Theory Summary Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/~yyye http://www.stanford.edu/class/msande311/
More informationDM6 Support Vector Machines
DM6 Support Vector Machines Outline Large margin linear classifier Linear separable Nonlinear separable Creating nonlinear classifiers: kernel trick Discussion on SVM Conclusion SVM: LARGE MARGIN LINEAR
More informationHossein Arsham Johns Hopkins University, USA M. Bardossy University of Baltimore, USA D. K. Sharma University of Baltimore, USA This chapter provides a critical overview of Linear Programming (LP) from
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 informationLinear Programming. Linear Programming. Linear Programming. Example: Profit Maximization (1/4) Iris Hui-Ru Jiang Fall Linear programming
Linear Programming 3 describes a broad class of optimization tasks in which both the optimization criterion and the constraints are linear functions. Linear Programming consists of three parts: A set of
More informationGeorge B. Dantzig Mukund N. Thapa. Linear Programming. 1: Introduction. With 87 Illustrations. Springer
George B. Dantzig Mukund N. Thapa Linear Programming 1: Introduction With 87 Illustrations Springer Contents FOREWORD PREFACE DEFINITION OF SYMBOLS xxi xxxiii xxxvii 1 THE LINEAR PROGRAMMING PROBLEM 1
More informationLagrange multipliers. Contents. Introduction. From Wikipedia, the free encyclopedia
Lagrange multipliers From Wikipedia, the free encyclopedia In mathematical optimization problems, Lagrange multipliers, named after Joseph Louis Lagrange, is a method for finding the local extrema of a
More informationLinear Programming Applications. Software for Linear Programming
Linear Programming Applications Software for Linear Programming Objectives Use of software to solve LP problems MMO Software with eample Graphical Method Simple Method Simple method using optimization
More informationRecap, and outline of Lecture 18
Recap, and outline of Lecture 18 Previously Applications of duality: Farkas lemma (example of theorems of alternative) A geometric view of duality Degeneracy and multiple solutions: a duality connection
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 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 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 informationSection Graphing Systems of Linear Inequalities
Section 3.1 - Graphing Systems of Linear Inequalities Example 1: Find the graphical solution of the inequality y x 0. Example 2: Find the graphical solution of the inequality 5x 3y < 15. 1 Example 3: Determine
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 informationMath Introduction to Operations Research
Math 300 Introduction to Operations Research Examination (50 points total) Solutions. (6 pt total) Consider the following linear programming problem: Maximize subject to and x, x, x 3 0. 3x + x + 5x 3
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 informationCMPSCI611: The Simplex Algorithm Lecture 24
CMPSCI611: The Simplex Algorithm Lecture 24 Let s first review the general situation for linear programming problems. Our problem in standard form is to choose a vector x R n, such that x 0 and Ax = b,
More informationI will illustrate the concepts using the example below.
Linear Programming Notes More Tutorials at www.littledumbdoctor.com Linear Programming Notes I will illustrate the concepts using the example below. A farmer plants two crops, oats and corn, on 100 acres.
More informationIntroduction. Chapter 1
Chapter 1 Introduction Nothing happens in the universe that does not have a sense of either certain maimum or minimum. L. Euler, Swiss Mathematician and Physicist, 1707 1783 ptimization is a fundamental
More information1. Given a range of foods to choose from, what is the diet of lowest cost that meets an individual s nutritional requirements?
Chapter 1 Introduction Nothing happens in the universe that does not have a sense of either certain maimum or minimum. L. Euler, Swiss Mathematician and Physicist, 1707 1783 ptimization is a fundamental
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 18 All-Integer Dual Algorithm We continue the discussion on the all integer
More informationIn other words, we want to find the domain points that yield the maximum or minimum values (extrema) of the function.
1 The Lagrange multipliers is a mathematical method for performing constrained optimization of differentiable functions. Recall unconstrained optimization of differentiable functions, in which we want
More informationChapter 4 Linear Programming
Chapter Objectives Check off these skills when you feel that you have mastered them. From its associated chart, write the constraints of a linear programming problem as linear inequalities. List two implied
More informationSolutions to assignment 3
Math 9 Solutions to assignment Due: : Noon on Thursday, October, 5.. Find the minimum of the function f, y, z) + y + z subject to the condition + y + z 4. Solution. Let s define g, y, z) + y + z, so the
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 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 informationPrograms. Introduction
16 Interior Point I: Linear Programs Lab Objective: For decades after its invention, the Simplex algorithm was the only competitive method for linear programming. The past 30 years, however, have seen
More informationApplied Lagrange Duality for Constrained Optimization
Applied Lagrange Duality for Constrained Optimization Robert M. Freund February 10, 2004 c 2004 Massachusetts Institute of Technology. 1 1 Overview The Practical Importance of Duality Review of Convexity
More informationMATLAB Simulink Modeling and Simulation of Recurrent Neural Network for Solving Linear Programming Problems
International Conference on Mathematical Computer Engineering - ICMCE - 8 MALAB Simulink Modeling and Simulation of Recurrent Neural Network for Solving Linear Programming Problems Raja Das a a School
More informationModule 4 Lecture Notes 1. Use of software for solving linear programming problems
Optimization Methods: Linear Programming Applications Software Module 4 Lecture Notes Use of software for solving linear programming problems Introduction In this class, use of software to solve linear
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 informationPRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR PROGRAMMING. 1. Introduction
PRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR PROGRAMMING KELLER VANDEBOGERT AND CHARLES LANNING 1. Introduction Interior point methods are, put simply, a technique of optimization where, given a problem
More informationConstrained Optimization
Constrained Optimization Dudley Cooke Trinity College Dublin Dudley Cooke (Trinity College Dublin) Constrained Optimization 1 / 46 EC2040 Topic 5 - Constrained Optimization Reading 1 Chapters 12.1-12.3
More informationJournal of Business & Economics Research November, 2009 Volume 7, Number 11
Alternate Solutions Analysis For Transportation Problems Veena Adlakha, University of Baltimore, USA Krzysztof Kowalski, Connecticut Department of Transportation, USA ABSTRACT The constraint structure
More informationA9.1 Linear programming
pplications 9. Linear programming 9. Linear programming efore ou start You should be able to: show b shading a region defined b one or more linear inequalities. Wh do this? Linear programming is an eample
More information