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

Size: px
Start display at page:

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

Transcription

1 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 deals with solving optimization problems of a particular form. Linear programming problems consist of a linear cost function (consisting of a certain number of variables) which is to be minimized or maximized subject to a certain number of constraints. The constraints are linear inequalities of the variables used in the cost function. The cost function is also sometimes called the objective function. Linear programming is closely related to linear algebra; the most noticeable difference is that linear programming often uses inequalities in the problem statement rather than equalities. 1.2 History Linear programming is a relatively young mathematical discipline, dating from the invention of the simplex method by G. B. Dantzig in Historically, development in linear programming is driven by its applications in economics and management. Dantzig initially developed the simplex method to solve U.S. Air Force planning problems, and planning and scheduling problems still dominate the applications of linear programming. One reason that linear programming is a relatively new field is that only the smallest linear programming problems can be solved without a computer. 1.3 Example (Adapted from [1].) Linear programming problems arise naturally in production planning. Suppose a particular Ford plant can build Escorts at the rate of one per minute, Explorer at the rate of one every 2 minutes, and Lincoln Navigators at the rate of one every 3 minutes. The vehicles get 25, 15, and 10 miles per gallon, respectively, and Congress mandates that the average fuel economy of vehicles produced be at least 18 miles per gallon. Ford loses \$1000 on each Escort, but makes a profit of \$5000 on each Explorer and \$15,000 on each Navigator. What is the maximum profit this Ford plant can make in one 8-hour day? The cost function is the profit Ford can make by building x Escorts, y Explorers, and z Navigators, and we want to maximize it: 1000x y z (1.3.1) The constraints arise from the production times and Congressional mandate on fuel economy. There are 480 minutes in an 8-hour day, and so the production times for the vehicles lead to the following limit: x + 2y+ 3z 480 (1.3.2) The average fuel economy restriction can be written: 25x + 15y+ 10z 18( x + y+ z) (1.3.3) which simplifies to: 7x 3y 8z 0 (1.3.4) There is an additional implicit constraint that the variables are all non-negative: x, y, z 0. Copyright 1998 Perceptive Scientific Instruments, Inc. Page 1 of 8

2 This production planning problem can now be written succinctly as: Maximize x y z subject to x + 2y+ 3z 480 7x 3y 8z 0 x, y, z 0 (1.3.5) The solution to this problem is x=132.41, y=0, and z=115.86, yielding a cost function value of 1,605, Note that for some problems, non-integer values of the variables may not be desired. Solving a linear programming problem for integer values of the variables only is called integer programming and is a significantly more difficult problem. The solution to an integer programming problem is not necessarily close to the solution of the same problem solved without the integer constraint. In this example, the optimal solution if x, y, and z are constrained to be integers is x=132, y=1, and z=115 with a resulting cost function value (profit) of \$1,598, Terminology A linear programming problem is said to be in standard form when it is written as: Maximize subject to n j= 1 n cx j j ax ij j bi, i= 1Km j = 1 x 0, j = 1Kn j (2.1) The problem has m variables and n constraints. It may be written using vector terminology as: Maximize subject to T cx Ax b x 0 (2.2) Note that a problem where we would like to minimize the cost function instead of maximize it may be rewritten in standard form by negating the cost coefficients c j (c T ). Any vector x satisfying the constraints of the linear programming problem is called a feasible solution of the problem. Every linear programming problem falls into one of three categories: 1. Infeasible. A linear programming problem is infeasible if a feasible solution to the problem does not exist; that is, there is no vector x for which all the constraints of the problem are satisfied. 2. Unbounded. A linear programming problem is unbounded if the constraints do not sufficiently restrain the cost function so that for any given feasible solution, another feasible solution can be found that makes a further improvement to the cost function. 3. Has an optimal solution. Linear programming problems that are not infeasible or unbounded have an optimal solution; that is, the cost function has a unique minimum (or maximum) cost function value. This does not mean that the values of the variables that yield that optimal solution are unique, however. The basic algorithm most often used to solve linear programming problems is called the simplex method. Over the past 50 years, it has been developed to the point that good Copyright 1998 Perceptive Scientific Instruments, Inc. Page 2 of 8

