1. Chapter 4 Simplex Method
Section 4.1 Setting Up the Simplex Method
Section 4.2 The Simplex Method
Section 4.3 The Standard Minimum Problem
Section 4.4 Mixed Constraints
Section 4.5 Multiple Solutions, Unbounded Solutions, and No Solutions
Section 4.6 What’s Happening in the Simplex Method? (Optional)
Section 4.7 Sensitivity Analysis

2. 4.1 Setting up the Simplex Tableau
In chapter 4 we are going to study an _________ technique that applies to all linear programming problems. The technique is called the _________ Method. Basically it involves _____________ the constraints so we have a system of linear ____________ and then using augmented matrices to find specific solutions to the system of equations.

3. Standard Maximum Problem
The objection function is to be _______________.
Each constraint is written using the ___ inequality (_____________ the nonnegative conditions).
The constants in the constraints to the right of < are ___________ negative.
The variables are restricted to _____________ values (nonnegative conditions).

4. Example Maximize the objection function z = 4x1 + 12x2
subject to the constraints
and the nonnegative conditions x1 > 0 and x2 > 0.
This problem has the properties of a standard maximum problem.
The objection function is to be maximized.
Each constraint is written using the < inequality (excluding the nonnegative conditions).
The constants in the constraints to the right of < are never negative (180, 100, and 40 in the example).
The variables are restricted to nonnegative values (nonnegative conditions).

5. Geometric Form
A graph of the __________________ is useful in seeing the steps of the simplex method.
In the geometric approach, we examine the ____________ of the feasible region for _____________ values.
A corner point occurs at the ___________________ of a pair of boundary lines.
Not all pairs of boundary lines intersect at a corner point. The point must lie within the feasible region.

6. Example
Graph the feasible region for the following problem: Maximize the objection function z = 4x1 + 12x2
subject to the constraints
and the nonnegative conditions x1 > 0 and x2 > 0.
The boundaries for the feasible region are formed by the lines

7. Slack Variables
The equations for the boundary lines give only point on the boundaries. In order to represent points in the interior of the feasible region some new variables are introduced, called slack variables. Slack variables allow us to view the problem as a system of equations.
The first step in the simplex method converts the constraints to a linear equation. This is accomplished by introducing one slack variable for each
constraint, usually denoted by si.
(40,60) s1 = 0, s2 = –6
(52,24) s1 = 0, s2 = 0
(10,45)
s1 = 105
s2 = 0
(10,20)
s1 = 130
s2 = 50
Consider

8. Example
Write a system of equations using slack variables which includes the objection function z = 20x1 + 35x2 + 40x3 subject to the constraints
SOLUTION
Since we want to find the value of z that comes from the solution to the system we ____________ the objective function. Its form needs to have all terms on the ____________________.

9. Simplex Tableau
The simplex method uses matrices and row operations on matrices to determine an optimal solution. The matrix used is called the simplex tableau. Setting up a simplex tableau is illustrated using a previous example.
EXAMPLE
Maximize the objection function z = 4x1 + 12x2
subject to the constraints
First, write the problem as a system of equations using _________ __________ and then form the augmented matrix of the system.

10. Example continued The system of equations is
The augmented matrix of this system is
This is the simplex tableau.

11. Simplex Tableau Find the maximum value of the objective function
z = 10x + 15y
subject to the constraints
This problem has the properties of a standard maximum problem.
The objection function is to be ________________.
Each constraint is written using the _____ inequality (excluding the nonnegative conditions).
The constants in the constraints to the right of < are ________ negative (180, 100, and 40 in the example).
The variables are restricted to _______________ values (nonnegative conditions).

12. Simplex Tableau Find the maximum value of the objective function
z = 10x + 15y
subject to the constraints

13. Your Turn
Set up the simplex tableau for the following standard maximum problem

14. Elementary Row Operations
Operations that can be performed without altering the solution set of a linear system
1. Interchange any two rows
2. Multiply every element in a row by a nonzero constant
3. Add elements of one row to corresponding elements of another row
ERO’s

