# Chap 4 The Simplex Method

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 The Essence of the Simplex Method Recall the Wyndor problem Max Z = 3x 1 + 5x 2 S.T. x 1 4 2x x 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. Each corner-point solution lies at the intersection of two constraint boundaries. General speaking, for a LP problem with n variables, each of its corner-point solutions lies at the intersections of n constraint boundaries. For any LP with n decision variables, two CPF solutions are adjacent to each other if they share n 1 constraint boundaries. For example, (0, 0) and (0, 6) are adjacent. (0, 0) and (4, 3) are not. Two adjacent CPF solutions are connected by a line segment that lies on these same shared constraint boundaries, call an edge of the feasible region. Note that two edges emanate from each CPF solution. Thus, each CPF solution has two adjacent CPF solutions (in the Wyndor example). How many adjacent CPF are there for an n decision variable case? Optimality Test Consider a LP problem that possesses at least one optimal solution. If a CPF solution has no adjacent CPF solutions that are better, then it must be an optimal solution. (2, 6) is the optimal solution in the Wyndor Example. Solving the Wyndor Example (from a geometric viewpoint) Initialization Choose (0, 0) as the initial CPF solution for convenient reason. Optimality Test (0, 0) is not an optimal solution (adjacent solutions are better). Chap4-1

2 Iteration 1 Move to a better adjacent CPF solution, (0, 6). Between the two edges of the feasible region that emanate from (0, 0), choose to move along the edge that leads up the x 2 axis. Why choose this one? Stop at the first new constraint boundary: 2x 2 = 12. Solve for the intersection of the new set of constraint boundaries: (0, 6). Optimality Test: still not an optimal Iteration 2 Following the same procedures, move to a better adjacent CPF solution (2, 6). Optimality Test (2, 6) is an optimal solution. Key Solution Concepts Behind the Simplex Method Concept 1: For any problem with at least one optimal solution, finding one requires only finding a best CPF solution. Thus, we focus solely on CPF solutions. The number of CPF solutions is finite. This simplifies the searching space tremendously. Concept 2: The simplex method is an iterative algorithm. Find an initial CPF solution Stop Yes Is Current CPF solution optimal? No Perform an iteration to find a better CPF Chap4-2

3 Concept 3: Whenever possible, chooses the origin to be the initial CPF solution. Concept 4: Given a CPF solution, it is much quicker computationally to gather information about its adjacent CPF solutions than about other CPF solutions. While moving from the current CPF solution to a better one, it always chooses a CPF solution that is adjacent to the current one. The entire path followed to eventually reach an optimal solution is along the edges of the feasible region. Concept 5: After the current CPF solution is identified, the simplex method examines each of the edges of the feasible region that emanate from the current CPF solution. Among the edges with a positive rate of improvement in Z, it chooses to move along the one with the largest improvement rate. Concept 6: How the optimality test is performed efficiently? Check the improvement rate of each edge emanate from the current CPF solution. If all of them are negative, the current CPF solution is optimal. Solving the Wyndor Example (a algebraic procedure) Max Z = 3x 1 + 5x 2 S.T. x 1 4 2x x 1 + 2x 2 18 x 1, x 2 0 Setting up the Simplex method Introducing slack variables to transfer the functional inequalities into equalities and obtain the augmented form of the model. Max Z = 3x 1 + 5x 2 St x 1 + x 3 = 4 2x 2 + x 4 = 12 3x 1 + 2x 2 + x 5 = 18 x 1, x 2, x 3, x 4, x 5 0 If a slack variable equals 0 in the current solution, then this solution lies on the constraint boundary for the corresponding functional constraint. A value greater than 0 means that the solution lies on the feasible side of this constraint boundary. Chap4-3

