# Linear Programming: Theory and Applications

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Linear Programming: Theory and Applications Catherine Lewis May 11,

2 Contents 1 Introduction to Linear Programming What is a linear program? Assumptions Manipulating a Linear Programming Problem The Linear Algebra of Linear Programming Convex Sets and Directions Examples from Bazaraa et. al. and Winston Examples Discussion The Theory Behind Linear Programming Definitions The General Representation Theorem An Outline of the Proof 20 5 Examples With Convex Sets and Extreme Points From Bazaara et. al Tools for Solving Linear Programs Important Precursors to the Simplex Method The Simplex Method In Practice 25 8 What if there is no initial basis in the Simplex tableau? The Two-Phase Method The Big-M Method Cycling The Lexicographic Method Bland s Rule Theorem from [2] Which Rule to Use? Sensitivity Analysis An Example Sensitivity Analysis for a cost coefficient

3 Sensitivity Analysis for a right-hand-side value Case Study: Busing Children to School The Problem The Solution Variables Objective Function Constraints The Complete Program Road Construction and Portables Construction Portable Classrooms Keeping Neighborhoods Together The Case Revisited Shadow Prices The New Result Conclusion 57 2

4 1 Introduction to Linear Programming Linear programming was developed during World War II, when a system with which to maximize the efficiency of resources was of utmost importance. New war-related projects demanded attention and spread resources thin. Programming was a military term that referred to activities such as planning schedules efficiently or deploying men optimally. George Dantzig, a member of the U.S. Air Force, developed the Simplex method of optimization in 1947 in order to provide an efficient algorithm for solving programming problems that had linear structures. Since then, experts from a variety of fields, especially mathematics and economics, have developed the theory behind linear programming and explored its applications [1]. This paper will cover the main concepts in linear programming, including examples when appropriate. First, in Section 1 we will explore simple properties, basic definitions and theories of linear programs. In order to illustrate some applications of linear programming, we will explain simplified real-world examples in Section 2. Section 3 presents more definitions, concluding with the statement of the General Representation Theorem (GRT). In Section 4, we explore an outline of the proof of the GRT and in Section 5 we work through a few examples related to the GRT. After learning the theory behind linear programs, we will focus methods of solving them. Section 6 introduces concepts necessary for introducing the Simplex algorithm, which we explain in Section 7. In Section 8, we explore the Simplex further and learn how to deal with no initial basis in the Simplex tableau. Next, Section 9 discusses cycling in Simplex tableaux and ways to counter this phenomenon. We present an overview of sensitivity analysis in Section 10. Finally, we put all of these concepts together in an extensive case study in Section What is a linear program? We can reduce the structure that characterizes linear programming problems (perhaps after several manipulations) into the following form: 3

5 Minimize c 1 x 1 + c 2 x c n x n = z Subject to a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b a m1 x 1 + a m2 x a mn x n = b m x 1, x 2,..., x n 0. In linear programming z, the expression being optimized, is called the objective function. The variables x 1, x 2... x n are called decision variables, and their values are subject to m + 1 constraints (every line ending with a b i, plus the nonnegativity constraint). A set of x 1, x 2... x n satisfying all the constraints is called a feasible point and the set of all such points is called the feasible region. The solution of the linear program must be a point (x 1, x 2,..., x n ) in the feasible region, or else not all the constraints would be satisfied. The following example from Chapter 3 of Winston [3] illustrates that geometrically interpreting the feasible region is a useful tool for solving linear programming problems with two decision variables. The linear program is: Minimize 4x 1 + x 2 = z Subject to 3x 1 + x 2 10 x 1 + x 2 5 x 1 3 x 1, x 2 0. We plotted the system of inequalities as the shaded region in Figure 1. Since all of the constraints are greater than or equal to constraints, the shaded region above all three lines is the feasible region. The solution to this linear program must lie within the shaded region. Recall that the solution is a point (x 1, x 2 ) such that the value of z is the smallest it can be, while still lying in the feasible region. Since z = 4x 1 + x 2, plotting the line x 1 = (z x 2 )/4 for various values of z results in isocost lines, which have the same slope. Along these lines, the value of z is constant. In Figure 1, the dotted lines represent isocost lines for different values of z. Since isocost lines are parallel to each other, the thick dotted isocost line for which z = 14 is clearly the line that intersects the feasible region at the smallest possible value for z. Therefore, z = 14 is the smallest possible value of z given 4

6 the constraints. This value occurs at the intersection of the lines x 1 = 3 and x 1 + x 2 = 5, where x 1 = 3 and x 2 = 2. Figure 1: The shaded region above all three solid lines is the feasible region (one of the constraints does not contribute to defining the feasible region). The dotted lines are isocost lines. The thick isocost line that passes through the intersection of the two defining constraints represents the minimum possible value of z = 14 while still passing through the feasible region Assumptions Before we get too focused on solving linear programs, it is important to review some theory. For instance, several assumptions are implicit in linear programing problems. These assumptions are: 1. Proportionality The contribution of any variable to the objective function or constraints is proportional to that variable. This implies no dis- 5

7 counts or economies to scale. For example, the value of 8x 1 is twice the value of 4x 1, no more or less. 2. Additivity The contribution of any variable to the objective function or constraints is independent of the values of the other variables. 3. Divisibility Decision variables can be fractions. However, by using a special technique called integer programming, we can bypass this condition. Unfortunately, integer programming is beyond the scope of this paper. 4. Certainty This assumption is also called the deterministic assumption. This means that all parameters (all coefficients in the objective function and the constraints) are known with certainty. Realistically, however, coefficients and parameters are often the result of guess-work and approximation. The effect of changing these numbers can be determined with sensitivity analysis, which will be explored later in Section 9 [3]. 1.3 Manipulating a Linear Programming Problem Many linear problems do not initially match the canonical form presented in the introduction, which will be important when we consider the Simplex algorithm. The constraints may be in the form of inequalities, variables may not have a nonnegativity constraint, or the problem may want to maximize z instead of minimize z. We now consider some ways to manipulate problems into the desired form. Constraint Inequalities We first consider the problem of making all constraints of a linear programming problem in the form of strict equalities. By introducing new variables to the problem that represent the difference between the left and the right-hand sides of the constraints, we eliminate this concern. Subtracting a slack variable from a greater than or equal to constraint or by adding an excess variable to a less than or equal to constraint, transforms inequalities into equalities. For example, the constraint 4x 1 + x 2 3 becomes 4x 1 + x 2 + e 1 = 3 with the addition of e 1 0. If the constraint were originally 4x 1 + x 2 3, the additional surplus variable s 1 must be subtracted (4x 1 + x 2 s 1 = 3) so that s 1 can be a strictly nonnegative variable. URS Variables If a variable can be negative in the context of a linear programming problem it is called a urs (or unrestricted in sign ) variable. By 6

8 replacing this variable x j with x j x j where x j, x j 0, the problem fits the canonical form. Minimization/Maximization If needed, converting a maximization problem to a minimization problem is quite simple. Given that z is an objective function for a maximization problem max z = min ( z). 1.4 The Linear Algebra of Linear Programming The example of a canonical linear programming problem from the introduction lends itself to a linear algebra-based interpretation. As a reminder, the form of a canonical problem is: Minimize c 1 x 1 + c 2 x c n x n = z Subject to a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b a m1 x 1 + a m2 x a mn x n = b m x 1, x 2,..., x n 0. By applying some basic linear algebra, this problem becomes: Minimize Subject to n j=1 c jx j = z n j=1 a jx j = b x j 0 j = 1, 2,..., n. or, more compactly, Minimize cx = z Subject to Ax = b x 0, Here A is an mxn matrix whose j th column is a j. This matrix corresponds to the coefficients on x 1, x 2,..., x n in the constraints of a linear programming 7

