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

Save this PDF as:

Size: px
Start display at page:

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

## Transcription

1 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 constraints. What happens when we need more decision variables and more problem constraints? We use an algebraic method called the simplex method, which was developed by George B. DANTZIG ( ) in 1947 while on assignment with the U.S. Department of the air force.

2 Standard Maximization Problems in Standard Form A linear programming problem is said to be a standard maximization problem in standard form if its mathematical model is of the following form: Maximize the objective function Zmax = P= cx cx cx n n Subject to problem constraints of the form ax 1 1+ ax ax n n b, b 0 With non-negative constraints x, x,..., x n

3 Slack Variables A mathematical representation of surplus resources. In real life problems, it s unlikely that all resources will be used completely, so there usually are unused resources. Slack variables represent the unused resources between the left-hand side and right-hand side of each inequality.

4 Basic and Nonbasic Variables Basic variables are selected arbitrarily with the restriction that there be as many basic variables as there are equations. The remaining variables are non-basic variables. x + 2x + s = x + 4x + s = This system has two equations, we can select any two of the four variables as basic variables. The remaining two variables are then non-basic variables. A solution found by setting the two non-basic variables equal to 0 and solving for the two basic variables is a basic solution. If a basic solution has no negative values, it is a basic feasible solution.

5 SIMPLEX METHOD Step-1 Write the standard maximization problem in standard form, introduce slack variables to form the initial system, and write the initial tableau. Step 2 Are there any negative indicators in the bottom row? Step-3 Select the pivot column Step 4 Are there any positive elements in the pivot column above the dashed line? Step-5 Select the pivot element and perform the pivot operatio n STOP The optimal solution has been found. STOP The linear programming problem has no optimal solution Simplex algorithm for standard maximization problems

6 To solve a linear programming problem in standard form, use the following steps. 1- Convert each inequality in the set of constraints to an equation by adding slack variables. 2- Create the initial simplex tableau. 3- Select the pivot column. ( The column with the most negative value element in the last row.) 4- Select the pivot row. (The row with the smallest non-negative result when the last element in the row is divided by the corresponding in the pivot column.) 5-Use elementary row operations calculate new values for the pivot row so that the pivot is 1 (Divide every number in the row by the pivot number.) 6- Use elementary row operations to make all numbers in the pivot column equal to 0 except for the pivot number. If all entries in the bottom row are zero or positive, this the final tableau. If not, go back to step If you obtain a final tableau, then the linear programming problem has a maximum solution, which is given by the entry in the lower-right corner of the tableau.

7 Pivot Pivot Column: The column of the tableau representing the variable to be entered into the solution mix. Pivot Row: The row of the tableau representing the variable to be replaced in the solution mix. Pivot Number: The element in both the pivot column and the pivot row.

8 Simplex Tableau Most real-world problems are too complex to solve graphically. They have too many corners to evaluate, and the algebraic solutions are lengthy. A simplex tableau is a way to systematically evaluate variable mixes in order to find the best one.

9 Initial Simplex Tableau All variables Solution Basic variables coefficients 0

10 EXAMPLE The Cannon Hill furniture Company produces tables and chairs. Each table takes four hours of labor from the carpentry department and two hours of labor from the finishing department. Each chair requires three hours of carpentry and one hour of finishing. During the current week, 240 hours of carpentry time are available and 100 hours of finishing time. Each table produced gives a profit of \$70 and each chair a profit of \$50. How many chairs and tables should be made?

11 STEP 1 All information about example x1 2 Resource Table s ( ) Chairs ( ) Constraints Carpentry (hr) Finishing (hr) Unit Profit \$70 \$50 x Objective Function P= 70x + 50x 1 2 Carpentry Constraint 4x + 3x Finishing Constraint 2x + 1x Non-negativity conditions x1, x2 0

12 The first step of the simplex method requires that each inequality be converted into an equation. less than or equal to inequalities are converted to equations by including slack variables. s s2 Suppose 1 carpentry hours and finishing hours remain unused in a week. The constraints become; 4x + 3x + s = x + x + s = or 4x + 3x + s + 0s = x + x + 0s + s = As unused hours result in no profit, the slack variables can be included in the objective function with zero coefficients: P= 70x1+ 50x2 + 0s1+ 0s2 P 70x 50x 0s 0s =