15. Elementary Row Operations
Rowswap(Matrix, Row A, Row B)
Switches Row A and Row B
Row+(Matrix, Row A, Row B)
Adds Row A to Row B and replaces Row B
*Row(Value, Matrix, Row)
Multiplies Row by value and replaces the row
*Row+(Value, Matrix, Row A, Row B)
Multiplies Row a by the value, adds the result to Row B, and replaces Row B

16. HW 4.1 Pg

17. Section 4.2
Basic Method
If a linear programming problem has k x’s in the constraints, then a basic solution is obtained by setting k variables (except z) to zero and solving for the others.
Consider the simplex tableau
A basic solution can be found by setting any two variables to zero and solving for the others.

18. Basic Feasible Solution
Call the number of x variables in a linear programming problem k. A ______________ of the system of equations is a solution with k variables (except z) set to zero and with none of the slack variables or x’s negative.
The variables set to zero are called ___________ variables. The others are called __________ variables.
Correctly carried out, the simplex method finds only basic ____________ solutions that are corner points of the feasible region.

19. Summary Basic and Nonbasic Variables
A linear programming problem with n constraints using k variables is converted into a system of equations by including a slack variable for each constraint.
A system of n constraints in k variables converts to a system of n equations in _________ variables.
The ____________ variables are classified as either basic or nonbasic variables.
There is a basic variable for each equation, __ basic variables. The other __ variables are nonbasic.
The value of the basic variables are found by setting all nonbasic variables to ______ in each of the equations and then solving for basic variables.

20. Example
Use the simplex method to maximize z = 2x1 + 3x2 + 2x3, subject to

21. For reference:
Example continued
Since there are three x’s, all basic solutions have three variables set to zero. Using the initial tableau, the initial basic feasible solution would be ______________________________________
However, since there are negative entries in the last row, this solution is not optimal.
Now, find the pivot element

22. For reference:
Example continued
Using the pivot element, perform the following row operations to obtain the next tableau.

23. Example continued

24. Example continued The new tableau is
The basic feasible solution from the tableau is
Since there are ______________ entries in the last row, ___________ is a ____________.

25. Summary – Simplex Method
Standard Maximization Problem
Convert the problem to a system of equations:
Convert each inequality to an equation by adding a slack variable.
Write the objective function z = ax1 + bx2 + … + kxn as –ax1 – bx2 – … – kxn + z = 0.
Form the initial simplex tableau from the equations.
Locate the pivot element of the tableau:
Locate the most negative entry in the bottom row. It is in the pivot column. If there is a tie for most negative, choose either.
Divide each entry in the last column (above the line) by the corresponding entry in the pivot column. Choose the smallest positive ratio. It is in the pivot row. In case of a tie for pivot row, choose either.
The element where the pivot column and pivot row intersect is the pivot element.

26. Summary continued
Modify the simplex tableau by using row operations to obtain a new basic feasible solution.
Divide each entry in the pivot row by the pivot element to obtain a 1 in the pivot position.
Use the pivot row and row operations to obtain zeros in the other entries of the pivot column.
Determine whether z has reached its maximum.
If there is a negative entry in the last row of the tableau, z is not maximum. Repeat the process in steps 3 and 4.
If the bottom row contains no negative entries, z is maximum and the solution is available from the final tableau.

27. Summary continued Determine the solution from the final tableau.
Set k variables to zero, where k is the number of x’s used in the constraints. These are the nonbasic variables. They correspond to the columns that contain more than one nonzero entry.
Determine the values of the basic variables. These basic variables correspond to unit columns.

28. Example

29. A large agricultural program has 250 acres and $8000 available for cultivation of three crops: barley, oats, and wheat. Barley requires $10 per acre of cultivation and oats requires $15 per acre of cultivation and wheat requires $12 per acre of cultivation. Barley requires 7 hours of labor per acre, oats require 9 hours of labor per acre, and wheat requires 8 hours of labor per acre. The firm has 2100 hours of labor available. The profits per acre of each crop are: barley $60, oats $75, wheat $70. How many acres of each crop should be planted to maximize profit?