9 problem. The vector x is a vector of solutions to the problem, b is the righthand-side vector, and c is the cost coefficient vector. This more compact way of thinking about linear programming problems is useful especially in sensitivity analysis, which will be discussed in Section Convex Sets and Directions This section defines important terms related to the feasible region of a linear program. Definition 1.1. A set X R is a convex set if given any two points x 1 and x 2 in X, any convex combination of these two points is also in X. That is, λx 1 + (1 λ)x 2 X for any λ [0, 1] [2]. See Figure 4 for an example of a convex set. A set X is convex if the line segment connecting any two points in X is also contained in X. If any part of the line segment not in X, then X is said to be nonconvex. Figure 2 shows an example of a nonconvex set and a convex set. The feasible region of a linear program is always a convex set. To see why this makes sense, consider the 2-dimensional region outlined on the axes in Figure 3. This region is nonconvex. In linear programming, this region could not occur because (from Figure 3) y mx + h for c x d but y b for d < x e. The constraint y mx + h doesn t hold when d < x e and the constraint y b doesn t hold when 0 x d. These sorts of conditional constraints do not occur in linear programming. A constraint cannot be valid on one region and invalid on another. A B 1 2 Figure 2: Set 1 is an example of a nonconvex set and set 2 is an example of a convex set. The endpoints of line segment AB are in set 1, yet the entire line is not contained in set 1. No such line segment is possible in set 2. 8

10 Figure 3: A nonconvex (and therefore invalid) feasible region. Definition 1.2. A point x in a convex set X is called an extreme point of X if x cannot be represented as a strict convex combination of two distinct points in X [2]. A strict convex combination is a convex combination for which λ (0, 1). Graphically, an extreme point is a corner point. We will not prove this fact rigorously. In two dimensions, two constraints define an extreme point at their intersection. Further, if two points x and x make up a strict convex combination that equals x, then all three of these points must be defined by the same constraints, or else they could not be colinear. However, if two constraints define x at their intersection, then x is unique, since two lines can only intersect once (or not at all). Since this intersection is unique, yet all three points must lie on both constraints, x = x = x. Therefore, the strict convex combination can t exist and hence corner points and extreme points are equivalent. Definition 1.3. Given a convex set, a nonzero vector d is a direction of the set if for each x 0 in the set, the ray {x 0 + λd : λ 0} also belongs to the set. Definition 1.4. An extreme direction of a convex set is a direction of the set that cannot be represented as a positive combination of two distinct directions of the set. 9

11 Figure 4: A bounded set with 4 extreme points. This set is bounded because there are no directions. Also, the extreme point (2, 1) is a degenerate extreme point because it is the intersection of 3 constraints, but the feasible region is only two-dimensional. In general, an extreme point is degenerate if the number of intersecting constraints at that point is greater than the dimension of the feasible region. Examples of a direction and an extreme direction can be seen in Figure 5. We need all of these definitions to state the General Representation Theorem, a building-block in linear programming. The General Representation Theorem states that every point in a convex set can be represented as a convex combination of extreme points, plus a nonnegative linear combination of extreme directions. This theorem will be discussed more later. 10

12 Figure 5: The shaded region in this figure is an unbounded convex set. Point A is an example of an extreme point, vector B is an example of a direction of the set and vector C is an example of an extreme direction of the set. 2 Examples from Bazaraa et. al. and Winston The following examples deal with interpreting a word problem and setting up a linear program. 2.1 Examples 1. Consider the problem of locating a new machine to an existing layout consisting of four machines. These machines are located at the following (x, y) coordinates: (3, 0), (0, 3), ( 2, 1), and (1, 4). Let the coordinates of the new machine be (x 1, x 2 ). Formulate the problem of finding an optimal location as a linear program if the sum of the distances from the new machine to the existing four machines is minimized. Use street distance; for example, the distance from (x 1, x 2 ) to the first machine at 11

13 (3, 0) is x x 2. This means that the distance is not defined by the length of a line between two points, rather it is the sum of the lengths of the horizontal and vertical components of such a line. Solution Since absolute value signs cannot be included in a linear program, recall that: x = max {x, x}. With this in mind, the following linear program models the problem: Minimize z = (P 1 + P 2 ) + (P 3 + P 4 ) + (P 5 + P 6 ) + (P 7 + P 8 ) Subject to P 1 (x 1 3) P 1 x 1 3 P 2 (x 2 ) P 2 x 2 P 3 (x 1 1) P 3 x 1 1 P 4 (x 2 4) P 4 x 2 4 P 5 (x 1 + 2) P 5 x P 6 (x 2 1) P 6 x 2 1 P 7 (x 1 ) P 7 x 1 P 8 (x 2 + 3) P 8 x all variables 0. Each P 2i 1 represents the horizontal distance between the new machine and the i th old machine for i = 1, 2, 3, 4. Also for i = 1, 2, 3, 4, P 2i represents the vertical distance between the new machine and the i th old machine. The objective function reflects the desire to minimize total distance between the new machine and all the others. The constraints relate the P variables to the distances in terms of x 1 and x 2. Two constraints for each P variable allow each P i (i = 1, 2,..., 8) to equal the maximum 12

14 of x j c j and (x j c j ) (for j = 1, 2 and where c is the j th component of the position of one of the old machines). Since this program is a minimization problem and the smallest any of the variables can be is max {(x j c j ), (x j c j )}, each P i will naturally equal its least possible value. This value will be the absolute value of x j c j. In the next problem we will also interpret a real-world situation as a linear program. Perhaps the most notable aspect of this problem is the concept of inventory and recursion in constraints. 2. A company is opening a new franchise and wants to try minimizing their quarterly cost using linear programming. Each of their workers gets paid \$500 per quarter and works 3 contiguous quarters per year. Additionally, each worker can only make 50 pairs of shoes per quarter. The demand (in pairs of shoes) is 600 for quarter 1, 300 for quarter 2, 800 for quarter 3, and 100 for quarter 4. Pairs of shoes may be put in inventory, but this costs \$50 per quarter per pair of shoes, and inventory must be empty at the end of quarter 4. Solution defined. If we let In order to minimize the cost per year, decision variables are P t number of pairs of shoes during quarter t, t = 1, 2, 3, 4 W t number of workers starting work in quarter t, t = 1, 2, 3, 4 I t number of pairs of shoes in inventory after quarter t, t = 1, 2, 3, 4, the objective function is therefore min z = 50I I I W W W W 4. Since each worker works three quarters they must be payed three times their quarterly rate. The objective function takes into account the salary paid to the workers, as well as inventory costs. Next, demand for shoes must be considered. The following constraints account for demand: 13

15 P I 1 = P I 2 = I 1 + P I 3 = I 2 + P I 4 = I 3 + P = 0. Note these constraints are recursive, meaning they can be defined by the expression: I n = I n1 + P n D n where D n is just a number symbolizing demand for that quarter. Also, the workers can only make 50 pairs of shoes per quarter, which gives us the constraints P 1 50W W W 4 P 2 50W W W 1 P 3 50W W W 2 P 4 50W W W 2 This linear program is somewhat cyclical, since workers starting work in quarter 4 can produce shoes during quarters 1 and 2. It is set up this way in order to promote long-term minimization of cost and to emphasize that the number of workers starting work during each quarter should always be the optimal value, and not vary year to year. The next example is a similar type of problem. Again, decision variable must be identified and constraints formed to meet a certain objective. However, this problem deals with a different real-world situation and it is interesting to see the difference in the structure of the program. In the previous problem, the concepts of inventory and scheduling were key, in the next problem, the most crucial aspect is conservation of matter. This means that several options will be provided concerning how to dispose of waste and all of the waste must be accounted for by the linear program. 3. Suppose that there are m sources that generate waste and n disposal sites. The amount of waste generated at source i is a i and the capacity of site j is b j. It is desired to select appropriate transfer facilities from among K candidate facilities. Potential transfer facility k has fixed cost f k, capacity 14