4 What if the value of a slack variable is less than 0? More terminologies An augmented solution is a solution for the original variables and the slack variables (feasible or infeasible). A basic solution is an augmented corner-point solution (feasible or infeasible). For example, (4, 6) is a corner-point solution and (4, 6, 0, 0, -6) is the corresponding basic solution. A basic feasible (BF) solution is an augmented CPF solution. For example (0, 6) is a CPF solution and (0, 6, 4, 0, 6) is a BF solution. There are 3 equations with 5 variables. So, we can have 2 free variables. That is, if two of the variables are set, the value of the other three variables can be calculated. The simplex method uses zero for this arbitrary value. That is, two of the variables (called the nonbasic variables) are set to zero, and then the simultaneous solution of the three equations for the other three variables (called basic variables) is a basic solution. Some properties of a basic solution Each variable is designated as either a basic or a non-basic variable. The number of basic variables equals to the number of functional constraints. Therefore, number of non-basic variables equals the total number of variables (including slack variables) minus number of functional constraints. The non-basic variables are set to zero. The values of the basic variables are obtained as the simultaneous solution of the system of equations. The set of basic variables is often referred to as the basis. If the basic variables satisfy the non-negativity constraints, the basic solution is a BF solution. Let x 1 = x 4 = 0 (nonbasic variables), obtain x 3 =4, x 2 = 6, and x 5 = 6 (basic variables). It is a BF solution. Chap4-4

5 Two BF solutions are adjacent if all but one of their basic (nonbasic) variables are the same. (Note: not the values.) That is, moving from the current BF solution to an adjacent one involves switching one variable from nonbasic to basic and vice versa. (0, 6, 4, 0, 6) (2, 6, 2, 0, 0) (4, 3, 0, 6, 0) (4, 0, 0, 12, 6) (0, 0, 4, 12, 18) We could deal with the objective function equation at the same time as the new constraint equation. Note that Z is not really a decision variable. Max Z S.T. Z - 3x 1-5x 2 = 0 x 1 = 4 2x 2 = 12 3x 1 + 2x 2 = 18 x 1, x 2 0 The Algebra of the Simplex Method Recall the Wyndor Problem again. Initialization Add the slack variables Max Z S.T. Z - 3x 1-5x 2 = 0 (0) x 1 + x 3 = 4 (1) 2x 2 + x 4 = 12 (2) 3x 1 + 2x 2 + x 5 = 18 (3) x 1, x 2, x 3, x 4, x 5 0 Pick x 1 and x 2 be the nonbasic variables (starting from the origin). x 1 = x 2 = 0. Easily obtain x 3 = 4, x 4 = 12, and x 5 = 18 (x 3, x 4, and x 5 are basic variables). Why it is easy? Each equation has just one basic variable, which has a coefficient 1, and this basic variable does not appear in any other equation (and the objective function). Chap4-5

6 Optimality test Z - 3x 1-5x 2 = 0 Z (to be maximized) = 3x 1 + 5x 2 Can we improve the objective value any more (Z = 0 currently)? Determining the direction of movement If we change the value of x 1, or x 2, can we increase the value of objective function? Which one looks more promising? Pick to increase, called the entering basic variable. Determining where to stop. (How far could we increase the entering variable?) x 1 remain zero. x 1 + x 3 = 4 x 3 = 4 no bound on x 2 2x 2 + x 4 = 12 x 4 = 12 2x 2 x 2 6 minimum 3x 1 + 2x 2 + x 5 = 18 x 5 = 18 2x 2 x 2 9 x 2 can be increased to 6, where x 4 will drop to zero. x 4 is called the leaving basic variable (since it becomes zero). These procedures are referred to as the minimum ratio test. Only consider the equations where the coefficient of the entering basic variable is strictly positive (>0). Solving for the New BF Solution Initial BF solution: Nonbasic: x 1 = x 2 = 0, Basic: x 3 = 4, x 4 = 12, x 5 = 18. New BF solution: Nonbasic: x 1 = x 4 = 0, Basic: x 3 =?, x 2 =?, x 5 =? We would like to convert the system of equations to a more convenient form for obtaining the variable values and conducting the optimality test. Objective function equation only contains the nonbasic variables. Each functional constraint equation contains only one basic variable and its coefficient equals to 1. The original algebra form Z 3x 1 5x 2 = 0 (0) x 1 + x 3 = 4 (1) 2x 2 + x 4 = 12 (2) 3x 1 + 2x 2 + x 5 = 18 (3) Chap4-6