30. A stereo store sells three brands of stereo systems, brands A, B, and C. It can sell a total of 100 stereo systems per month. Brands A, B, and C take up, respectively, 5, 4, and 4 cubic feet of warehouse space, and a maximum of 480 cubic feet of warehouse space is available. Brands A, B and C generate sales commissions of $40, $20, and $30, respectively, and $3200 is available to pay sales commissions. The profit generated from the sale of each brand is $70, $210, and $140, respectively. How many of each brand of stereo system should be sold to maximize the profit?

31. The XYZ Corporation plans to open three different types of fast food restaurants. Type A restaurants require an initial cash outlay of $600,000, need 15 employees, and are expected to make an annual profit of $30,000. Type B restaurants require an initial cash outlay of $400,000, need 9 employees, and are expected to make an annual profit of $30,000. Type C restaurants require an initial cash outlay of $300,000, need 5 employees, and are expected to make an annual profit of $25,000. The XYZ Corporation has $48,000,000 available for initial outlays, does not want to hire more than 1000 new employees, and would like to open at most 70 restaurants. How many restaurants of each type should be opened to maximize the expected profit?
Ilove you

51. HW 4.2
Pg , odd, 37, 43, 45

52. 4.3 The Standard Minimum
Duality

55. Dietary Requirements A certain diet requires at least 60 units of carbohydrates, 45 units of protein, and 30 units of fat each day. Each ounce of Supplement A provides 5 units of carbohydrates, 3 units of protein, and 4 units of fat. Each ounce of Supplement B provides 2 units of carbohydrates, 2 units of protein, and 1 unit of fat. If Supplement A costs $1.50 per ounce and Supplement B costs $1.00 per ounce, how many ounces of each supplement should be taken daily to minimize the cost of the diet?

56. HW 4.3 Pg

57. 4.4
Mixed Constraints

58. Standard Max?

59. Minimizing a Function

60. Minimizing a Function

61. Your Turn

62. Standard Max?

63. Mixed Constraints
The simplex method assumes all constraints are of the form
a1x1 + a2x2 + … + anxn ______ b
Realistically this is _____________ true. The simplex method can still be used if we modify these mixed constraints.
We modify a _____ constraint by multiplying through by –1, which reverses the sign, giving a _______ constraint.
We modify an = constraint by replacing it with two constraints, a _____ and a ______ constraint. This can be done because the statement c = d is equivalent to c > d and c < d.

64. Guidelines Modification of > and = Constraints
For the simplex method:
Replace a1x1 + a2x2 + … + anxn > b
with –a1x1 – a2x2 – … – anxn < –b
Replace a1x1 + a2x2 + … + anxn = b
with a1x1 + a2x2 + … + anxn < b
and a1x1 + a2x2 + … + anxn > b
which in turn should be written
a1x1 + a2x2 + … + anxn < b
and –a1x1 – a2x2 – … – anxn < –b

65. Example
Modify the following problem and set up the initial simplex tableau. Maximize z = 8x1 + 2x2 + 6x3, subject to

66. Summary Simplex Method for Problems with Mixed Constraints
For minimization problems, maximize w = –z.
(> constraint) For each constraint of the form a1x1 + a2x2 + … + anxn > b multiply the inequality by –1 to obtain –a1x1 – a2x2 – … – anxn < –b
(= constraint) Replace each constraint of the form a1x1 + a2x2 + … + anxn = b
with a1x1 + a2x2 + … + anxn < b
and a1x1 + a2x2 + … + anxn > b
The latter is written –a1x1 – a2x2 – … – anxn < –b
Form the initial simplex tableau.

67. Summary continued
If no negative entry appears in the last column of the initial tableau, proceed to Phase II, otherwise, proceed to Phase I.
(Phase I) If there is a negative entry in the last column, change it to a positive entry by pivoting in the following manner. (Ignore a negative entry in the objective function [last row] for this step.)
The pivot row is the row containing the negative entry in the last column.
Select a negative entry in the pivot row that is to the left of the last column. The most negative entry is often a good choice. This entry is the pivot element.
Reduce the pivot element to 1 and the other entries of the pivot column to 0 using row operations.

68. Summary continued
Repeat the parts of step 6 as long as a negative entry occurs in the last column. When no negative entries remain in the last column (except possibly in the last row), proceed to Phase II.
(Phase II) The basic solution to the tableau is now feasible. Use the standard simplex procedure to obtain the optimal solution.

