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

Save this PDF as:

Size: px
Start display at page:

Download "Linear Inequalities and Linear Programming. Systems of Linear Inequalities in Two Variables"

## Transcription

1 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 The Dual; Minimization with constraints 5.6 Max Min with mixed constraints (Big M) Systems of Linear Inequalities in Two Variables GRAPHING LINEAR INEQUALITIES IN TWO VARIABLES SOLVING SYSTEMS OF LINEAR INEQUALITIES GRAPHICALLY APPLICATIONS

2 GRAPHING LINEAR INEQUALITIES IN TWO VARIABLES We know how to graph equations y=2x-2 2x-2y=4 But what about y 2x-2 2x-2y>4? y left half-plane right half-plane x

3 Upper half-plane y Lower half-plane x y 2x-4

4 y y>x-2 x y y<x-2 x

5 y y x - 2 x y x - 2 x

6 theorem 1 Graphs of Linear Inequalities The graph of the linear inequality Ax+By<C or Ax+By>C with B 0, is either the upper half-plane or the lower half-plane (but not both) determined by the line Ax+By=C. If B=0, the graph of Ax<C or Ax>c is either the left half-plane or the right half-plane (but not both) determined by the line Ax=C Procedure for graphing linear inequalities Step 1: Graph Ax+By=C, dashed if < or > Step 2: Choose test point not on line [ (0,0) is best] substitute coordinates into inequality Step 3: If test point coordinates satisfy inequality shade the half-plane containing it Otherwise shade other half-plane

7 Solving Systems of Linear Inequalities Step 1: Draw all the lines (dashed if > or <) Step 2: Step 3: Shade all regions If all regions overlap then this is the FEASIBLE REGION, dashed lines are NOT included y y 2 x 2 y x - 2 x

8 Corner Point A corner point of a solution region is a point in the solution region that is the intersection of two boundary lines. Bounded and Unbounded Solution Regions A solution region of a system of linear inequalities is bounded if it can be enclosed within a circle. Otherwise it is unbounded.

9 # 50 Table and Chair production Each table: Each chair: 8 hours assembly 2 hours finishing 2 hours assembly 1 hour finishing Hours available: 400 for assembly 120 for finishing How many tables and chairs can be produced? Let x be number of tables and y be the number of chairs produced per day. Assembly: table 8x, chair 2y Finishing: table 2x, chair y 8x +2y 400 2x + y x 0 y

10 A) Now suppose each table sells for \$50, and each chair for \$ 20. How many tables and chairs should we produce to maximize revenue? B) Suppose that each assembly hour costs \$10, while each finishing hour costs \$12. How many chairs and tables should we produce to minimize cost? C) Both A) and B) together, maximize profit.

11 5.2 Linear Programming in Two Dimensions- A Geometric Approach A Linear Programming Problem A General Description Geometric Solution Applications A Linear Programming Problem Each table: 8 Hours assembly 2 hours finishing Each chair: 2 hours assembly 1 hour finishing Hours available: 400 in the assembly department 120 in the finishing department Now suppose each table sells for \$ 50 and each chair for \$ 20. How many tables and chairs should we produce to maximize revenue?

12 x number of tables y number of chairs decision variables 8x+2y 400 2x+ y 120 Constraints 0 x nonnegative 0 y constraints objective function R =50x +20y 120 R 20 R=50 x +20y (40,40) 50

13 120 R 20 (x,y) R=50 x +20y (40,40) 50 The higher the line R= 50 x + 20 y is, the higher the revenue. IDEA: move the line as high as possible but so that it still intersects the feasible region. That ought to be the best we can do. AND IT IS!!!!

14 R (40,40) 50 So producing 40 tables and 40 chairs should give us a maximum revenue of R = 50 * * 40 = 2800 that is \$ 2800 is the maximum possible revenue, which is attained when we produce 40 tables and 40 chairs. This shows that corner points are the extremes for the objective function, since we use all the resources (available hours in each department), we max out on the constraints.