3 computer programs using the simplex method and its relatives (the revised simplex method and the network simplex method) can solve virtually any bounded, feasible linear programming problem of reasonable size in a reasonable amount of time. Only in the past ten years have other methods of solving linear programming problems (so-called interior point methods) developed to the point where they can be used to solve practical problems. 3. The Simplex Method 3.1 How It Works The simplex method has two basic steps, often called phases. The first phase is to find a feasible solution to the problem. For small problems, or larger problems of certain forms, this is not at all difficult. Often, a trivial solution such as x = 0 is a feasible solution, as in the production planning problem described earlier. We will omit the details of solving the first phase to find a feasible solution for now. After a feasible solution to the problem is found, the simplex method works by iteratively improving the value of the cost function. This is accomplished by finding a variable in the problem that can be increased, at the expense of decreasing another variable, in such a way as to effect an overall improvement in the cost function. This can be visualized graphically as moving along the edges of a feasible set from corner to corner. A two-dimensional example follows. 3.2 Geometric Interpretation of the Simplex Method Consider the linear programming problem: Maximize x + y subject to 2x + y 14 x + 2y 8 (3.2.1) 2x y 10 x 0, y 0 The feasible set of this problem can be graphed in two dimensions as shown in Figure 1. The non-zero constraints x 0 and y 0 confine the feasible set to the first quadrant. The other three constraints are lines in the x-y plane, as shown. The cost function, x + y, can be represented as a line of slope 1 with any intercept. The value of the intercept of the cost function line is the value of the cost function for any solution that lies along that line. The heavy line in Figure 1 represents the optimal solution of the problem, since it is the line with slope 1 with the maximum intercept (10) that intersects the feasible set. The value of the cost function for this optimal solution is 10, and the cost function line x + y = 10 has exactly one point in the feasible set, x = 4, y = 6. The simplex method works by finding a feasible solution, and then moving from that point to any vertex of the feasible set that improves the cost function. Eventually a corner is reached from which any movement does not improve the cost function. This is the optimal solution. In this example, x = 0 and y = 0 is a trivial feasible solution, and has a cost function value of 0. This is vertex A in Figure 1. From this point, we can either move to point B or point E. Point E (0, 4) increases the cost function to 4, while point B (5, 0) increases it to 5. Since point B gives us more improvement, we will select it as our first iteration (although we could just as well have chosen E and in fact would reach the optimal solution more quickly if we did). The value of x increases from 0 to 5, while y remains 0. Copyright 1998 Perceptive Scientific Instruments, Inc. Page 3 of 8

4 Figure 1. Graphical solution of a linear programming problem. From point B, we check whether a move to point C is advantageous. (We know that moving back to A is not.) Point C (6, 2) has a cost function value of 8, which is an improvement. Therefore we increase x from 5 to 6, which means that because of the constraints 2x y 10 and x + 2y 8, we must also increase y from 0 to 2. From point C, we now check whether a move to point D improves the situation. The cost function at D (4, 6) is 10, so we accept the move and increase y from 2 to 6. This means that x must decrease from 6 to 4 because of the constraints. Now, since a move to either point E (cost function value of 4) or point C (cost function value of 8) decreases the cost function, we know that point D is the optimal solution to this problem. 3.3 Algebraic Solution using the Simplex Method The same problem illustrated graphically above can be solved using only algebraic manipulations. First, we rewrite equation (3.2.1) adding slack variables to convert the inequality constraints into equalities: Maximize x + y = z subject to 2x + y + r = 14 x + 2y + s = 8 (3.3.1) 2x y + t = 10 The simplex method starts by fixing enough of the variables at 0 (their lower bound) and remove them from the problem so that the system Ax = b is square. In this case, with the slack variables added there are 5 variables and 3 constraints, so we need to set two variables to 0 and remove their coefficients from the problem to make the matrix A into a 3x3 matrix. The solution of the system in this instance represents one of the vertices of the feasible set, as illustrated geometrically in Figure 1. An obvious feasible solution to this problem is x = 0, y = 0. These are the two variables set to zero and removed from the problem. Such variables are called non-basic variables. The solution to this system is then Copyright 1998 Perceptive Scientific Instruments, Inc. Page 4 of 8