7 Perform the elementary algebraic operations (as learned in linear algebra) to produce the convenient form (called Gaussian elimination). Multiply (or divide) an equation by a nonzero constant. Add (or subtract) a multiple of one equation to (or from) another equation. Note that the coefficients of x 2 are -5, 0, 2, and 2. We want these coefficients to become 0, 0, 1, and 0. Optimality test (for the new BF solution) Z 3x 1 + 5/2x 4 = 30 Z = x 1 5/2x 4 Do we need to continue? Determine the direction of movement Determine where to stop Chap4-7

8 Solving for the new BF solution Optimality Test Do we need to continue? Optimal solution is Simplex Method in Tabular Form Logic is identical to that of the algebraic form. Only records the essential information. It can significantly reduce the effort of calculations. Z 3x 1 5x 2 = 0 x 1 + x 3 = 4 2x 2 + x 4 = 12 3x 1 + 2x 2 + x 5 = 18 Basic Coefficient of: Right Side Variable Z x 1 x 2 x 3 x 4 x 5 Z x x x Optimality test If every coefficient in Z row (row 0) is nonnegative ( 0). Chap4-8

9 Iteration Determining the entering basic variable by selecting the variable with the negative coefficient having the largest absolute value in row 0. Put a box around the column below this coefficient, and call this the pivot column. Basic Coefficient of: Right Side Variable Z x 1 x 2 x 3 x 4 x 5 Z x x x Determining the leaving basic variable by applying the minimum ratio test. Pick out each coefficient in the pivot column that is strictly positive (>0). Divide each of these coefficients into the right side entry for the same row. Identify the row that has the smallest of these ratios. Put a box around this row and call it the pivot row. Also, call the number that is in both boxes the pivot number. Basic Coefficient of: Right Ratio Variable Z x 1 x 2 x 3 x 4 x 5 Side Z x x /2=6 min x /2=9 The basic variable for the pivot row is the leaving basic variable, so replace that variable by the entering basic variable in the basic variable column of the next simplex tableau. Use elementary row operations to construct a new simplex tableau in proper form by using Gaussian elimination. Divide the pivot row by the pivot number. Chap4-9

10 Use elementary row operations to make other coefficients in pivot column to be zero. Basic Coefficient of: Right Ratio Variable Z x 1 x 2 x 3 x 4 x 5 Side Z / x /1=4 x /2 0 6 x /3=2 Basic Coefficient of: Right Variable Z x 1 x 2 x 3 x 4 x 5 Side Z / x /3-1/3 2 x /2 0 6 x /3 1/3 2 Ratio Tie for the entering basic variable Z = 3x 1 + 3x 2 Selection may be made arbitrarily. Tie for the leaving variable degeneracy Z 3x 1 5x 2 = 0 x 1 + x 3 = 4 2x 2 + x 4 = 12 3x 1 + 2x 2 + x 5 = 12 x 2 is the entering variable, x 4 and x 5 reach zero simultaneously. All the tied basic variables reach zero simultaneously. The one not chosen to be the leaving basic variable also will have a value of zero in the new BF solution. If x 4 is chosen as the leaving basic variable Z 3x 1 + 5/2x 4 = 30 x 1 + x 3 = 4 x 2 + 1/2x 4 = 6 3x 1 x 4 + x 5 = 0 So, the value of basic variable x 5 is zero (called a degenerate basic variable). Chap4-10