13 The problem can now be considered as solving a system of 3 linear equations involving the 5 variables x1, x2, s1, s2, P in such a way that P has the maximum value; 4x + 3x + s + 0s = x + x + 0s + s = P 70x 50x 0s 0s = Now, the system of linear equations can be written in matrix form or as a 3x6 augmented matrix. The initial tableau is;

14 Basic Variables STEP 2 x 1 x 2 S 1 S 2 P Right Hand Side S S P The tableau represents the initial solution; x = 0, x = 0, s = 240, s = 100, P= The slack variables S 1 and S 2 form the initial solution mix. The initial solution assumes that all avaliable hours are unused. i.e. The slack variables take the largest possible values.

15 Variables in the solution mix are called basic variables. Each basic variables has a column consisting of all 0 s except for a single 1. all variables not in the solution mix take the value 0. The simplex process, a basic variable in the solution mix is replaced by another variable previously not in the solution mix. The value of the replaced variable is set to 0.

16 STEP 3 Select the pivot column (determine which variable to enter into the solution mix). Choose the column with the most negative element in the objective function row. Basic Variables x 1 x 2 S 1 S 2 P Right hand side S S P x 1 Pivot column should enter into the solution mix because each unit of x 1 (a table) contributes a profit of \$70 compared with only \$50 for each unit of x 1 (a chair)

17 Step 4 No, There aren t any positive elements in the pivot column above the dashed line. We can go on step 5

18 STEP 5 Select the pivot row (determine which variable to replace in the solution mix). Divide the last element in each row by the corresponding element in the pivot column. The pivot row is the row with the smallest non-negative result. Enter Exit Basic Variables x 1 x 2 S 1 S 2 P Right hand side S S P Pivot column 240/ 4 = / 2 = 50 Pivot row Pivot number

19 Should be replaced by x 1 in the solution mix. 60 tables can be made with 240 unused carpentry hours but only 50 tables can be made with 100 finishing hours. Therefore we decide to make 50 tables. Now calculate new values for the pivot row. Divide every number in the row by the pivot number. Basic Variables x 1 x 2 S 1 S 2 P Right hand side S x 1 1 1/2 0 1/ P R2 2

20 Use row operations to make all numbers in the pivot column equal to 0 except for the pivot number which remains as 1. Basic Variables x 1 x 2 S 1 S 2 P Right hand side S x 1 1 1/2 0 1/ P R2 + R1 70.R2 + R3 If 50 tables are made, then the unused carpentry hours are reduced by 200 hours (4 h/table multiplied by 50 tables); the value changes from 240 hours to 40 hours. Making 50 tables results in the profit being increased by \$3500; the value changes from \$0 to \$3500.

21 In this case, x = 50, x = 0, s = 40, s = 0, P= Now repeat the steps until there are no negative numbers in the last row. Select the new pivot column. x 2 should enter into the solution mix. Select the new pivot row. S 1 should be replaced by x 2 in the solution mix. Enter Exit Basic Variables x 1 x 2 S 1 S 2 P Right hand side S x 1 1 1/2 0 1/ P /1 = 40 50/ 0,5 = 100 New pivot column New pivot row

22 Calculate new values for the pivot row. As the pivot number is already 1, there is no need to calculate new values for the pivot row. Use row operations to make all numbers in the pivot column equal to except for the pivot number. Basic Variables x 1 x 2 S 1 S 2 P Right hand side x x /2 3/ P R + R R1+ R3

23 If 40 chairs are made, then the number of tables are reduced by 20 tables (1/2 table/chair multiplied by 40 chairs); the value changes from 50 tables to 30 tables. The replacement of 20 tables by 40 chairs results in the profit being increased by \$600; the value changes from \$3500 to \$4100. As the last row contains no negative numbers, this solution gives the maximum value of P.

24 Result This simplex tableau represents the optimal solution to the LP problem and is interpreted as: x = 30, x = 40, s = 0, s = and profit or P=\$4100 The optimal solution (maximum profit to be made) is to company 30 tables and 40 chairs for a profit of \$4100.