5 r = 14, s = 8, t = 10. solution. These three variables are called the basic variables for this Now, we rewrite the problem with the constraints as equations for the basic variables r, s, and t: z = x + y r = 14 2x y s = 8 + x 2y (3.3.2) t = 10 2x + y To begin iterating the simplex method, we look for a way to increase the cost function, z. Looking at the non-basic variables x and y, we try to increase one of them while holding the other at zero. However, the amount we can increase x is limited by the non-negativity constraints on the basic variables. Looking at the reformulated constraints shown above, we see that for the first constraint for r 0, we must have x 7. The second constraint does not limit x since an increase in x increases s, while the third constraint imposes the restriction that x 5. Therefore, we choose to increase x from zero to 5, and recalculate the values of r, s, and t from the above equations: r = 4, s = 13, and t = 0. Since x goes from zero to non-zero, it is said to enter the basis and is called the entering variable for this iteration. Since t goes from non-zero to zero, it is said to leave the basis and is called the leaving variable. Our basis now consists of the variables r, s, and x and the variables t and y are non-basic and therefore zero. Our objective function z now has a value of 5. We now rewrite the entire problem so that the objective function and constraints are expressed only as functions of the non-basic variables t and y, by rearranging the constraint equation for t from above to be x = 5 0.5t + 0.5y and substituting into the other equations: z = 5 0.5t + 1.5y r = 4 + t 2y s = t 1.5y (3.3.3) x = 5 0.5t + 0.5y Now we iterate the simplex method again. To increase z, we must increase y this time. The constraint on r limits y to be less than 2, the constraint on s limits y to be less than 8.67, and the constraint on x does not limit y. Therefore, we choose y as the entering variable with a value of 2, and r to be the leaving variable. The equation for r rearranges to y = 2 0.5r + 0.5t. Substituting in yields: z = r t y = 2 0.5r + 0.5t. s = r 1.25t (3.3.4) x = r 0.25t Note that when the problem is in this form, we can read the current values of the basic variables and the objective function from the constants just to the right of the equals signs. The variables on the right of the equations are the non-basic variables and all have value zero. To increase z for the next iteration, we have no other choice than to increase t. The constraint for s limits t to 8, while the constraint for x limits t to 24. Therefore, t enters with a value of 8 and s leaves the basis. The rearranged equation is t = r 0.8s. Substituting, we have: Copyright 1998 Perceptive Scientific Instruments, Inc. Page 5 of 8