11 If the degenerate basic variable retains its value of zero until it is chosen to be a leaving basic variable, the corresponding entering basic variable also must remain zero, so the value of Z must remain unchanged. If x 1 is the entering basic variable and x 5 is the leaving basic variable, x 1 will remain zero because any increment of x 1 will result in a negative value of x 5. If Z may remain the same rather than increase at each iteration, the simplex method may then go around a loop. Rarely happen and ease to avoid. No Leaving basic variable unbounded Z x 1 is the entering basic variable Z 3x 1 + 5x 5 = 30 -x 1 + x 3 = 4-2x 1 + x 4 = 9 Multiple optimal solution If there are multiple optimal solutions, two of them must be CPF. How to tell and how to find the other optimal solutions? At least one of the nonbasic variables has a coefficient of zero in the final objective row. Increasing any such variable will not change the value of Z. Just perform one of iteration of simplex method will find it. Z 0x 3 + x 5 = 18 x 1 + x 3 = 4 3x 3 + x 4 x 5 = 6 x 2 3/2x 3 + 1/2x 5 = 3 Chap4-11

12 Rewrite the algebraic form All optimal solution can be written as linear combination of these two CPF. (x 1, x 2, x 3, x 4, x 5 ) = w 1 (2, 6, 2, 0, 0) + w 2 (4, 3, 0, 6, 0) or (x 1, x 2 ) = w 1 (2, 6) + w 2 (4, 3) w 1 + w 2 = 1, w 1, w 2 0 Not all models can be stated in standard form It causes the difficulty of finding the initial BF solution. Equality constraints Adopt 3x 1 + 2x 2 = 18 instead of 3x 1 + 2x 2 18 in the Wyndor Problem. Replace this equality by 3x 1 + 2x 2 18 and 3x 1 + 2x 2 18 is workable. But it is not a good idea since the increment of number of constraints. After introducing slack variables, we have Max Z = 3x 1 + 5x 2 S.T. x 1 + x 3 = 4 2x 2 + x 4 = 12 3x 1 + 2x 2 = 18 x 1, x 2, x 3, x 4 0 It is not easy to get the initial feasible solution anymore. The origin point is not feasible. Introduce an artificial variable x 5 and construct the artificial problem Max Z = 3x 1 + 5x 2 S.T. x 1 + x 3 = 4 2x 2 + x 4 = 12 3x 1 + 2x 2 + x 5 = 18 x 1, x 2, x 3, x 4, x 5 0 Assign an overwhelming penalty to having x 5 > 0 by changing the objective function Z = 3x 1 + 5x 2 to Z = 3x 1 + 5x 2 Mx 5 (M is a huge positive number, Big M method). Chap4-12

13 x 5 needs to be zero to assure the feasibility. So, impose a huge penalty when it becomes non-zero. Max Z = 3x 1 + 5x 2 Mx 5 S.T. x 1 + x 3 = 4 2x 2 + x 4 = 12 3x 1 + 2x 2 + x 5 = 18 x 1, x 2, x 3, x 4, x 5 0 Simplex method will try very hard not to have x 5 > 0 in the optimal solution. The initial basic variables are x 3, x 4, and x 5. So, we have to rewrite the objective function in term of nonbasic variables. Z = 18M + (3M+3)x 1 + (2M+5)x 2 Please finish the rest procedures (in tabular or algebraic form). See page 128 for details. What does it mean by having at least one non-zero artificial variable when the simplex method stops? Negative right hand side Multiply both sides by 1. Functional constraints in form 0.6x x 2 6 Introduce a surplus variable x 5 to make it be equality. Then, introduce an artificial variable x 6 and treat it as before. 0.6x x x x 2 x 5 = 6 0.6x x 2 x 5 + x 6 = 6 Minimization Multiply the objective function by 1 Min Z = 0.4x x 2 Max Z = 0.4x 1 0.5x 2 Chap4-13

14 Example Radiation Therapy Example Min Z = 0.4x x 2 S.T. 0.3x x x x 2 = 6 0.6x x 2 6 x 1, x 2 0 Apply above procedures Max Z = 0.4x 1 0.5x 2 Mx 4 Mx 6 S.T. 0.3x x 2 + x 3 = x x 2 + x 4 = 6 0.6x x 2 x 5 + x 6 = 6 x 1, x 2, x 3, x 4, x 5, x 6 0 Rewrite the objective function in term of nonbasic variables and solve by the simplex method Chap4-14