16 q k and unit processing cost α k per ton of waste. Let c ik and c kj be the unit shipping costs from source i to transfer station k and from transfer station k to disposal site j respectively. The problem is to choose the transfer facilities and the shipping pattern that minimize the total capital and operating costs of the transfer stations plus the transportation costs. Solution As with the last problem, defining variables is the first step. w ik = tons of waste moved from i to k, 1 i m, 1 k K y k = a binary variable that equals 1 when transfer station k is used and 0 otherwise, 1 k K x kj = tons of waste moved from k to j, 1 k K, 1 j n The objective function features several double sums in order to describe all the costs faced in the process of waste disposal. The objective function is: min z = i c ik w ik + k k c kj x kj + j k f k y k + k α k w ik. i The first constraint equates the tons of waste coming from all the sources with the tons of waste going to all the disposal sites. This constraint is w ik = i j x kj. The next constraint says that the amount of waste produced equals the amount moved to all the transfer facilities: w ik = i k a i. Next, there must be a constraint that restricts how much waste is at transfer or disposal sites depending on their capacity. This restriction 15

17 gives: x kj b j and i k w ik q k. Putting these constraints all together, the linear program is: Minimize z = i k c ikw ik + k j c kjx kj + k f ky k + k i α kw ik Subject to i w ik = j x kj k w ik = i a i k x kj b j i w ik q k all variables 0. Most linear program-solving software allows the user to designate certain variables as binary, so ensuring this property of y k would not be an obstacle in solving this problem. 2.2 Discussion Now let s discuss the affects altering a linear program has on the program s feasible region and optimal objective function value. Consider the typical linear program: minimize cx subject to Ax b, x 0. First, suppose that a new variable x n+1 is added to the problem. The feasible region gets larger or stays the same. After the addition of x n+1 the feasible region goes up in dimension. It still contains all of its original points (where x n+1 = 0) but it may now also include more. The optimal objective function value of this program gets smaller or stays the same. Since there are more options in the feasible region, there may be one that more effectively minimizes z. If the new variable is added to z (that is, any positive value of that variable would make z larger), then that variable will equal 0 at optimality. Now, suppose that one component of the vector b, say b i, is increased by one unit to b i +1. The feasible region gets smaller or stays the same. To see this more clearly, let y symbolize the row vector of coefficients of the constraint to which 1 was added. The new feasible region is everything from the old feasible region except points that satisfy the constraint b i y x < b i + 1. This is either a positive number or zero, so therefore the feasible region gets smaller or stays 16

18 the same. The optimal objective of this new program gets larger or stays the same. To satisfy the new constraint, the variables in that constraint may have to increase in value. This increase may in turn increase the value of the objective function. In general, when changes are made in the program to increase the size of the feasible region, the optimal objective value either stays the same, or becomes more optimal (smaller for a minimization problem, or larger for a maximization problem). This is because a larger feasible region presents more choices, one of which may be better than the previous result. Conversely, when a feasible region decreases in size, the optimal objective value either stays the same, or becomes less optimal. 3 The Theory Behind Linear Programming 3.1 Definitions Now that several examples, have been presented, it is time to explore the theory behind linear programming more thoroughly. The climax of this chapter will be the General Representation Theorem and to reach this end, more definitions and theorems are necessary. Definition 3.1. A hyperplane H in R n is a set of the form {x : px = k} where p is a nonzero vector in R n and k is a scalar. For example, {(x 1, x 2 ) : (1, 0) (x 1, x 2 ) = 2} is a hyperplane in R 2. After completing the dot product, it turns out that this is just the line x 1 = 2 which can be plotted on the x 1 x 2 -plane. A hyperplane in three dimensions is a traditional plane, and in two dimensions it is a line. The purpose of this definition is to generalize the idea of a plane to more dimensions. Definition 3.2. A halfspace is a collection of points of the form {x : px k} or {x : px k}. Consider the two-dimensional halfspace {(x 1, x 2 ) : (1, 0) (x 1, x 2 ) 2}. After completing the dot product, it is clear that this halfspace describes the region where x 1 2. On the x 1, x 2 plane, this would be everything to the left of the hyperplane x 1 = 2. A halfspace in R 2 is everything on one side of a line and, similarly, in R 3 a halfspace is everything on one side of a a plane. 17

19 Definition 3.3. A polyhedral set is the intersection of a finite number of halfspaces. It can be written in the form {x : Ax b} where A is an m n matrix (where m and n are integers). Every polyhedral set is a convex set. See Figure 6 for an example of a polyhedral set. A proper face of a polyhedral set X is a set of points that corresponds to some nonempty set of binding defining hyperplanes of X. Therefore, the highest dimension of a proper face of X is equal to dim(x)-1. An edge of a polyhedral set is a one-dimensional face of X. Extreme points are zero-dimensional faces of X, which basically summarizes the next big definition: Figure 6: This pup tent is an example of a polyhedral set in R 3. Point A is an extreme point because it is defined by three halfspaces: everything behind the plane at the front of the tent, and everything below the two planes defining the sides of the tent. The line segment from A to B is called an edge of the polyhedral set. Set C is a set of points that forms a two-dimensional proper face of the pup tent. Definition 3.4. Let X R n, where n is an integer. A point x X is said to be an extreme point of set X if x lies on some n linearly independent defining 18

20 hyperplanes of X. Earlier, an extreme point was said to be a corner point of a feasible region in two dimensions. The previous definition states the definition of an extreme point more formally and generalizes it for more than two dimensions. All of the previous definitions are for the purpose of generalizing the idea of a feasible region to more than two-dimensions. The feasible region will always be a polyhedral set, which, according to the definition, is a convex set in n dimensions. The terminology presented in these definitions is used in the statement and proof of the General Representation Theorem, which is covered in the next section. 3.2 The General Representation Theorem One of the most important (and difficult) theorems in linear programming is the General Representation Theorem. This theorem not only provides a way to represent any point in a polyhedral set, but its proof also lays the groundwork for understanding the Simplex method, a basic tool for solving linear programs. Theorem 3.1. The General Representation Theorem: Let X = {x : Ax b, x 0} be a nonempty polyhedral set. Then the set of extreme points is not empty and is finite, say {x 1, x 2,..., x k }. Furthermore, the set of extreme directions is empty if and only if X is bounded. If X is not bounded, then the set of extreme directions is nonempty and is finite, say {d 1, d 2,..., d l }. Moreover, x X if and only if it can be represented as a convex combination of x 1, x 2,..., x k plus a nonnegative linear combination of d 1, d 2,..., d l, that is, k l x = λ j x j + µ j d j j=1 j=1 k λ j = 1, j=1 λ j 0, j = 1, 2,..., k µ j 0, j = 1, 2,..., l. In sum, by visualizing an unbounded polyhedral set in two-dimensions, it is clear that any point in between extreme points can be represented as a convex combination of those extreme points. Any other point can be represented as 19