6 z = r 0.2s y = 6 0.2r 0.4s t = r 0.8s (3.3.5) x = 4 0.4r 0.4s Now the objective function z has value 10. Examining the equation for z, we see that we cannot raise either r or s above zero without decreasing z. This means there are no more advantageous changes we can make to the solution, so it must be optimal. Therefore, the solution to this linear programming problem is x = 4, y = 6, with an objective function value of The Revised Simplex Method The revised simplex method is the name of an implementation of the simplex method that uses a slightly different method of updating the problem at each iteration: instead of updating the problem using the results of the previous iteration, it uses the original data. Each iteration is still the same, but the revised simplex method is more computationally efficient, especially for large and sparse problems. It is described in detail in the book by Chvátal [2]. 5. Pitfalls There are three major pitfalls that present themselves when solving linear programming problems by the simplex method. They are: 1. Initialization. This is the problem of finding an initial feasible solution with which to start the simplex method. 2. Iteration. There may be difficulties in choosing an entering or leaving variable. 3. Termination. This is the problem of ensuring that the simplex method terminates and does not merely continue through an endless sequence of iterations without ever reaching an optimal solution. 5.1 Initialization For many linear programming problems, finding an initial feasible solution is trivial; often, an all-zero solution is feasible and may be used as a starting point for the simplex method. If an initial feasible solution is not readily available, one can be found by solving an auxiliary linear programming problem formulated by subtracting additional variables from the original problem s constraints and changing the cost function to minimize the sum of these new variables. The auxiliary problem is solved, and when all of the added variables are zero, the values of the original variables represent an initial feasible solution. The original linear programming problem is then solved using this initial solution. If the solution to the auxiliary problem does not yield a solution where the new variables are all zero, then a feasible solution to the original problem does not exist. This strategy is known as the two-phase simplex method. The first phase sets up and solves the auxiliary problem, and the second phase solves the problem itself. 5.2 Iteration There is usually no difficulty in selecting an entering or leaving variable for each iteration of the simplex method. There is often more than one candidate for the entering or leaving variable, but any variable which satisfies the requirements for entering or leaving the basis may be chosen subject to termination considerations (discussed in the next section). When choosing a leaving variable, the only pitfall that endangers finding a solution is unboundedness, when the entering variable is not constrained in value by any of the candidate leaving variables. This means there is no candidate for the leaving variable Copyright 1998 Perceptive Scientific Instruments, Inc. Page 6 of 8

7 (which is meant to be the basic variable which imposed the most stringent bound on the increase of the entering variable). The problem in this case is unbounded and has no optimal solution. Another difficulty that may be encountered during iteration is the phenomenon of degeneracy. Degeneracy is not harmful to the simplex method, but it does have some annoying consequences; notably, it can cause the simplex method to go through many successive iterations that do not change the value of the solution (and therefore do not change the value of the cost function either). Degeneracy arises from solutions where one or more basic variables are zero, called degenerate solutions. When a basic variable with zero value is replaced in the basis with an entering variable that is limited to zero value, the solution does not change value at all (although the variables in the basis do change) and the iteration just performed is called a degenerate iteration. This is illustrated by the following example. z = 4 + 2x y 4s r = s t = 2x + 4y + 3s (5.2.1) u = x 3y + 2s x, y, r, s, t, u 0 Iterating this problem and choosing x as the entering variable and t as the leaving variable, we get: z = 4 + 3y s t r = s x = 2y + 1.5s 0.5t (5.2.2) u = y + 3.5s 0.5t x, y, r, s, t, u 0 Note that for both solutions, the objective value z is 4 and the variable r = 0.5 while all other variables are zero. This is a degenerate iteration. Eventually, the simplex method becomes unstuck and the iterations are non-degenerate. In the above example, the next iteration is also degenerate, but the iteration after that is not and yields the optimal solution. Although degeneracy itself does not endanger the simplex method, it does have consequences for termination that are discussed in the next section. Virtually all practical linear programming problems are degenerate. 5.3 Termination The simplex method terminates by finding that the problem is infeasible or unbounded, or by finding the optimal solution. The only other possibility is that the simplex method cycles; that is, it goes through an endless, repeating sequence of non-optimal solutions (which must all have the same cost function value). Note that cycling can only occur in the presence of degeneracy, since each iteration of a cycle must be degenerate. There are several strategies for selecting either the entering or leaving variable (or both) that ensure that cycling does not occur. The simplest of these is the smallest-subscript rule, which states that ties in the choice of entering and leaving variables are always broken in favor of the variable with the smallest subscript. 6. Speed Studies on practical linear programming problems of various sizes have shown that the simplex method typically terminates after between 1.5m and 3m iterations, where m is the number of constraints in the problem. The general consensus is that the number of iterations increases linearly with the number of constraints but only logarithmically with the Copyright 1998 Perceptive Scientific Instruments, Inc. Page 7 of 8