15 Recall the radiation therapy example The big M method requires extra calculation after the initial BF solution (for the original problem) is found. When the artificial variables are equal to 0, they remain zero for the rest simplex iterations. Summary of the Two-Phase Method Initialization: Revise the constraints by introducing artificial variables. Phase 1: The objective is to find a BF solution for the real problem. Min Z = sum of artificial variables, subject to revised constraints Phase 2: The objective is to find an optimal solution for the real problem. Phase 1 problem for radiation therapy example Chap4-15

16 Phase 2 problem for radiation therapy example Drop the artificial variables and restore the original objective function. Variables with a bound or with no bound x j L Let x j = x j L so x j 0 and can be treated as usual x j U Let x j = U x j so x j 0 and can be treated as usual x j does not have a bound + - x j = x j x j, x + - j, x j 0 Chap4-16

17 Shadow Price Find managerial decisions on resource allocations. * The shadow price for resource i (denoted by y i ) measures the marginal value of this resource. The rate which Z could be increased by (slightly) increasing the amount of this resource (b i ) being made available. Shadow price y * i equals to the coefficient (positive value) of the ith slack variable in the final objective row. The final iteration of the Wyndor example Z +3/2x 4 +x 5 = 36 x 3 +1/3x 4 1/3x 5 = 2 x 2 +1/2x 4 = 6 x 1 1/3x 4 +1/3x 5 = 2 The shadow prices are: If the unit cost for resource 2 is 1, do you want to go for it? Notice that the increment of resources is not unlimited. Chap4-17

18 Binding constraints are: Sensitivity Analysis Evaluate estimates of model parameters Define the allowable range of parameters without changing the optimal solution (or optimal basis). Sensitive parameters: The parameters that cannot be changed without changing the optimal solution. As for b i : As for c i : Chap4-18

19 As for a ij : Sensitivity report provided by the Excel Solver Chap4-19

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

### Section Notes 4. Duality, Sensitivity, Dual Simplex, Complementary Slackness. Applied Math 121. Week of February 28, 2011

Section Notes 4 Duality, Sensitivity, Dual Simplex, Complementary Slackness Applied Math 121 Week of February 28, 2011 Goals for the week understand the relationship between primal and dual programs. know

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

### Objective Function Coefficients and Range of Optimality If c k changes to values outside the range of optimality, a new c j - z j row may be generated

Chapter 5 Simplex-Based Sensitivity Analysis and Duality Sensitivity Analysis with the Simplex Tableau Duality 1 Objective Function Coefficients and Range of Optimality The range of optimality for an objective

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

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

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

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

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

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

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

### 4.4 The Simplex Method: Non-Standard Form

4.4 The Simplex Method: Non-Standard Form Standard form and what can be relaxed What were the conditions for standard form we have been adhering to? Standard form and what can be relaxed What were the

### LINEAR PROGRAMMING MODULE Part 2 - Solution Algorithm

LINEAR PROGRAMMING MODULE Part 2 - Solution Algorithm Name: THE SIMPLEX SOLUTION METHOD It should be obvious to the reader by now that the graphical method for solving linear programs is limited to models

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

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

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

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

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

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

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

### Chapter 6: Sensitivity Analysis

Chapter 6: Sensitivity Analysis Suppose that you have just completed a linear programming solution which will have a major impact on your company, such as determining how much to increase the overall production

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

### The Transportation Problem: LP Formulations

The Transportation Problem: LP Formulations An LP Formulation Suppose a company has m warehouses and n retail outlets A single product is to be shipped from the warehouses to the outlets Each warehouse

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

### Quiz Sensitivity Analysis

1 Quiz Sensitivity Analysis 1. The difference between the right-hand side (RHS) values of the constraints and the final (optimal) value assumed by the left-hand side (LHS) formula for each constraint is

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

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

### THEORY OF SIMPLEX METHOD

Chapter THEORY OF SIMPLEX METHOD Mathematical Programming Problems A mathematical programming problem is an optimization problem of finding the values of the unknown variables x, x,, x n that maximize