74. Your Turn

76. HW 4.4
Pg odd

77. Multiple Solutions No Solution
4.5
Multiple Solutions
No Solution

78. Your Turn
Maximize z = 18x + 24y, subject to

79. Multiple Solutions Section 4.5
To determine whether a problem has more than one optimal solution:
Find an optimal solution by the usual simplex method.
Look at zeros in the bottom row of the final tableau. If a zero appears in the bottom row of a column for a nonbasic variable, there might be other optimal solutions.
To find another optimal solution, if any, use the column of a nonbasic variable with a zero at the bottom as the pivot column. Find the pivot row in the usual manner, and then pivot on the pivot element.
If this new tableau gives the same optimal value of z at another point, then multiple solutions exist.
Given the two optimal solutions, all points on the line segment joining them are also optimal solutions.

80. Your Turn
Maximize z = x1 + 4x2, subject to
Unbounded = No Max

81. Unbounded Solutions
When you arrive at a simplex tableau that has no positive entries in the pivot column, the feasible region is unbounded and the objective function is unbounded. There is no maximum value and thus no solution.

82. Example continued
Checking the pivot row we find that all ratios are ___________. When this occurs, there is no _________. Since the feasible region is unbounded, a maximum value does not exist.

83. Your Turn
Maximize z = 8x1 + 24x2, subject to

84. No Feasible Solution
When a simplex tableau has a negative entry in the last column and no other entries in that row are negative, then there is no feasible solution to the problem.

85. Example continued
Since x1, s1, and s2 cannot be negative, there are no values that can be used on the left-hand side that will give a negative number. Therefore, __________________________________.

86. Summary 3 New Situations
Multiple Solutions
No Solution – Unbounded
No Solution – No feasible region

87. Summary
Multiple Solutions

88. Summary
No Solution – Unbounded

89. Summary
No Solution – No feasible region

90. HW 4.5 Pg

91. What’s happening

92. Convert to Equations

93. Setting slack variables to 0 gives the boundary lines of the feasible region

94. Initial Tableau
Basic Solution

95. Need to pick pivot

96. Need to pick pivot

100. HW 4.6 Pg

101. Sensitivity Analysis Changes in the Objective Function
How does a change in the data affect the optimal solution?
EXAMPLE
The problem to maximize z = 16x + 24y, subject to
has the solution
Maximum is z = 416 at (8,12)
How much change can occur in a device profit, and the point (8,12) still yields the maximum profit?

102. Example continued SOLUTION
Use the slopes of the boundary lines 5x + 4y = 88 and x + 2y = 32 and the slope of an arbitrary objective function, z = Ax + By, to find the answer.
The objective function with slope –A/B through (8,12) must lie between the lines 5x + 4y = 88 (slope = –5/4) and x + 2y = 32 (slope = –1/2). Thus, the slope of the objective function must lie between the slopes of the boundary lines,
Thus, device profits with a ratio between 0.5 and 1.25 will yield a maximum total profit at (8,12).
Ex. Device profits of A = 18 and B = 24 gives A/B = 18/24 = 0.75 which has a total maximum profit at (8,12).

103. A feasible region is defined by
3x + 4y ≤ 39
7x + 2y ≤ 47
x≥0, y≥0
Determine which of the following objective functions have their maximum value at the intersection of
3x + 4y = 39 and 7x + 2y = 47
A) z = 9x + 3y
B) z = 2x + 8y
C) z = 10x + 9y

104. The figure shows the feasible region determined by
4x + 5y ≤ 182
7x + 2y ≤ 170
x≥0, y≥0
Find the value of A and B so that the objective function z = Ax + BY has it maximum at (18, 22)

105. A linear programming problem seeks to maximize z = Ax + By, subject to
9x + 5y ≤ 85
25x + 6y ≤ 150
x≥0, y≥0
Find the range of slopes of the objective function so that the maximum z occurs at (0, 17)

106. A linear programming problem seeks to maximize z = Ax + By, subject to
5x + 2y ≤ 240
2x + 3y ≤ 140
x≥0, y≥0
Find the range of slopes of the objective function so that the maximum z occurs at (48, 0)

107. HW 4.7 Pg