15 theorem 1 (version 1) Fundamental Theorem of Linear Programming If the optimal value of the objective function exists, then it must occur at one (or more) of the corner points of the feasible region. theorem 2 Existence of Solutions (A) If the feasible region is bounded, both max and min of the objective function exist (B) If the feasible region is unbounded, and the coefficients of the objective function are positive then the min exists (C) If the feasible region is empty, neither max nor min exist

16 Graphical Solution (S1) Summarize information (word problem) (S2) Form a mathematical model (A) Introduce decision variables, write linear objective function (B) Write constraints (linear inequalities) (C) Write nonnegative constraints (S3) Graph feasible region, find corner points (S4) Make table of values of objective function at corner points (S5) Determine optimal solution from (S4) (S6) Interpret solution (word problem) 5.3 A Geometric Introduction to the Simplex Method STANDARD MAXIMIZATION PROBLEMS SLACK VARIABLES BASIC AND NONBASIC VARIABLES BASIC FEASIBLE SOLUTIONS AND THE SIMPLEX METHOD

17 STANDARD PROBLEM STANDARD FORM Maximize P = 50x 1 +80x 2 Objective function Subject to x 1 +2x 2 32 constraints 3x 1 +4x 2 84 x 1,x 2 0 nonnegative constraints Standard Maximization Problem 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 P=c 1 x 1 +c 2 x 2 + +c n x n Subject to problem constraints of the form a 1 x 1 +a 2 x 2 + +a n x n b, with b 0 and with nonnegative constraints x 1,x 2,x 3,,x n 0

18 From Inequalities to Equalities We know how to deal with equalities, so let us convert the inequalities: x 1 +2x 2 32 taking only x 1 +2x 2 means there may be some slack left So we introduce a slack variable s 1 : x 1 +2x 2 + s 1 =32 with s 1 > 0 Slack variables Constraints become x 1 +2x 2 +s 1 =32 3x 1 +4x 2 + s 2 =84 with x 1 =20 and x 2 =5 we need s 1 =2 and s 2 =4 Problem: System above has infinitely many solutions!

19 Basic and Nonbasic Variables Basic and Basic Feasible Solutions Corner points are important! Basic solution correspond to the points of intersection of the boundary lines. Basic feasible solutions are those basic solutions which lie in the feasible area. D=(0,21) x 1 +2x x 1 +4x x 1,x 2 A=(0,16) B=(20,6) O=(0,0) E=(32,0) C=(28,0)

20 There are 6 basic solutions A, B, C, D, E, O But only 4 basic feasible solutions A, B, C, O How to find basic solutions? Select basic variables (free choice), need as many as there are equations. All other variables are nonbasic. Now set all nonbasic variables equal to zero and solve for the basic variables.

21 x 1 +2x 2 +s 1 =32 3x 1 +4x 2 + s 2 =84 2 equations 2 basic Other two variables are nonbasic. Since we start with four variables, there are 6 choices for the two basic variables. (the number of ways we can choose 2 out of 4) Basic x 1,x 2 x 1,s 2 s 1,x 2 x 1,s 1 s 2,x 2 s 1,s 2 Nonbasic s 1,s 2 s 1,x 2 x 1,s 2 s 2,x 2 x 1, s 1 x 1,x 2 Basic or basic feasible solution? For each choice of basic variables we let the nonbasic variables equal 0, solve for basic. If there are NO NEGATIVE values for the basic variables then we have a basic feasible solution.

22 The final solution Determine all basic feasible solutions Evaluate the objective function at all the basic feasible solutions Pick the one that gives the optimal value theorem 1 Fundamental Theorem of Linear Programming - -Version2 If the optimal value of the objective function in a linear programming problem exists, then that value must occur at one (or more) of the basic feasible solutions.

23 #10 p.301 5x 1 +x 2 < 35 4x 1 +x 2 < 32 0 < x 1,x 2 5x 1 +x 2 +s 1 = 35 4x 1 +x 2 +s 2 = 32 2 equations = 2 basic var s X 1 X 2 s 1 s 2 feasible ( A ) YES ( B ) NO ( C ) YES ( D ) YES ( E ) NO ( F ) YES