### 10 Linear Programming

10 Linear Programming Learning Objectives: After studying this unit you will be able to: Formulate the Linear Programming Problem Solve the Linear Programming Problem with two variables using graphical

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

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

### MTS OPERATIONS RESEARCH...

MTS 363 - OPERATIONS RESEARCH... Dr.I.A.Osinuga Recommended Texts 1. Operations Research (an introduction) Handy A. Taha (3 rd Edition) 2. Optimization (Theory and applications) S.S. Rao 3. Principles

### 2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system

1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables

### Degeneracy in Linear Programming

Degeneracy in Linear Programming I heard that today s tutorial is all about Ellen DeGeneres Sorry, Stan. But the topic is just as interesting. It s about degeneracy in Linear Programming. Degeneracy? Students

### Basic solutions in standard form polyhedra

Recap, and outline of Lecture Previously min s.t. c x Ax = b x Converting any LP into standard form () Interpretation and visualization () Full row rank assumption on A () Basic solutions and bases in

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

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

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

### Fundamentals of Operations Research Prof.G. Srinivasan Department of Management Studies Lecture No. # 03 Indian Institute of Technology, Madras

Fundamentals of Operations Research Prof.G. Srinivasan Department of Management Studies Lecture No. # 03 Indian Institute of Technology, Madras Linear Programming solutions - Graphical and Algebraic Methods

### Linear Programming: Chapter 5 Duality

Linear Programming: Chapter 5 Duality Robert J. Vanderbei October 17, 2007 Operations Research and Financial Engineering Princeton University Princeton, NJ 08544 http://www.princeton.edu/ rvdb Resource

### 4.3 The Simplex Method and the Standard Maximization Problem

. The Simplex Method and the Standard Maximiation Problem Question : What is a standard maximiation problem? Question : What are slack variables? Question : How do you find a basic feasible solution? Question

### Solving Systems of Linear Equations. Substitution

Solving Systems of Linear Equations There are two basic methods we will use to solve systems of linear equations: Substitution Elimination We will describe each for a system of two equations in two unknowns,

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

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

### Week 9: The Transportation Algorithm

Week 9: The Transportation Algorithm 1 1. Introduction The transportation algorithm follows the eact steps of the simple method, However, instead of using the regular simple tableau, we take advantage

### Solving Systems of Linear Equations Using Matrices

Solving Systems of Linear Equations Using Matrices What is a Matrix? A matrix is a compact grid or array of numbers. It can be created from a system of equations and used to solve the system of equations.

### Introduction to Linear Programming: Prototype example; The linearprogramming (LP) model.

PART - A UNIT 1 6 Hours Introduction, Linear Programming 1: Introduction: The origin, natureand impact of OR; Defining the problem and gathering data; Formulating amathematical model; Deriving solutions

### 1 Gaussian Elimination

Contents 1 Gaussian Elimination 1.1 Elementary Row Operations 1.2 Some matrices whose associated system of equations are easy to solve 1.3 Gaussian Elimination 1.4 Gauss-Jordan reduction and the Reduced

### Network Models 8.1 THE GENERAL NETWORK-FLOW PROBLEM

Network Models 8 There are several kinds of linear-programming models that exhibit a special structure that can be exploited in the construction of efficient algorithms for their solution. The motivation

### 6 Gaussian Elimination

G1BINM Introduction to Numerical Methods 6 1 6 Gaussian Elimination 61 Simultaneous linear equations Consider the system of linear equations a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 +

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

### 56:171 Operations Research Midterm Exam Solutions Fall 2001

56:171 Operations Research Midterm Exam Solutions Fall 2001 True/False: Indicate by "+" or "o" whether each statement is "true" or "false", respectively: o_ 1. If a primal LP constraint is slack at 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

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

### 3y 1 + 5y 2. y 1 + y 2 20 y 1 0, y 2 0.

1 Linear Programming A linear programming problem is the problem of maximizing (or minimizing) a linear function subject to linear constraints. The constraints may be equalities or inequalities. 1.1 Example

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