25 Example-2 A farmer owns a 100 acre farm and plans to plant at most three crops. The seed for crops A,B, and C costs \$40, \$20, and \$30 per acre, respectively. A maximum of \$3200 can be spent on seed. Crops A,B, and C require 1,2, and 1 workdays per acre, respectively, and there are maximum of 160 workdays available. If the farmer can make a profit of \$100 per acre on crop A, \$300 per acre on crop B, and \$200 per acre on crop C, how many acres of each crop should be planted to maximize profit?

26 The Dual Problem: Minimization with problem constraints of the form Linear programming problems exist in pairs. That is in linear programming problem, every maximization problem is associated with a minimization problem. Conversely, associated with every minimization problem is a maximization problem. Once we have a problem with its objective function as maximization, we can write by using duality relationship of linear programming problems, its minimization version. The original linear programming problem is known as primal problem, and the derived problem is known as dual problem.

27 Thus, the dual problem uses exactly the same parameters as the primal problem, but in different locations. To highlight the comparison, now look at these same two problems in matrix notation. Primal Problem Dual Problem Minimize Z=cx Maximize W=yb Subject to Ax b Subject to ya c and x 0 And y 0 Primal problem Dual problem aa 11 aa 12 aa 13 A= bb 11 bb 12 bb 13 cc 11 cc 12 cc 13 aa 11 bb 11 cc 11 A T = aa 12 bb 12 cc 12 aa 13 bb 13 cc 13

28 As an example, Primal Problem in algebraic form Minimize C=3x 1 +5x 2 Subject to x 1 4 2x x 1 +2x 2 18 and x 1 0, x 2 0 Primal problem A= Dual problem A T = Dual Problem in algebraic form Maximize Z=4y 1 +12y 2 +18y 3 Subject to y 1 +3y 3 3 2y 2 +2y 3 5 and y 1 0, y 2 0,y 3 0 Consequently, (1) the parameters for a constraint in either problem are the coefficients of a variable in the other problem and (2) the coefficients for the objective function of either problem are the right sides for the other problem.

29 Summary Primal (a) Maximize. (b) Objective Function. (c) Right hand side. (d) i th row of input-output coefficients. (e) j th column of input-output coefficients. Dual Minimize Right hand side. Objective function. i th column of input output coefficients. j the row of input-output coefficients.

30 WORKED OUT PROBLEM 1 The procedure for forming the dual problem is summarized in the box below: Formation of the Dual Problem Given a minimization problem with problem constraints, Step 1. Use the coefficients and constants in the problem constraints and the objective function to form a matrix A with the coefficients of the objective function in the last row. Step 2. Interchange the rows and columns of matrix A to form the matrix A T, the transpose of A. Step 3. Use the rows of A T to form a maximization problem with problem constraints. Forming the Dual Problem Minimize C = 40x x x 3 subject to 2x 1 + x 2 + 5x x 1 + x 2 + x 3 30 x 1, x 2, X 3 0

31 WORKED OUT PROBLEM 2 Form the dual problem: Minimize C = 16 x 1 + 9x x 3 subject to x 1 + x 2 + 3x x 1 + x 2 +x 3 16 x 1, x 2, x 3 0

32 Solution of Minimization Problems ORIGINAL PROBLEM (1) DUAL PROBLEM (2) Minimize C = 16x x 2 Maximize P = 50y y 2 subject to 2x 1 + 5x 2 50 x 1 + 3x 2 27 x 1, x 2 0 subject to 2y 1 + y y 1 + 3y 2 45 y 1,y 2 0

33 MINIMIZATION PROBLEMS - The Dual Form - Graphical Approach - Solution of Minimization Problems with Simplex Method - A Transportation Problem - The Big M method - Minimization by The Big M Method

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

### 56:171. Operations Research -- Sample Homework Assignments Fall 1992 Dennis Bricker Dept. of Industrial Engineering University of Iowa.

56:171 Operations Research -- Sample Homework Assignments Fall 1992 Dennis Bricker Dept. of Industrial Engineering University of Iowa Homework #1 (1.) Linear Programming Model Formulation. SunCo processes

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

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

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

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

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

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

### Reduced echelon form: Add the following conditions to conditions 1, 2, and 3 above:

Section 1.2: Row Reduction and Echelon Forms Echelon form (or row echelon form): 1. All nonzero rows are above any rows of all zeros. 2. Each leading entry (i.e. left most nonzero entry) of a row is in

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

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

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

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

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

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

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

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

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