24 5.4 The Simplex Method: Maximization with < constraints INITIAL SYSTEM THE SIMPLEX TABLEAU THE PIVOT OPERATION INTERPRETING THE SIMPLEX PROCESS GEOMETRICALLY THE SIMPLEX METHOD SUMMARIZED APPLICATION INITIAL SYSTEM MAXIMIZE: P=50x 1 +80x 2 SUBJECT TO: x 1 +2x 2 <32 3x 1 +4x 2 <84 0<x 1,x 2 With slack variables: x 1 +2x 2 +s 1 =32 3x 1 +4x 2 +s 2 =84-50x 1-80x 2 +P = 0 x 1,x 2,s 1,s 2 > 0 Initial System has 5 variables

25 Basic & Basic Feasible Solutions 1) P is always basic 2) A basic solution of the initial system is also still a basic solution if P is deleted 3) If a basic solution of the initial system is a basic feasible solution after deleting P, then it is a basic feasible solution of the initial system 4) A basic feasible solution of the initial system can contain a negative number but only for P theorem 1 Fundamental Theorem of Linear Programming--Ver. 3 If the optimal value of the objective function in a linear programming problem exists, then the value must occur at one (or more) of the basic feasible solutions of the initial system.

26 The Simplex Tableau x1 x2 s1 s2 P s s P Initial Simplex Tableau Selecting Basic and Nonbasic Variables Step 1: Determine number of basic and nonbasic variables. Step 2: Selecting basic variables: Column with exactly one nonzero element, which is not in same row as nonzero element of other basic variable. Step 3: Selecting nonbasic variables: After all basic variables are selected, the rest are nonbasic

27 x1 x2 s1 s2 P s s P equations implies 3 basic variables s 1, s 2, P basic x 1, x 2, nonbasic Question: How to proceed? The Pivot Operation Which nonbasic variable should become basic? Idea: We want to increase P, choose the one which has the most effect! P=50x 1 +80x 2 1 unit increase in x 1 gives \$50 more in P 1 unit increase in x 2 gives \$80 more in P Choose x 2!

28 x1 x2 s1 s2 P s s P Choose the column that has the MOST NEGATIVE ENTRY in the bottom row. x 2 will enter the set of basic variables x 2 = entering variable Column corresponding to entering variable is the PIVOT COLUMN Entries in bottom row are INDICATORS Which variable will become nonbasic (exiting)? P is always basic, so s 1 or s 2?

29 Choosing the exiting variable How much can we increase x 2 within the given constraints? Assume x 1 =0. 2x 2 +s 1 =32 s 1 =32-2x 2 > 0 4x 2 +s 2 =84 s 2 =84-4x 2 > 0 x 2 < 32/2=16 x 2 < 84/4=21 Both inequalities need to be true, so we need to pick the smaller one. This corresponds to row 1 or s 1. x x 1 +4x 2 =84 16 x 1 +2x 2 =32 x 1

30 entering exiting x1 x2 s1 s2 P s s P /2=16 84/4=21 Pivot Column Selecting the Pivot Element Step1: Find most negative element in bottom row If tie, choose either. Step2: Divide each positive (>0) element on pivot column into corresponding element of last column. Smallest quotient wins. Step3: The PIVOT is the element in the pivot column which is in the winning row.

31 Performing a Pivot Operation Step 1: Make pivot element 1 Step 2: Create 0 s above and below the pivot We do this using the following elementary row operations: multiply a row by a nonzero constant add a multiple of one row to another Effect of Pivot Operation 1. nonbasic variable becomes basic 2. basic variable becomes nonbasic 3. value of objective function increases (or stays the same)

32 When are we finished? When we run out of things to do! In other words if we can no longer find a new pivot element. all indicators are nonnegative OR no positive elements in pivot column Write standard max problem in standard form Initial Simplex Tableau negative indicators? Yes select pivot column No Stop! Optimal solution positive elements in pivot column? No Stop! No solution Yes Select pivot perform pivot operation

33 Write standard max problem in standard form Initial Simplex Tableau negative indicators? Yes select pivot column No Stop! Optimal solution positive elements in pivot column? Yes Select pivot perform pivot operation No Stop! No solution 5.5 The Dual Problem Minimization with > Constraints FORMATION OF THE DUAL PROBLEM SOLUTION OF THE MINIMIZATION PROBLEM APPLICATION: TRANSPORTATION SUMMARY