21 one of these convex combinations, plus a combination of multiples of extreme directions. This theorem is called general since it applies to either a bounded polyhedral set (in the case that µ j = 0 for all j) or an unbounded polyhedral set. 4 An Outline of the Proof The General Representation Theorem (GRT) has four main parts. First, it states that the number of extreme points in X is nonempty and finite. Next, if X is bounded then the set of extreme directions of X is empty. Further, if X is not bounded, then the set of extreme directions is nonempty and finite. Finally, the GRT states that x X if and only if it can be represented as a convex combination of extreme points of X and a nonnegative linear combination of extreme directions of X. We will explore the proofs of these parts in sequence. Since the last part of the GRT is a if and only if theorem, it must be proven both ways. Proving that if a point x can be represented as a convex combination of extreme points of a set X, plus a combination of multiples of extreme directions of X, then x X (the backward proof), is simple. Before we do that, however, we must prove the first two parts of the GRT: First, we want to prove that there are a finite number of extreme points in the set X. We do this by moving along extreme directions until reaching a point that has n linearly independent defining hyperplanes, where n is just an integer. Thus there is at least 1 extreme point. Furthermore, ( ) m+n n is finite, so the number of extreme points is finite. Prove that there are a finite number of extreme directions in the set X. The argument here is similar to proving that there are a finite number of extreme points. Next, the backwards proof: Given: X = {x : Ax b x 0} is a nonempty polyhedral set. The set of extreme points of X is not empty and has a finite number of points, say x 1, x 2,..., x k. The set of extreme directions is either empty (if X is bounded) or has a finite number of vectors, say d 1, d 2,..., d l. There is a point x that can be written as in Equation GRT. Want to Prove: x X. 20

22 First, remember that A x b if x X. From the assumptions: A x = k λ j Ax j + j=1 l µ j Ad j. It is clear that k j=1 Ax j is less than b (since each x j is in X) and therefore k j=1 λ jax j b since k j=1 λ j = 1. But what about l j=1 µ jad j? From the definition of extreme directions, d is a direction of set X if for each x in X, the ray {x + λd : λ 0} also belongs to the set. From this definition, there are two restrictions on d: j=1 A(x + λd) b x + λd 0 (1) for each λ 0 and each x X. The first inequality must hold for arbitrarily large λ, so therefore Ad must be less than or equal to 0. From the same reasoning, since x + λd can never be negative, no matter how big λ gets, it follows that d 0 and d 0 (since x could have negative components). Therefore d > 0. From this information, it is clear that l j=1 µ jad j is less than 0. Therefore, A x is the sum of two sums, one of which is less than or equal to b and one of which is less than 0. Therefore, A x b. Next, x must be nonnegative. Since x is the sum of the products of all positive numbers, this must be true. Therefore, if we can write x in the form of the GRT then x X. The forward proof of the GRT states that, if x X, then a point x can be represented as a convex combination of extreme points of a set X, plus a combination of multiples of extreme directions of X. Since the proof of the GRT in the forward direction is quite complicated, it will not be proven carefully. The following outline provides a summary of the steps involved with the proof of the forward direction: Define a bounded set that adds another constraint on to the original set X. Show that x can be written as a convex combination of extreme points in that set. 21

23 Define the extreme directions of X as the vectors created by subtracting the old extreme points (of X) from the newly created extreme points (of the new bounded set). Write a point in X in terms of the extreme directions and evaluate the aforementioned convex combination in terms of this expression. The last step ends the proof by giving an expression that looks like the result of the GRT. Even though this outline is not rigorous proof by any means, it still helps enhance understanding of the GRT. Figure 7 illustrates the GRT for a specific polyhedral set. It is from [2]. 5 Examples With Convex Sets and Extreme Points From Bazaara et. al. In the previous section, the General Representation Theorem concluded a theoretical overview of convex sets and their properties. Now it is time to apply this knowledge to a few examples. Let s see how a specific point in a specific convex set can be represented as a convex combination of extreme points. We will consider an example concerning the region X={(x 1, x 2 ) : x 1 x 2 3, 2x 1 + x 2 4, x 1 3} shown in Figure 8. We will find all the extreme points of X and express x = (0, 1) as a convex combination of the extreme points. There are 3 extreme points, which are the pairwise intersections of the constraints when they are binding. Two of these points are on the line x 1 = 3 and these points are ( 3, 6) and ( 3, 10). In Figure 8 these points are B and C respectively. Point A, ( 7 3, 2 3), is found by solving x1 x 2 = 3 and 2x 1 +x 2 = 4 simultaneously. In order to express (1, 0) as a convex combination of extreme points, it is necessary to solve for λ 1 and λ 2 such that 3λ 1 3λ (1 λ 1 λ 2 ) = 1 6λ λ (1 λ 1 λ 2 ) = 0. This is simply a system of two linear equations with two unknowns and the 22

24 solution λ 1 = and λ 2 = Therefore, the expression 2 7 A B 29 C = (1, 0) 56 is a convex combination of the extreme points that equals (1, 0). We can also use the GRT to show that the feasible region to a linear program in standard form is convex. Consider the linear program: Minimize cx = z Subject to Ax = b x 0 and let C be its feasible region. If y and z C and λ is a real number [0, 1], then we want to show that w = λy + (1 λ)z is greater than zero and that Aw = b. It is clear that w 0 since both terms of w are products of positive numbers. To show the second condition, substitute in for w: Aw = A(λy + (1 λ)z) = λay + Az λaz = λb + b λb = b. This result means that w C. Therefore, C is a convex set. 6 Tools for Solving Linear Programs 6.1 Important Precursors to the Simplex Method Linear programming was developed in order to obtain the solutions to linear programs. Almost always, finding a solution to a linear program is more important than the theory behind it. The most popular method of solving linear programs is called the Simplex algorithm. This section builds the groundwork for understanding the Simplex algorithm. Definition 6.1. Given the system Ax= b and x 0 where A is an m n matrix 23

25 and b is a column vector with m entries. Suppose that rank(a, b)=rank(a)=m. After possibly rearranging the columns of A, let A = [B, N] where B is an m [ m] invertible matrix and N is an m (n m) matrix. The solution x = x B x N to the equations Ax = b where x B = B 1 b and x N = 0 is called a basic solution of the system. If x B 0 then x is called a basic feasible solution of the system. Here B is called the basic matrix and N is called the nonbasic matrix. The components of x B are called basic variables and the components of x N are called nonbasic variables. If x B > 0 then x is a nondegenerate basic solution, but if at least one component of x B is zero then x is a degenerate basic solution [2]. This definition might be the most important one for understanding the Simplex algorithm. The following theorems help tie together the linear algebra and geometry of linear programming. All of these theorems refer to the system Minimize cx Subject to Ax = b x 0. Theorem 6.1. The collection of extreme points corresponds to the collection of basic feasible solutions, and both are nonempty, provided that the feasible region is not empty [2]. Theorem 6.2. If an optimal solution exists, then an optimal extreme point exists [2]. Theorem 6.2 builds on the idea put forward in Theorem 6.1 except this time it addresses optimal points and solutions specifically. In Theorem 6.3, a basis refers to the set of basic variables. Theorem 6.3. For every extreme point there corresponds a basis (not necessarily unique), and, conversely, for every basis there corresponds a (unique) extreme point. Moreover, if an extreme point has more than one basis representing it, then it is degenerate. Conversely, a degenerate extreme point has more than one set of basic variables representing it if and only if the system Ax=b itself does not imply that the degenerate basic variables corresponding to an associated basis are identically zero [2]. All this theorem says is that a degenerate extreme point corresponds to several bases, but each basis represents only one point. 24

26 With all of this information, we might think that the best way to solve a linear programming problem is to find all the extreme points of a system and see which one correctly minimizes (or maximizes) the problem. This is realistic (though ( ) still tedious) for small problems. The number of extreme points is n, where m is the rank of A and n is the number of variables. This m number can be quite large. Also, this method does not indicate if the feasible region is unbounded or empty without first going through the whole set of extreme points. In short, this approach is not realistic. Instead, an ingenious algorithm known as the Simplex method, is the most common way to solve linear programs by hand, and is the basis for most computer software that solves linear programs. In upcoming sections, the Simplex algorithm will be covered, including a discussion of how to manipulate programs with no starting basis. Then, sensitivity analysis will be discussed with examples. Finally, a case study concerning busing children to school will be presented and solved with computer software. 7 The Simplex Method In Practice The Simplex algorithm remedies the shortcomings of the aforementioned brute force approach. Instead of checking all of the extreme points in the region, the Simplex algorithm selects an extreme point at which to start. Then, each iteration of the algorithm takes the system to the adjacent extreme point with the best objective function value. These iterations are repeated until there are no more adjacent extreme points with better objective function values. That is when the system is at optimality. The best way to implement the Simplex algorithm by hand is through tableau form. A linear program can be put in tableau format by creating a matrix with a column for each variable, starting with z, the objective function value, in the far left column. For a general linear program, of the form Maximize cx Subject to Ax b x 0 the initial tableau would look like: 25