### Row Echelon Form and Reduced Row Echelon Form

These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation

### 4 UNIT FOUR: Transportation and Assignment problems

4 UNIT FOUR: Transportation and Assignment problems 4.1 Objectives By the end of this unit you will be able to: formulate special linear programming problems using the transportation model. define a balanced

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

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

### Solving Systems of Linear Equations; Row Reduction

Harvey Mudd College Math Tutorial: Solving Systems of Linear Equations; Row Reduction Systems of linear equations arise in all sorts of applications in many different fields of study The method reviewed

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

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

### Solving Systems of Linear Equations 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.

### Study Guide 2 Solutions MATH 111

Study Guide 2 Solutions MATH 111 Having read through the sample test, I wanted to warn everyone, that I might consider asking questions involving inequalities, the absolute value function (as in the suggested

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

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

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### (a) Let x and y be the number of pounds of seed and corn that the chicken rancher must buy. Give the inequalities that x and y must satisfy.

MA 4-4 Practice Exam Justify your answers and show all relevant work. The exam paper will not be graded, put all your work in the blue book provided. Problem A chicken rancher concludes that his flock

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

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### Solving Systems of Linear Equations

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

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

### Linear Programming I: Maximization 2009 Samuel L. Baker Assignment 10 is on the last page.

LINEAR PROGRAMMING I 1 Learning objectives: Linear Programming I: Maximization 2009 Samuel L. Baker Assignment 10 is on the last page. 1. Recognize problems that linear programming can handle. 2. Know

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

### UNIT 1 LINEAR PROGRAMMING

OUTLINE Session : Session 2: Session 3: Session 4: Session 5: Session 6: Session 7: Session 8: Session 9: Session 0: Session : Session 2: UNIT LINEAR PROGRAMMING Introduction What is Linear Programming

### Unit 1. Today I am going to discuss about Transportation problem. First question that comes in our mind is what is a transportation problem?

Unit 1 Lesson 14: Transportation Models Learning Objective : What is a Transportation Problem? How can we convert a transportation problem into a linear programming problem? How to form a Transportation

### 1. (a) Multiply by negative one to make the problem into a min: 170A 170B 172A 172B 172C Antonovics Foster Groves 80 88

Econ 172A, W2001: Final Examination, Possible Answers There were 480 possible points. The first question was worth 80 points (40,30,10); the second question was worth 60 points (10 points for the first

### Converting a Linear Program to Standard Form

Converting a Linear Program to Standard Form Hi, welcome to a tutorial on converting an LP to Standard Form. We hope that you enjoy it and find it useful. Amit, an MIT Beaver Mita, an MIT Beaver 2 Linear

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

### Solving Linear Diophantine Matrix Equations Using the Smith Normal Form (More or Less)

Solving Linear Diophantine Matrix Equations Using the Smith Normal Form (More or Less) Raymond N. Greenwell 1 and Stanley Kertzner 2 1 Department of Mathematics, Hofstra University, Hempstead, NY 11549

### 11.2 ALLOCATION MODELS 242 CHAPTER 11 LINEAR OPTIMIZATION

242 CHAPTER 11 LINEAR OPTIMIZATION optimal point is encountered. The simplex algorithm does not require a starting point in the worksheet; to put it another way, it determines its own starting solution.

### The application of linear programming to management accounting

The application of linear programming to management accounting Solutions to Chapter 26 questions Question 26.16 (a) M F Contribution per unit 96 110 Litres of material P required 8 10 Contribution per

### 4.4 Equations of the Form ax + b = cx + d

4.4 Equations of the Form ax + b = cx + d We continue our study of equations in which the variable appears on both sides of the equation. Suppose we are given the equation: 3x + 4 = 5x! 6 Our first step

### Using row reduction to calculate the inverse and the determinant of a square matrix

Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible

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

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

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

### 5.5. Solving linear systems by the elimination method

55 Solving linear systems by the elimination method Equivalent systems The major technique of solving systems of equations is changing the original problem into another one which is of an easier to solve

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

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

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

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

### MathQuest: Linear Algebra. 1. Which of the following matrices does not have an inverse?

MathQuest: Linear Algebra Matrix Inverses 1. Which of the following matrices does not have an inverse? 1 2 (a) 3 4 2 2 (b) 4 4 1 (c) 3 4 (d) 2 (e) More than one of the above do not have inverses. (f) All

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

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

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

### Helpsheet. Giblin Eunson Library MATRIX ALGEBRA. library.unimelb.edu.au/libraries/bee. Use this sheet to help you:

Helpsheet Giblin Eunson Library ATRIX ALGEBRA Use this sheet to help you: Understand the basic concepts and definitions of matrix algebra Express a set of linear equations in matrix notation Evaluate determinants

### Linearly Independent Sets and Linearly Dependent Sets

These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for in-class presentation

### CHAPTER 11: BASIC LINEAR PROGRAMMING CONCEPTS

Linear programming is a mathematical technique for finding optimal solutions to problems that can be expressed using linear equations and inequalities. If a real-world problem can be represented accurately

### 8.2. Solution by Inverse Matrix Method. Introduction. Prerequisites. Learning Outcomes

Solution by Inverse Matrix Method 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix algebra allows us

### a = bq + r where 0 r < b.

Lecture 5: Euclid s algorithm Introduction The fundamental arithmetic operations are addition, subtraction, multiplication and division. But there is a fifth operation which I would argue is just as fundamental

### 3.3. Solving Polynomial Equations. Introduction. Prerequisites. Learning Outcomes

Solving Polynomial Equations 3.3 Introduction Linear and quadratic equations, dealt within Sections 3.1 and 3.2, are members of a class of equations, called polynomial equations. These have the general

### Linear Dependence Tests

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

### Math 240: Linear Systems and Rank of a Matrix

Math 240: Linear Systems and Rank of a Matrix Ryan Blair University of Pennsylvania Thursday January 20, 2011 Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011

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

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

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

### Solving Linear Programs in Excel

Notes for AGEC 622 Bruce McCarl Regents Professor of Agricultural Economics Texas A&M University Thanks to Michael Lau for his efforts to prepare the earlier copies of this. 1 http://ageco.tamu.edu/faculty/mccarl/622class/

### 2.1: MATRIX OPERATIONS

.: MATRIX OPERATIONS What are diagonal entries and the main diagonal of a matrix? What is a diagonal matrix? When are matrices equal? Scalar Multiplication 45 Matrix Addition Theorem (pg 0) Let A, B, and

### Lecture 6. Inverse of Matrix

Lecture 6 Inverse of Matrix Recall that any linear system can be written as a matrix equation In one dimension case, ie, A is 1 1, then can be easily solved as A x b Ax b x b A 1 A b A 1 b provided that

### Using Excel to Find Numerical Solutions to LP's

Using Excel to Find Numerical Solutions to LP's by Anil Arya and Richard A. Young This handout sketches how to solve a linear programming problem using Excel. Suppose you wish to solve the following LP:

### Zeros of a Polynomial Function

Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we

### International Doctoral School Algorithmic Decision Theory: MCDA and MOO

International Doctoral School Algorithmic Decision Theory: MCDA and MOO Lecture 2: Multiobjective Linear Programming Department of Engineering Science, The University of Auckland, New Zealand Laboratoire

### Similar matrices and Jordan form

Similar matrices and Jordan form We ve nearly covered the entire heart of linear algebra once we ve finished singular value decompositions we ll have seen all the most central topics. A T A is positive

### Lecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization

Lecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization 2.1. Introduction Suppose that an economic relationship can be described by a real-valued

### Jeffrey Kantor. August 28, 2006

Mosel August 28, 2006 Announcements Mosel Enrollment and Registration - Last Day for Class Change is August 30th. Homework set 1 was handed out today. A copy is available on the course web page http://jkantor.blogspot.com

### SECTION 8-1 Systems of Linear Equations and Augmented Matrices

86 8 Systems of Equations and Inequalities In this chapter we move from the standard methods of solving two linear equations with two variables to a method that can be used to solve linear systems with

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

### Creating a More Efficient Course Schedule at WPI Using Linear Optimization

Project Number: ACH1211 Creating a More Efficient Course Schedule at WPI Using Linear Optimization A Major Qualifying Project Report submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE in partial