34 Formation of the Dual Problem Instead of maximizing profit we might want to minimize cost. Minimize C=16x 1 +45x 2 Subject to 2x 1 +5x 2 > 50 x 1 +3x 2 > 27 x 1,x 2 > (15,4) 25 27

35 2x 1 + 5x 2 > 50 x 1 + 3x 2 > 27 16x 1 +45x 2 = C A= T A = Transpose of a Matrix Given a (m x n) matrix A, the transpose of A is the (n x m) matrix A T obtained by putting the first row of A into the first column of A T, the second row of A into the second column of A T, etc. ROWS of A become COLUMNS of A T COLUMNS of A become ROWS of A T

36 The Dual Problem y y T A = y 1 + y 2 < 16 5y 1 + 3y 2 < 45 50y 1 +27y 2 = P MAXIMIZE P subject to < constraints Formation of the Dual Problem Given a minimization problem with > constraints Step 1: Form matrix A using coefficients of the constraints and the objective function Step 2: Interchange rows and columns of A to get A T Step 3: Use rows of A T to write down the dual maximization problem with < constraints

37 Solution of Minimization Problem theorem 1 The Fundamental Principle of Duality A minimization problem has a solution if and only if its dual problem has a solution. If a solution exists, then the optimal value of the minimization problem is the same as the optimal value of the maximization problem. Minimize 2x 1 + 5x 2 > 50 x 1 + 3x 2 > 27 16x 1 +45x 2 = C Maximize 2y 1 + y 2 < 16 5y 1 + 3y 2 < 45 50y 1 +27y 2 = P The minimum value of C is the same as the maximum value for P. BUT the values for y 1,y 2 at which the maximum for P occurs are NOT the same as the x 1,x 2 values at which the minimum for C occurs!

38 Original Problem 2x 1 + 5x 2 > 50 x 1 + 3x 2 > 27 16x 1 +45x 2 = C Corner Points (x 1,x 2 ) C= (0,10) 450 (15,4) 420 (27,0) 432 Min of C=420 at (15,4) Dual Problem 2y 1 + y 2 < 16 5y 1 + 3y 2 < 45 50y 1 +27y 2 = P Corner Points (y 1,y 2 ) P= (0,0) 0 (0,15) 405 (3,10) 420 (8,0) 400 Max of P=420 at (3,10) Picture of the Dual Problem (3,10) 8 9

39 2y 1 + y 2 +x 1 = 16 5y 1 +3y 2 +x 2 = 45-50y 1-27y 2 +P = 0 Use x 1,x 2 as slack variables to solve the dual problem! y 1 y 2 y 1 y 2 x 1 x 2 P No negative indicators are left, so we found the optimal solution: (from tableau) y 1 =3, y 2 =10,x 1 =0,x 2 =0,P=420 But the tableau gives more information: x 1 =15, x 2 =4, C=420 Minimum cost of \$420 when we produce x 1 =15, x 2 =4 items.

40 The optimal solution to a minimization problem can always be found from the bottom row of the final simplex tableau for the dual problem! Solution of a minimization problem: Given a minimization problem with nonnegative coefficients in the objective function. Step 1. Write all constraints as > inequalities Step 2. Form the dual problem. Step 3. Use variables from minimization problem as slack variables. Step 4. Use simplex method to solve this problem. Step 5. If solution exist, read it from bottom row. If dual problem has no solution, neither does the original problem.

41 #48 p 338 A feed company stores grain in Ames and Bedford. Each month grain is shipped to Columbia and Danville for processing. The supply (in tons) in each storage and the demand (in tons) in each processing location as well as transportation cost (in \$ per ton) are given below. Find shipping schedule that minimizes cost and minimum cost. Shipping C o lum bia Cost D an ville Supply Ames \$22 \$ Bedford \$46 \$ Demand Need shipping schedule: Let x 1 be tons shipped from A to C Let x 2 be tons shipped from A to D Let x 3 be tons shipped from B to C Let x 4 be tons shipped from B to D x 1 +x 2 < 700 -x 1 -x 2 > -700 x 3 +x 4 < 500 -x 3 -x 4 > -500 x 1 +x 3 > 400 x 1 +x 3 > 400 x 2 +x 4 > 600 x 2 +x 4 > 600 C= 22x 1 +38x 2 +46x 3 +24x 4 x 1, x 2, x 3, x 4 > 0