27 z c 0 0 A b. The idea here is that z cx = 0 and Ax= b so in this format all the variables can be forgotten and represented only by columns. If we were actually completing the Simplex algorithm for this program, we would be concerned with the lack of an initial basis in the first tableau. If there is no initial basis in the tableau (an mxm identity matrix), then we are not at an extreme point and the program cannot possibly be at optimality (according to Theorem 6.1). The first iteration of the Simplex algorithm selects the column containing the most positive (in a minimization problem) coefficient in the first row (Row 0). Since Row 0 of the tableau corresponds to the objective function value z, the entering basic variable should be one that would decrease the value of z the fastest. This variable corresponds to the column with the most positive objective function coefficient, say, column i. After selecting this variable as the entering basic variable, perform the ratio test. This test consists of dividing all the numbers on the right-hand side of the tableau by their corresponding coefficients in column i. performed in Row 0. This test is not If a number in column i is nonpositive, the ratio test doesn t apply for that row. The row j with the smallest positive ratio is selected. If the ratio test is a tie, the row can be selected arbitrarily between rows with the same valued (smallest) ratios. The ratio test is necessary because it ensures that the right-hand side of the tableau (except perhaps Row 0) will stay positive as the new basic variable enters the basis. The new basic variable selected, say x i, enters the basis in row j. Therefore, through elementary matrix row operations, column i must be transformed into a column of the identity matrix, with the one in the j th row. Through these operations, x i enters the basis and whichever basic variable was in row j leaves the basis. We repeat these steps until there are no longer positive numbers in Row 0 (for a minimization problem). To help clarify these ideas, let s look at an example from [3]: First, let s use the simplex algorithm to find the optimal solution of the 26

28 Table 1: The number with the * next to it is the entering basic variable, in this case x 1. The variable s 1 is the leaving basic variable, since the one in the s 1 column is in Row 1. Row z x 1 x 2 s 1 s 2 RHS BV ratio z = s 1 = 12 4 = s 2 = 6 2 = 3 following LP: min z = 3x 1 + 8x 2 s.t. 4x 1 + 2x x 1 + 3x 2 6 x 1, x 2 0 First this LP must be in standard form. We add slack variables to transform our linear program to min z = 3x 1 + 8x 2 s.t. 4x 1 + 2x 2 + s 1 = 12 2x 1 + 3x 2 + s 2 = 6 x 1, x 2, s 1, s 2 0 The first tableau is shown in Table 1. The rows are labeled 0, 1, and 2. The columns are labeled according to which variable they represent. The column labeled RHS indicates the right-hand side of the equations. The column BV indicates the values of basic variables in that tableau. In the ratio column, we give the ratios used in the ratio test. In Table 1 s 1 and s 2 are the initial basic variables, since their columns are columns from the identity matrix. The number in Row 0 that is most positive is the 3 in the x 1 column. Therefore, x 1 is the entering basic variable. The ratio test (shown in the far right column of Table 1), yields a tie since both ratios are 3. Row 1 is chosen arbitrarily to be the row of the entering basic variable. 27

29 Table 2: This tableaux is optimal since all the values in Row 0 (except for the z column) are nonpositive. Row z x 1 x 2 s 1 s 2 RHS BV ratio z = x 1 = s 2 = 0 - The next tableau is shown in Table 2. This table is obtained after dividing Row 1 of Table 1 by 4, and then adding 3 times Row 1 to Row 0 and 2 times Row 1 to Row 2. The solution shown in Table 2 is optimal because all the numbers (except for the number in the z column, of course) in Row 0 are negative, which means z cannot be decreased anymore. The solution is x 1 = 3, x 2 = s 1 = s 2 = 0 and z = 9. Now that the basics of the Simplex algorithm have been covered, the next section will explain what to do when the initial tableau does not contain an identity matrix. 8 What if there is no initial basis in the Simplex tableau? After learning the basics of the Simplex algorithm, we explore the special cases and exceptions. For example, what does one do when the initial tableau contains no starting basis? That is, what happens if the initial tableau (for a program where A is mxn) does not contain all the columns of an mxm identity matrix? This problem occurs when the constraints are in either equality or greater than or equal to form. In the case of an equality constraint, one cannot add a slack or an excess variable and therefore there will be no initial basic variable in that row. In the case of a greater than or equal to constraint, one must add an excess variable, which gives a 1 in that row instead of a +1. Simply multiplying through that row by 1 would not solve the problem, for then the right-hand-side variable would be negative. There are two main methods to dealing with this problem: the Two-Phase Method and the Big-M Method. Both of these methods involve adding artificial variables that start out as basic variables but must eventually equal zero in 28

30 Table 3: Table 4: order for the original problem to be feasible. These two techniques are outlined in the following sections. 8.1 The Two-Phase Method Consider the following problem: Maximize 2x 1 x 2 + x 3 Subject to 2x 1 + x 2 2x 3 8 4x 1 x 2 + 2x 3 = 2 2x 1 + 3x 2 x 3 4 x 1, x 2, x 3 0. To put this in standard form, all constraints must become equalities. Adding a slack variable, s 1, to the first constraint and subtracting an excess variable, e 3, from the third constraint gives the initial Simplex tableau shown in Table 3. There is no initial basis in this tableau. To correct this, add two more variables, called artificial variables, a 1 and a 3, to constraints two and three. This step alone however, will not solve the problem since these two extra variables cannot be in the final basis. Therefore, in addition to adding two artificial variables, the initial objective function must be altered as well. To ensure that a 1 and a 3 are not in the final basis, the initial objective function must become minimize z = a 1 a 3. Therefore, the tableau shown in Table 3 becomes the tableau shown in Table 4. The last step before performing the Simplex algorithm as usual, is to add rows 2 and 3 to Row 0. This gives the tableau shown in Table 5. The tableau 29

31 Table 5: Table 6: in Table 5 is better because I 3 is in the body of the tableau. The tableau shown in Table 5 is the initial tableau for Phase I of the Two- Phase Method. Phase I will be complete when this tableau is optimal. To get this tableau to optimality takes two steps. The final optimal tableau for Phase I is shown in Table 6. In this tableau the variables a 1 and a 3 are zero and the variables x 1, x 2 and s 1 are basic. For Phase II of the Two-Phase Method, replace the current objective function with the objective function from the original problem and make all entries of Row 0 in the column of a basic variable equal to zero. Also, delete all columns associated with artificial variables. After that, proceed with the Simplex algorithm until optimality is reached. The first tableau for Phase II is shown in the first part of Table 7. After multiplying Row 2 by two, Row 3 by negative one, and adding both of the resultant rows to Row 0, the tableau becomes like the second part of Table 7. After obtaining this tableau, proceed with the Simplex algorithm as usual. Remember, now the objective function must be maximized. The solution to this phase is the solution to the original problem. In summary, the Two-Phase Method can be completed using the following steps: 1. If there is no basis in the original tableau, add artificial variables to rows in which there are no slack variables. 2. Set up a new objective function that minimizes these slack variables. 3. Modify the tableau so that the Row 0 coefficients of the artificial variables are zero. 30