8 number of variables. Theoretical studies of the efficiency of the simplex method are much less satisfactory, however. The worst case of the simplex method requires 2 n -1 iterations, where n is the number of variables. However, problems where this has been demonstrated are considered pathologic, and a different choice of entering and leaving variables reduces the number of iterations from 2 n -1 to one! Therefore, the most practical way to ensure termination in a reasonable number of iterations is to pay careful attention to rules for selecting the entering and leaving variables. Theoretically satisfactory algorithms for solving linear programming problems are now available (known generally as interior point methods) but they are not useful for solving practical problems. The simplex method, despite its theoretical shortcomings, is still the method of choice. 7. Duality Every linear programming problem where we seek to maximize the objective function gives rise to a related problem, called the dual problem, where we seek to minimize the objective function. The two problems interact in an interesting way: every feasible solution to one problem gives rise to a bound on the optimal solution in the other problem. If one problem has an optimal solution, so does the other problem and the two objective function values are the same. The equations below show a problem in standard form with n variables and m constraints on the left, and its corresponding dual problem on the right. T T max cx min by s.t. Ax b T s.t. A y c x 0 y 0 n variables m variables m constraints n constraints (7.1) If the original or primal problem has the optimal solution x*, its dual problem has an T T optimal solution y* and c x* = b y*. If the primal problem is infeasible or unbounded, then the dual problem is infeasible or unbounded. Duality is mostly of theoretical importance, although some linear programming problems may be solved much more easily by converting them to their dual form. 8. Conclusions Linear programming is an important branch of applied mathematics that solves a wide variety of optimization problems. It is widely used in production planning and scheduling problems. Many recent advances in the field have come from the airline industry where aircraft and crew scheduling have been great improved by the use of linear programming. It has also been used to solve a variety of assignment problems, such as the karyotyping problem where 46 chromosomes are assigned to 24 classes. Although the revised simplex method is not theoretically satisfactory from a computational point of view, it is by far the most widely used method to solve linear programming problems and only rarely are its limitations encountered in practical applications. The biggest advantage of linear programming as an optimization method is that it always achieves the optimal solution if one exists. 9. References [1] G. Strang, Linear Algebra and its Applications, 3rd ed. San Diego: Harcourt Brace Jovanovich, [2] V. Chvátal, Linear Programming. New York: W. H. Freeman, Copyright 1998 Perceptive Scientific Instruments, Inc. Page 8 of 8

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

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

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

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

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

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

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

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

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

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

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

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

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

### 3.1 Solving Systems Using Tables and Graphs

Algebra 2 Chapter 3 3.1 Solve Systems Using Tables & Graphs 3.1 Solving Systems Using Tables and Graphs A solution to a system of linear equations is an that makes all of the equations. To solve a system

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

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

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

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

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

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

### Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method

Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming

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

### Module1. x 1000. y 800.

Module1 1 Welcome to the first module of the course. It is indeed an exciting event to share with you the subject that has lot to offer both from theoretical side and practical aspects. To begin with,

### Linear Programming: Theory and Applications

Linear Programming: Theory and Applications Catherine Lewis May 11, 2008 1 Contents 1 Introduction to Linear Programming 3 1.1 What is a linear program?...................... 3 1.2 Assumptions.............................

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

### What does the number m in y = mx + b measure? To find out, suppose (x 1, y 1 ) and (x 2, y 2 ) are two points on the graph of y = mx + b.

PRIMARY CONTENT MODULE Algebra - Linear Equations & Inequalities T-37/H-37 What does the number m in y = mx + b measure? To find out, suppose (x 1, y 1 ) and (x 2, y 2 ) are two points on the graph of

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

### An Introduction to Linear Programming

An Introduction to Linear Programming Steven J. Miller March 31, 2007 Mathematics Department Brown University 151 Thayer Street Providence, RI 02912 Abstract We describe Linear Programming, an important

### 1. Graphing Linear Inequalities

Notation. CHAPTER 4 Linear Programming 1. Graphing Linear Inequalities x apple y means x is less than or equal to y. x y means x is greater than or equal to y. x < y means x is less than y. x > y means

### Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year.

This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra

### Part 1 Expressions, Equations, and Inequalities: Simplifying and Solving

Section 7 Algebraic Manipulations and Solving Part 1 Expressions, Equations, and Inequalities: Simplifying and Solving Before launching into the mathematics, let s take a moment to talk about the words

### LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method

LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method Introduction to dual linear program Given a constraint matrix A, right

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

### Linear Programming Supplement E

Linear Programming Supplement E Linear Programming Linear programming: A technique that is useful for allocating scarce resources among competing demands. Objective function: An expression in linear programming

### Mathematical finance and linear programming (optimization)

Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may

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

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

### 3. Linear Programming and Polyhedral Combinatorics

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

### Chapter 5. Linear Inequalities and Linear Programming. Linear Programming in Two Dimensions: A Geometric Approach

Chapter 5 Linear Programming in Two Dimensions: A Geometric Approach Linear Inequalities and Linear Programming Section 3 Linear Programming gin Two Dimensions: A Geometric Approach In this section, we

9.3 Solving Quadratic Equations by Using the Quadratic Formula 9.3 OBJECTIVES 1. Solve a quadratic equation by using the quadratic formula 2. Determine the nature of the solutions of a quadratic equation

### This unit will lay the groundwork for later units where the students will extend this knowledge to quadratic and exponential functions.

Algebra I Overview View unit yearlong overview here Many of the concepts presented in Algebra I are progressions of concepts that were introduced in grades 6 through 8. The content presented in this course

### 5.1 Bipartite Matching

CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson

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

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

### POLYNOMIAL FUNCTIONS

POLYNOMIAL FUNCTIONS Polynomial Division.. 314 The Rational Zero Test.....317 Descarte s Rule of Signs... 319 The Remainder Theorem.....31 Finding all Zeros of a Polynomial Function.......33 Writing a

### 0.1 Linear Programming

0.1 Linear Programming 0.1.1 Objectives By the end of this unit you will be able to: formulate simple linear programming problems in terms of an objective function to be maximized or minimized subject

### 26 Linear Programming

The greatest flood has the soonest ebb; the sorest tempest the most sudden calm; the hottest love the coldest end; and from the deepest desire oftentimes ensues the deadliest hate. Th extremes of glory

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

### INTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models

Integer Programming INTEGER PROGRAMMING In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is

### Chapter 3: Section 3-3 Solutions of Linear Programming Problems

Chapter 3: Section 3-3 Solutions of Linear Programming Problems D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE Chapter () 3: Section 3-3 Solutions of Linear Programming

### EdExcel Decision Mathematics 1

EdExcel Decision Mathematics 1 Linear Programming Section 1: Formulating and solving graphically Notes and Examples These notes contain subsections on: Formulating LP problems Solving LP problems Minimisation

### Let s explore the content and skills assessed by Heart of Algebra questions.

Chapter 9 Heart of Algebra Heart of Algebra focuses on the mastery of linear equations, systems of linear equations, and linear functions. The ability to analyze and create linear equations, inequalities,

### Pre-Algebra 2008. Academic Content Standards Grade Eight Ohio. Number, Number Sense and Operations Standard. Number and Number Systems

Academic Content Standards Grade Eight Ohio Pre-Algebra 2008 STANDARDS Number, Number Sense and Operations Standard Number and Number Systems 1. Use scientific notation to express large numbers and small

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

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

### Linear Programming. Before studying this supplement you should know or, if necessary, review

S U P P L E M E N T Linear Programming B Before studying this supplement you should know or, if necessary, review 1. Competitive priorities, Chapter 2 2. Capacity management concepts, Chapter 9 3. Aggregate

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

### Section 1.1 Linear Equations: Slope and Equations of Lines

Section. Linear Equations: Slope and Equations of Lines Slope The measure of the steepness of a line is called the slope of the line. It is the amount of change in y, the rise, divided by the amount of