42 A = T A = Maximize: P=-700y 1-500y y y 4 Subject to: -y 1 + y 3 < 22 -y 1 + y 4 < 38 -y 2 + y 3 < 46 -y 2 + y 4 < 24 y 1, y 2, y 3, y 4 > 0 700y y 2-400y 3-600y 4 +P = 0 Introduce x 1, x 2, x 3, x 4 as slack variables. y 1 y 2 y 3 y 4 y 1 y 2 y 3 y 4 x 1 x 2 x 3 x 4 P

43 y 1 =0,y 2 =14,y 3 =22,y 4 =38 x 1 =400,x 2 =100,x 3 =0,x 4 =500, P=C= Mixed Problems The Big M Method Introduction to the Big M Method TheBigMMethod Minimization with Big M Summary of Solution Methods Larger Problems

44 Introduction to the Big M Method Consider the problem Maximize P=2x 1 +x 2 Subject to x 1 +x 2 < 10 -x 1 +x 2 > 2 x 1, x 2 > 0 x 1 +x 2 +s 1 = 10 s 1 is a slack -x 1 +x 2 -s 2 = 2 and s 2 a surplus -2x 1 -x 2 +P = 0 variable x 1, x 2, s 1, s 2 > 0 Non basic variables x 1,x 2 Basic variables s 1,s 2,P Basic solution: x 1 =0, x 2 =0, s 1 =10, s 2 =-2, P=0 This is NOT feasible since s 2 <0. We can NOT just write a Simplex Tableau, we need a new variable called ARTIFICIAL VARIABLE This variable has no physical meaning!

45 For each equation that has a surplus variable we need an artificial variable: -x 1 +x 2 -s 2 +a 1 =10 For each artificial variable, we need to introduce a PENALTY on P for using this variable: P=2x 1 +x 2 -Ma 1 where M is a large positive number, so for each unit increase in a 1 we loose M from P. Modified Problem x 1 +x 2 +s 1 = 10 s 1 slack, -x 1 +x 2 -s 2 + a 1 = 2 s 2 surplus -2x 1 -x 2 +Ma 1 +P = 0 a 1 artificial x 1, x 2, s 1, s 2, a 1 > 0 M Big M Preliminary Simplex Tableau x 1 x 2 s1 s 2 a 1 P M 1 0

46 When is the preliminary tableau an initial Simplex tableau? 1. We need to be able to select enough basic variables (only one nonzero entry in column which is not in the same row as one of another basic variable) 2. The basic solution found by setting nonbasic variables equal to zero is feasible. s 1, s 2, and P are basic (condition 1 is met), but we saw that the basic solution is not feasible. x 1 x 2 s1 s 2 a 1 P M 1 0 Note the -1 in the s 2 column, but the 1 in a 1 Use row operations to make a 1 basic.

47 x x s s a P M 1 0 (-M)R 2 +R 3 R 3 x 1 x 2 s 1 s 2 a 1 P M-2 -M-1 0 M 0 1-2M This is an initial Simplex tableau M M M Since M is large positive we are done. x 1 =4,x 2 =6,s 1 =0,s 2 =0,P=14

48 Big M, slack, surplus, artificial variables Step 1: If constraints have negative constants on the right then multiply by -1 Step 2: Introduce one slack variable for each < constraint Step 3: Introduce one surplus and one artificial variable for each > constraint Step 4: Introduce an artificial variable in each = constraint Step 5: For each artificial variable a i, add -Ma i to the objective function. Use the same M for each. Big M -- Solving the problem Step 1: Form preliminary simplex tableau Step 2: Using row operations, eliminate M from bottom row in columns of artificial variables. This gives the preliminary Simplex tableau. Step 3: Solve the modified problem (A) (B) (C) If the modified problem has NO solution then the original has NO solution If all artificial variables are zero in the solution of the modified problem, then delete artificial variables to find the solutions of the original problem If any artificial variables are nonzero in the solution of the modified problem then the original problem has NO solution.