32 Table 7: Complete the Simplex algorithm as usual for a minimization problem. 5. At optimality, the artificial variables should be nonbasic variables, or basic variables equal to zero. If not, the original problem was infeasible. 6. After reaching optimality, delete all rows associated with artificial variables. Also, replace the artificial objective function with the original objective function. This is the start of Phase II. 7. Modify the tableau so that the Row 0 coefficients of the basic variables are zero. 8. Proceed with the Simplex algorithm as usual. The optimal solution to this tableau will be the optimal solution to the original problem. 8.2 The Big-M Method Another way to deal with no basis in the initial tableau is called the Big-M Method. The following example from [2] will help illustrate this method: Consider the problem Minimize x 1 2x 2 Subject to x 1 + x 2 2 x 1 + x 2 1 x 2 3 x 1, x 2 0. Wouldn t it be nice to be able to solve this problem with artificial variables, but without having to complete two phases? Well, the Big-M method makes that possible. 31

33 Table 8: Table 9: M -M M -M -M M M 0 -M 2+M M -2+M M -M First, the initial tableau of this problem is shown in Table 6. After adding artificial variables a 1 and a 2 to rows 1 and 2, the tableau becomes the tableau in the first part of Table 8. Since the artificial variables must go to zero at optimality, there must be a way to force them to do so. By adding Ma 1 + Ma 2 to the objective function, where M is a really big number (near infinity!), it is clear that this minimization problem will be optimal when a 1 and a 2 are zero. For a maximization problem, adding Ma 1 Ma 2 to the objective function produces the same effect. This step is shown in the second part of Table 9. Next, the coefficients in Row 0 must be modified so that they are zero for all basic variables. Therefore, multiply rows 1 and 2 by M and add them to Row 0. The resulting tableau is shown in the third part of Table 9. 32

34 The most positive coefficient in Row 0 is 2 + 2M. Therefore, this column is selected for a pivot and the ratio test is performed as usual. Row 2 wins the ratio test and the next tableau is shown in the fourth part of Table 9. The term 1 + 2M is the most positive so that column is the pivot column. This part of the Big-M Method is just like performing the Simplex Method as usual, except with a variable M floating around. This particular problem continues for a few more steps (two more pivots to be exact) before reaching optimality. The optimal tableau is shown in the fifth part of Table 9, where the solution is x 2 = 3, x 3 = 1, x 4 = 2 and z = 6. In this tableau, there is no M in the objective function value. Also, none of the artificial variables are basic variables. If an artificial variable were a basic variable in the optimal tableau, this would indicate that the the original problem was infeasible. If there were an M in the objective function value, this would indicate that the original problem was unbounded. In summary, the Big-M Method can be completed using the following steps: 1. If there is no basis in the original tableau, add artificial variables to rows in which there are no slack variables. 2. Depending on whether the problem is minimization or maximization, add or subtract Mx a to the objective function where M is a really big number and x a is a vector of the artificial variables. 3. Modify the tableau so that the Row 0 coefficients of the artificial variables are zero. 4. Complete the Simplex algorithm as usual. 5. At optimality, the artificial variables should be nonbasic variables and the objective function value should be finite. 9 Cycling In the case of a degenerate problem, a rare phenomenon occurs when a Simplex tableau iterates through several bases all representing the same solution, only to arrive back at the original tableau. Geometrically, several linearly independent hyperplanes define a certain extreme point, and the Simplex algorithm moves with each pivot to another set of these hyperplanes that represent the same basis, and finally comes back to the beginning set of these hyperplanes and 33

### Chapter 15 Introduction to Linear Programming

Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of

### Special Situations in the Simplex Algorithm

Special Situations in the Simplex Algorithm Degeneracy Consider the linear program: Maximize 2x 1 +x 2 Subject to: 4x 1 +3x 2 12 (1) 4x 1 +x 2 8 (2) 4x 1 +2x 2 8 (3) x 1, x 2 0. We will first apply the

### Chap 4 The Simplex Method

The Essence of the Simplex Method Recall the Wyndor problem Max Z = 3x 1 + 5x 2 S.T. x 1 4 2x 2 12 3x 1 + 2x 2 18 x 1, x 2 0 Chap 4 The Simplex Method 8 corner point solutions. 5 out of them are CPF solutions.

### Quiz 1 Sample Questions IE406 Introduction to Mathematical Programming Dr. Ralphs

Quiz 1 Sample Questions IE406 Introduction to Mathematical Programming Dr. Ralphs These questions are from previous years and should you give you some idea of what to expect on Quiz 1. 1. Consider the

### Section Notes 3. The Simplex Algorithm. Applied Math 121. Week of February 14, 2011

Section Notes 3 The Simplex Algorithm Applied Math 121 Week of February 14, 2011 Goals for the week understand how to get from an LP to a simplex tableau. be familiar with reduced costs, optimal solutions,

### Geometry of Linear Programming

Chapter 2 Geometry of Linear Programming The intent of this chapter is to provide a geometric interpretation of linear programming problems. To conceive fundamental concepts and validity of different algorithms

### Definition of a Linear Program

Definition of a Linear Program Definition: A function f(x 1, x,..., x n ) of x 1, x,..., x n is a linear function if and only if for some set of constants c 1, c,..., c n, f(x 1, x,..., x n ) = c 1 x 1

### CHAPTER 17. Linear Programming: Simplex Method

CHAPTER 17 Linear Programming: Simplex Method CONTENTS 17.1 AN ALGEBRAIC OVERVIEW OF THE SIMPLEX METHOD Algebraic Properties of the Simplex Method Determining a Basic Solution Basic Feasible Solution 17.2

### Chapter 5: Solving General Linear Programs

Chapter 5: Solving General Linear Programs So far we have concentrated on linear programs that are in standard form, which have a maximization objective, all constraints of type, all of the right hand

### Linear Programming for Optimization. Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc.

1. Introduction Linear Programming for Optimization Mark A. Schulze, Ph.D. Perceptive Scientific Instruments, Inc. 1.1 Definition Linear programming is the name of a branch of applied mathematics that

### The Simplex Method. yyye

Yinyu Ye, MS&E, Stanford MS&E310 Lecture Note #05 1 The Simplex Method Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/

### Linear Inequalities and Linear Programming. Systems of Linear Inequalities in Two Variables

Linear Inequalities and Linear Programming 5.1 Systems of Linear Inequalities 5.2 Linear Programming Geometric Approach 5.3 Geometric Introduction to Simplex Method 5.4 Maximization with constraints 5.5

### OPRE 6201 : 2. Simplex Method

OPRE 6201 : 2. Simplex Method 1 The Graphical Method: An Example Consider the following linear program: Max 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2

### 1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.

Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S

### 3 Does the Simplex Algorithm Work?

Does the Simplex Algorithm Work? In this section we carefully examine the simplex algorithm introduced in the previous chapter. Our goal is to either prove that it works, or to determine those circumstances

### The Graphical Simplex Method: An Example

The Graphical Simplex Method: An Example Consider the following linear program: Max 4x 1 +3x Subject to: x 1 +3x 6 (1) 3x 1 +x 3 () x 5 (3) x 1 +x 4 (4) x 1, x 0. Goal: produce a pair of x 1 and x that

### 1 Solving LPs: The Simplex Algorithm of George Dantzig

Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.

### Chapter 3 LINEAR PROGRAMMING GRAPHICAL SOLUTION 3.1 SOLUTION METHODS 3.2 TERMINOLOGY

Chapter 3 LINEAR PROGRAMMING GRAPHICAL SOLUTION 3.1 SOLUTION METHODS Once the problem is formulated by setting appropriate objective function and constraints, the next step is to solve it. Solving LPP

### By W.E. Diewert. July, Linear programming problems are important for a number of reasons:

APPLIED ECONOMICS By W.E. Diewert. July, 3. Chapter : Linear Programming. Introduction The theory of linear programming provides a good introduction to the study of constrained maximization (and minimization)

### Linear Programming. Solving LP Models Using MS Excel, 18