### Algebra 2 Chapter 1 Vocabulary. identity - A statement that equates two equivalent expressions.

Chapter 1 Vocabulary identity - A statement that equates two equivalent expressions. verbal model- A word equation that represents a real-life problem. algebraic expression - An expression with variables.

Academic Content Standards Grade Eight and Grade Nine Ohio Algebra 1 2008 Grade Eight STANDARDS Number, Number Sense and Operations Standard Number and Number Systems 1. Use scientific notation to express

### 5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition

### Actually Doing It! 6. Prove that the regular unit cube (say 1cm=unit) of sufficiently high dimension can fit inside it the whole city of New York.

1: 1. Compute a random 4-dimensional polytope P as the convex hull of 10 random points using rand sphere(4,10). Run VISUAL to see a Schlegel diagram. How many 3-dimensional polytopes do you see? How many

### Chapter 9. Systems of Linear Equations

Chapter 9. Systems of Linear Equations 9.1. Solve Systems of Linear Equations by Graphing KYOTE Standards: CR 21; CA 13 In this section we discuss how to solve systems of two linear equations in two variables

### 24. The Branch and Bound Method

24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no

### http://www.aleks.com Access Code: RVAE4-EGKVN Financial Aid Code: 6A9DB-DEE3B-74F51-57304

MATH 1340.04 College Algebra Location: MAGC 2.202 Meeting day(s): TR 7:45a 9:00a, Instructor Information Name: Virgil Pierce Email: piercevu@utpa.edu Phone: 665.3535 Teaching Assistant Name: Indalecio

### Rational Exponents. Squaring both sides of the equation yields. and to be consistent, we must have

8.6 Rational Exponents 8.6 OBJECTIVES 1. Define rational exponents 2. Simplify expressions containing rational exponents 3. Use a calculator to estimate the value of an expression containing rational exponents

### HIBBING COMMUNITY COLLEGE COURSE OUTLINE

HIBBING COMMUNITY COLLEGE COURSE OUTLINE COURSE NUMBER & TITLE: - Beginning Algebra CREDITS: 4 (Lec 4 / Lab 0) PREREQUISITES: MATH 0920: Fundamental Mathematics with a grade of C or better, Placement Exam,

### Arrangements And Duality

Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,

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

### Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities

Algebra 1, Quarter 2, Unit 2.1 Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned

### Nonlinear Optimization: Algorithms 3: Interior-point methods

Nonlinear Optimization: Algorithms 3: Interior-point methods INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris Jean-Philippe.Vert@mines.org Nonlinear optimization c 2006 Jean-Philippe Vert,

### The Point-Slope Form

7. The Point-Slope Form 7. OBJECTIVES 1. Given a point and a slope, find the graph of a line. Given a point and the slope, find the equation of a line. Given two points, find the equation of a line y Slope

### GENERALIZED INTEGER PROGRAMMING

Professor S. S. CHADHA, PhD University of Wisconsin, Eau Claire, USA E-mail: schadha@uwec.edu Professor Veena CHADHA University of Wisconsin, Eau Claire, USA E-mail: chadhav@uwec.edu GENERALIZED INTEGER

### Chapter 4 Online Appendix: The Mathematics of Utility Functions

Chapter 4 Online Appendix: The Mathematics of Utility Functions We saw in the text that utility functions and indifference curves are different ways to represent a consumer s preferences. Calculus can

### Chapter 13: Binary and Mixed-Integer Programming

Chapter 3: Binary and Mixed-Integer Programming The general branch and bound approach described in the previous chapter can be customized for special situations. This chapter addresses two special situations:

### Question 2: How do you solve a linear programming problem with a graph?

Question 2: How do you solve a linear programming problem with a graph? Now that we have several linear programming problems, let s look at how we can solve them using the graph of the system of inequalities.

### CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical

### South Carolina College- and Career-Ready (SCCCR) Algebra 1

South Carolina College- and Career-Ready (SCCCR) Algebra 1 South Carolina College- and Career-Ready Mathematical Process Standards The South Carolina College- and Career-Ready (SCCCR) Mathematical Process