49 Minimization using Big M Minimize C=30x 1 +30x 2 +10x 3 Subject to x 1 +x 2 +x 3 > 6 2x 1 +x 2 +2x 3 < 10 x 1,x 2,x 3 > 0 Instead maximize P=-C=-30x 1-30x 2-10x 3 Subject to x 1 +x 2 +x 3 > 6 2x 1 +x 2 +2x 3 < 10 x 1,x 2,x 3 > 0 Min C= -Max P x 1 + x 2 + x 3 -s 1 +a 1 = 6 2x 1 + x 2 + 2x 3 +s 2 =10 30x 1 +30x 2 +10x 3 +Ma 1 +P= M M M M M M

50 After some work we get the final tableau M x 1 =0,x 2 =2,x 3 =4,s 1 =0,a 1 =0,s 2 =0,P=-100 Min C= -Max P=-(-100)=100 at x 1 =0,x 2 =2,x 3 =4 SUMMARY Type Constraints Right side constants coeff. of objective function Solution method Max < nonnegative any Simplex + slack Min > any nonnegative dual + above Max Mixed (<,>,=) nonnegative any modified with slack, surplus, artificial Min Mixed (<,>,=) nonnegative any Max negative of objective

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

### Lesson 22: Solution Sets to Simultaneous Equations

Student Outcomes Students identify solutions to simultaneous equations or inequalities; they solve systems of linear equations and inequalities either algebraically or graphically. Classwork Opening Exercise

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

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

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

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

### Zeros of Polynomial Functions

Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n-1 x n-1 + + a 1 x + a 0 has integer coefficients and p/q (where p/q is reduced) is a rational zero, then p is a factor of

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

### Section 7.2 Linear Programming: The Graphical Method

Section 7.2 Linear Programming: The Graphical Method Man problems in business, science, and economics involve finding the optimal value of a function (for instance, the maimum value of the profit function

### 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 II: Minimization 2006 Samuel L. Baker Assignment 11 is on page 16.

LINEAR PROGRAMMING II 1 Linear Programming II: Minimization 2006 Samuel L. Baker Assignment 11 is on page 16. Introduction A minimization problem minimizes the value of the objective function rather than

### Sensitivity Report in Excel

The Answer Report contains the original guess for the solution and the final value of the solution as well as the objective function values for the original guess and final value. The report also indicates

### The slope m of the line passes through the points (x 1,y 1 ) and (x 2,y 2 ) e) (1, 3) and (4, 6) = 1 2. f) (3, 6) and (1, 6) m= 6 6

Lines and Linear Equations Slopes Consider walking on a line from left to right. The slope of a line is a measure of its steepness. A positive slope rises and a negative slope falls. A slope of zero means

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

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

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

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

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

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

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

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

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

### Functions and Equations

Centre for Education in Mathematics and Computing Euclid eworkshop # Functions and Equations c 014 UNIVERSITY OF WATERLOO Euclid eworkshop # TOOLKIT Parabolas The quadratic f(x) = ax + bx + c (with a,b,c

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

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

### 5 Systems of Equations

Systems of Equations Concepts: Solutions to Systems of Equations-Graphically and Algebraically Solving Systems - Substitution Method Solving Systems - Elimination Method Using -Dimensional Graphs to Approximate

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

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

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

### Chapter 2: Systems of Linear Equations and Matrices:

At the end of the lesson, you should be able to: Chapter 2: Systems of Linear Equations and Matrices: 2.1: Solutions of Linear Systems by the Echelon Method Define linear systems, unique solution, inconsistent,

Graphing Inequalities (Scaffolding Task) Introduction In this task, students will graph two separate inequalities in two variables and analyze the graph for solutions to each. The students will then graph

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

### MAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =

MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the

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

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

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

### In this lesson you will learn to find zeros of polynomial functions that are not factorable.

2.6. Rational zeros of polynomial functions. In this lesson you will learn to find zeros of polynomial functions that are not factorable. REVIEW OF PREREQUISITE CONCEPTS: A polynomial of n th degree has

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

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

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

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

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

### PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

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

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

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

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

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

### Systems of Linear Equations

Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

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

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

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

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