SUPPLEMENT TO CHAPTER SIX Linear Programming SUPPLEMENT OUTLINE Introduction, 2 Linear Programming Models, 2 Model Formulation, 4 Graphical Linear Programming, 5 Outline of Graphical Procedure, 5 Plotting

### SUPPLEMENT TO CHAPTER

SUPPLEMENT TO CHAPTER 6 Linear Programming SUPPLEMENT OUTLINE Introduction and Linear Programming Model, 2 Graphical Solution Method, 5 Computer Solutions, 14 Sensitivity Analysis, 17 Key Terms, 22 Solved

### Linear Programming. March 14, 2014

Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1

### What is Linear Programming?

Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to

### Sensitivity Analysis 3.1 AN EXAMPLE FOR ANALYSIS

Sensitivity Analysis 3 We have already been introduced to sensitivity analysis in Chapter via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and

### max cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x

Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study

### Chapter 5.1 Systems of linear inequalities in two variables.

Chapter 5. Systems of linear inequalities in two variables. In this section, we will learn how to graph linear inequalities in two variables and then apply this procedure to practical application problems.

### Algebraic Simplex Method - Introduction Previous

Algebraic Simplex Method - Introduction To demonstrate the simplex method, consider the following linear programming model: This is the model for Leo Coco's problem presented in the demo, Graphical Method.

### Solving Linear Programs

Solving Linear Programs 2 In this chapter, we present a systematic procedure for solving linear programs. This procedure, called the simplex method, proceeds by moving from one feasible solution to another,

### Practical Guide to the Simplex Method of Linear Programming

Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear

### Linear Programming in Matrix Form

Linear Programming in Matrix Form Appendix B We first introduce matrix concepts in linear programming by developing a variation of the simplex method called the revised simplex method. This algorithm,

### Graphical method. plane. (for max) and down (for min) until it touches the set of feasible solutions. Graphical method

The graphical method of solving linear programming problems can be applied to models with two decision variables. This method consists of two steps (see also the first lecture): 1 Draw the set of feasible

### LINEAR PROGRAMMING P V Ram B. Sc., ACA, ACMA Hyderabad

LINEAR PROGRAMMING P V Ram B. Sc., ACA, ACMA 98481 85073 Hyderabad Page 1 of 19 Question: Explain LPP. Answer: Linear programming is a mathematical technique for determining the optimal allocation of resources

### Chapter 6. Linear Programming: The Simplex Method. Introduction to the Big M Method. Section 4 Maximization and Minimization with Problem Constraints

Chapter 6 Linear Programming: The Simplex Method Introduction to the Big M Method In this section, we will present a generalized version of the simplex method that t will solve both maximization i and

### I. Solving Linear Programs by the Simplex Method

Optimization Methods Draft of August 26, 2005 I. Solving Linear Programs by the Simplex Method Robert Fourer Department of Industrial Engineering and Management Sciences Northwestern University Evanston,

### The Simplex Solution Method

Module A The Simplex Solution Method A-1 A-2 Module A The Simplex Solution Method The simplex method is a general mathematical solution technique for solving linear programming problems. In the simplex

### Outline. Linear Programming (LP): Simplex Search. Simplex: An Extreme-Point Search Algorithm. Basic Solutions

Outline Linear Programming (LP): Simplex Search Benoît Chachuat McMaster University Department of Chemical Engineering ChE 4G03: Optimization in Chemical Engineering 1 Basic Solutions

### Simplex method summary

Simplex method summary Problem: optimize a linear objective, subject to linear constraints 1. Step 1: Convert to standard form: variables on right-hand side, positive constant on left slack variables for

### Mathematics Notes for Class 12 chapter 12. Linear Programming

1 P a g e Mathematics Notes for Class 12 chapter 12. Linear Programming Linear Programming It is an important optimization (maximization or minimization) technique used in decision making is business and

### Introduction to Linear Programming.

Chapter 1 Introduction to Linear Programming. This chapter introduces notations, terminologies and formulations of linear programming. Examples will be given to show how real-life problems can be modeled

### Chapter 2 Solving Linear Programs

Chapter 2 Solving Linear Programs Companion slides of Applied Mathematical Programming by Bradley, Hax, and Magnanti (Addison-Wesley, 1977) prepared by José Fernando Oliveira Maria Antónia Carravilla A

### Using the Simplex Method in Mixed Integer Linear Programming

Integer Using the Simplex Method in Mixed Integer UTFSM Nancy, 17 december 2015 Using the Simplex Method in Mixed Integer Outline Mathematical Programming Integer 1 Mathematical Programming Optimisation

### Theory of Linear Programming