### Several Views of Support Vector Machines

Several Views of Support Vector Machines Ryan M. Rifkin Honda Research Institute USA, Inc. Human Intention Understanding Group 2007 Tikhonov Regularization We are considering algorithms of the form min

### 9.4 THE SIMPLEX METHOD: MINIMIZATION

SECTION 9 THE SIMPLEX METHOD: MINIMIZATION 59 The accounting firm in Exercise raises its charge for an audit to \$5 What number of audits and tax returns will bring in a maximum revenue? In the simplex

### Algebraic expressions are a combination of numbers and variables. Here are examples of some basic algebraic expressions.

Page 1 of 13 Review of Linear Expressions and Equations Skills involving linear equations can be divided into the following groups: Simplifying algebraic expressions. Linear expressions. Solving linear

### LU Factorization Method to Solve Linear Programming Problem

Website: wwwijetaecom (ISSN 2250-2459 ISO 9001:2008 Certified Journal Volume 4 Issue 4 April 2014) LU Factorization Method to Solve Linear Programming Problem S M Chinchole 1 A P Bhadane 2 12 Assistant

### IV. ALGEBRAIC CONCEPTS

IV. ALGEBRAIC CONCEPTS Algebra is the language of mathematics. Much of the observable world can be characterized as having patterned regularity where a change in one quantity results in changes in other

### This exposition of linear programming

Linear Programming and the Simplex Method David Gale This exposition of linear programming and the simplex method is intended as a companion piece to the article in this issue on the life and work of George

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

### Sensitivity Analysis with Excel

Sensitivity Analysis with Excel 1 Lecture Outline Sensitivity Analysis Effects on the Objective Function Value (OFV): Changing the Values of Decision Variables Looking at the Variation in OFV: Excel One-

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### This is a square root. The number under the radical is 9. (An asterisk * means multiply.)

Page of Review of Radical Expressions and Equations Skills involving radicals can be divided into the following groups: Evaluate square roots or higher order roots. Simplify radical expressions. Rationalize

### Mathematics Common Core Sample Questions

New York State Testing Program Mathematics Common Core Sample Questions Grade The materials contained herein are intended for use by New York State teachers. Permission is hereby granted to teachers and

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

### Linear programming. Learning objectives. Theory in action

2 Linear programming Learning objectives After finishing this chapter, you should be able to: formulate a linear programming model for a given problem; solve a linear programming model with two decision

### LECTURE: INTRO TO LINEAR PROGRAMMING AND THE SIMPLEX METHOD, KEVIN ROSS MARCH 31, 2005

LECTURE: INTRO TO LINEAR PROGRAMMING AND THE SIMPLEX METHOD, KEVIN ROSS MARCH 31, 2005 DAVID L. BERNICK dbernick@soe.ucsc.edu 1. Overview Typical Linear Programming problems Standard form and converting

### 3.2. Solving quadratic equations. Introduction. Prerequisites. Learning Outcomes. Learning Style

Solving quadratic equations 3.2 Introduction A quadratic equation is one which can be written in the form ax 2 + bx + c = 0 where a, b and c are numbers and x is the unknown whose value(s) we wish to find.

### Optimization Modeling for Mining Engineers

Optimization Modeling for Mining Engineers Alexandra M. Newman Division of Economics and Business Slide 1 Colorado School of Mines Seminar Outline Linear Programming Integer Linear Programming Slide 2

### MATHEMATICS FOR ENGINEERING BASIC ALGEBRA

MATHEMATICS FOR ENGINEERING BASIC ALGEBRA TUTORIAL 3 EQUATIONS This is the one of a series of basic tutorials in mathematics aimed at beginners or anyone wanting to refresh themselves on fundamentals.

### Determine If An Equation Represents a Function

Question : What is a linear function? The term linear function consists of two parts: linear and function. To understand what these terms mean together, we must first understand what a function is. The