Theory of Linear Programming Debasis Mishra April 6, 2011 1 Introduction Optimization of a function f over a set S involves finding the maximum (minimum) value of f (objective function) in the set S (feasible

### The Simplex Method. What happens when we need more decision variables and more problem constraints?

The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving two decision variables and relatively few problem

### Chapter 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

### Simplex Method. Introduction:

Introduction: 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 properties of

### Lecture 4 Linear Programming Models: Standard Form. August 31, 2009

Linear Programming Models: Standard Form August 31, 2009 Outline: Lecture 4 Standard form LP Transforming the LP problem to standard form Basic solutions of standard LP problem Operations Research Methods

### The Canonical and Dictionary Forms of Linear Programs

The Canonical and Dictionary Forms of Linear Programs Recall the general optimization problem: Minimize f(x) subect to x D (1) The real valued function f is called the obective function, and D the constraint

### Lecture 1: Linear Programming Models. Readings: Chapter 1; Chapter 2, Sections 1&2

Lecture 1: Linear Programming Models Readings: Chapter 1; Chapter 2, Sections 1&2 1 Optimization Problems Managers, planners, scientists, etc., are repeatedly faced with complex and dynamic systems which

### MATH 2030: SYSTEMS OF LINEAR EQUATIONS. ax + by + cz = d. )z = e. while these equations are not linear: xy z = 2, x x = 0,

MATH 23: SYSTEMS OF LINEAR EQUATIONS Systems of Linear Equations In the plane R 2 the general form of the equation of a line is ax + by = c and that the general equation of a plane in R 3 will be we call

### 1 Polyhedra and Linear Programming

CS 598CSC: Combinatorial Optimization Lecture date: January 21, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im 1 Polyhedra and Linear Programming In this lecture, we will cover some basic material

### Min-cost flow problems and network simplex algorithm

Min-cost flow problems and network simplex algorithm The particular structure of some LP problems can be sometimes used for the design of solution techniques more efficient than the simplex algorithm.

### Math 018 Review Sheet v.3

Math 018 Review Sheet v.3 Tyrone Crisp Spring 007 1.1 - Slopes and Equations of Lines Slopes: Find slopes of lines using the slope formula m y y 1 x x 1. Positive slope the line slopes up to the right.

### Linear Programming Problems

Linear Programming Problems Linear programming problems come up in many applications. In a linear programming problem, we have a function, called the objective function, which depends linearly on a number

### Linear Programming Notes V Problem Transformations

Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material

### Standard Form of a Linear Programming Problem

494 CHAPTER 9 LINEAR PROGRAMMING 9. THE SIMPLEX METHOD: MAXIMIZATION For linear programming problems involving two variables, the graphical solution method introduced in Section 9. is convenient. However,

### 4.6 Linear Programming duality

4.6 Linear Programming duality To any minimization (maximization) LP we can associate a closely related maximization (minimization) LP. Different spaces and objective functions but in general same optimal

### Duality in Linear Programming

Duality in Linear Programming 4 In the preceding chapter on sensitivity analysis, we saw that the shadow-price interpretation of the optimal simplex multipliers is a very useful concept. First, these shadow

### Lecture 2: August 29. Linear Programming (part I)

10-725: Convex Optimization Fall 2013 Lecture 2: August 29 Lecturer: Barnabás Póczos Scribes: Samrachana Adhikari, Mattia Ciollaro, Fabrizio Lecci Note: LaTeX template courtesy of UC Berkeley EECS dept.

### Operation Research. Module 1. Module 2. Unit 1. Unit 2. Unit 3. Unit 1

Operation Research Module 1 Unit 1 1.1 Origin of Operations Research 1.2 Concept and Definition of OR 1.3 Characteristics of OR 1.4 Applications of OR 1.5 Phases of OR Unit 2 2.1 Introduction to Linear

### Linear Programming I

Linear Programming I November 30, 2003 1 Introduction In the VCR/guns/nuclear bombs/napkins/star wars/professors/butter/mice problem, the benevolent dictator, Bigus Piguinus, of south Antarctica penguins

### Linear Programming Notes VII Sensitivity Analysis

Linear Programming Notes VII Sensitivity Analysis 1 Introduction When you use a mathematical model to describe reality you must make approximations. The world is more complicated than the kinds of optimization

### LINEAR PROGRAMMING THE SIMPLEX METHOD

LINEAR PROGRAMMING THE SIMPLE METHOD () Problems involving both slack and surplus variables A linear programming model has to be extended to comply with the requirements of the simplex procedure, that

### Lecture 3: Linear Programming Relaxations and Rounding

Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can

### 3.5 Reduction to Standard Form

3.5 Reduction to Standard Form 77 Exercise 3-4-4. Read the following statements carefully to see whether it is true or false. Justify your answer by constructing a simple illustrative example (for false),

### Linear Programming. April 12, 2005

Linear Programming April 1, 005 Parts of this were adapted from Chapter 9 of i Introduction to Algorithms (Second Edition) /i by Cormen, Leiserson, Rivest and Stein. 1 What is linear programming? The first

### Linear Programming with Post-Optimality Analyses

Linear Programming with Post-Optimality Analyses Wilson Problem: Wilson Manufacturing produces both baseballs and softballs, which it wholesales to vendors around the country. Its facilities permit the

### Linear Programming, Lagrange Multipliers, and Duality Geoff Gordon

lp.nb 1 Linear Programming, Lagrange Multipliers, and Duality Geoff Gordon lp.nb 2 Overview This is a tutorial about some interesting math and geometry connected with constrained optimization. It is not

### 3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max

SOLUTION OF LINEAR PROGRAMMING PROBLEMS THEOREM 1 If a linear programming problem has a solution, then it must occur at a vertex, or corner point, of the feasible set, S, associated with the problem. Furthermore,

### . P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2

4. Basic feasible solutions and vertices of polyhedra Due to the fundamental theorem of Linear Programming, to solve any LP it suffices to consider the vertices (finitely many) of the polyhedron P of the

### December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation

### Using the Simplex Method to Solve Linear Programming Maximization Problems J. Reeb and S. Leavengood

PERFORMANCE EXCELLENCE IN THE WOOD PRODUCTS INDUSTRY EM 8720-E October 1998 \$3.00 Using the Simplex Method to Solve Linear Programming Maximization Problems J. Reeb and S. Leavengood A key problem faced

### Linear Programming Models: Graphical and Computer Methods

Linear Programming Models: Graphical and Computer Methods Learning Objectives Students will be able to: 1. Understand the basic assumptions and properties of linear programming (LP). 2. Graphically solve

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### 3.4. Solving Simultaneous Linear Equations. Introduction. Prerequisites. Learning Outcomes

Solving Simultaneous Linear Equations 3.4 Introduction Equations often arise in which there is more than one unknown quantity. When this is the case there will usually be more than one equation involved.

### Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### Ordered Pairs. Graphing Lines and Linear Inequalities, Solving System of Linear Equations. Cartesian Coordinates System.

Ordered Pairs Graphing Lines and Linear Inequalities, Solving System of Linear Equations Peter Lo All equations in two variables, such as y = mx + c, is satisfied only if we find a value of x and a value

### Domain Essential Question Common Core Standards Resources

Middle School Math 2016-2017 Domain Essential Question Common Core Standards First Ratios and Proportional Relationships How can you use mathematics to describe change and model real world solutions? How

### Linear Dependence Tests

Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks

### MATH2210 Notebook 1 Fall Semester 2016/2017. 1 MATH2210 Notebook 1 3. 1.1 Solving Systems of Linear Equations... 3

MATH0 Notebook Fall Semester 06/07 prepared by Professor Jenny Baglivo c Copyright 009 07 by Jenny A. Baglivo. All Rights Reserved. Contents MATH0 Notebook 3. Solving Systems of Linear Equations........................

### Solving Systems of Linear Equations

LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

### IEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2

IEOR 4404 Homework # Intro OR: Deterministic Models February 14, 011 Prof. Jay Sethuraman Page 1 of 5 Homework #.1 (a) What is the optimal solution of this problem? Let us consider that x 1, x and x 3

### 7.1 Modelling the transportation problem

Chapter Transportation Problems.1 Modelling the transportation problem The transportation problem is concerned with finding the minimum cost of transporting a single commodity from a given number of sources

### value is determined is called constraints. It can be either a linear equation or inequality.

Contents 1. Index 2. Introduction 3. Syntax 4. Explanation of Simplex Algorithm Index Objective function the function to be maximized or minimized is called objective function. E.g. max z = 2x + 3y Constraints

### EQUATIONS and INEQUALITIES

EQUATIONS and INEQUALITIES Linear Equations and Slope 1. Slope a. Calculate the slope of a line given two points b. Calculate the slope of a line parallel to a given line. c. Calculate the slope of a line

### The Graphical Method: An Example

The Graphical Method: An Example Consider the following linear program: Maximize 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2 0, where, for ease of reference,

### We call this set an n-dimensional parallelogram (with one vertex 0). We also refer to the vectors x 1,..., x n as the edges of P.

Volumes of parallelograms 1 Chapter 8 Volumes of parallelograms In the present short chapter we are going to discuss the elementary geometrical objects which we call parallelograms. These are going to

### Basic Terminology for Systems of Equations in a Nutshell. E. L. Lady. 3x 1 7x 2 +4x 3 =0 5x 1 +8x 2 12x 3 =0.

Basic Terminology for Systems of Equations in a Nutshell E L Lady A system of linear equations is something like the following: x 7x +4x =0 5x +8x x = Note that the number of equations is not required

### 2.3 Convex Constrained Optimization Problems

42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions

### Lecture 1: Systems of Linear Equations

MTH Elementary Matrix Algebra Professor Chao Huang Department of Mathematics and Statistics Wright State University Lecture 1 Systems of Linear Equations ² Systems of two linear equations with two variables

### Nonlinear Programming Methods.S2 Quadratic Programming

Nonlinear Programming Methods.S2 Quadratic Programming Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard A linearly constrained optimization problem with a quadratic objective

### 18. Linear optimization

18. Linear optimization EE103 (Fall 2011-12) linear program examples geometrical interpretation extreme points simplex method 18-1 Linear program minimize c 1 x 1 +c 2 x 2 + +c n x n subject to a 11 x

### Linear 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.

### 7.4 Linear Programming: The Simplex Method

7.4 Linear Programming: The Simplex Method For linear programming problems with more than two variables, the graphical method is usually impossible, so the simplex method is used. Because the simplex method

### SOLVING LINEAR SYSTEM OF INEQUALITIES WITH APPLICATION TO LINEAR PROGRAMS

SOLVING LINEAR SYSTEM OF INEQUALITIES WITH APPLICATION TO LINEAR PROGRAMS Hossein Arsham, University of Baltimore, (410) 837-5268, harsham@ubalt.edu Veena Adlakha, University of Baltimore, (410) 837-4969,

### x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

### 7 Gaussian Elimination and LU Factorization

7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method