Test 2 review: Weeks 7-10

Checklist: Do you know how to:

1. Add, Subtract, Multiply by scalar, Multiply Matrices
2. Find the determinant of 2x2 Matrices
3. Find the inverse of 2x2 Matrix
4. Find the determinant of 3x3Matrices
5. Find the inverse of 3x3 Matrix
6. How to solve 2x2 and 3x3 systems of equations by:
 Cramer’s Rule
 Inverse Matrix
 Gauss-Jordan Elimination/Augmented Matrix Method
 Can you write Row operations in the standard form
7. Solve Linear Programming Problem by Graphical Approach:
 Find the Feasible Solution Region (F.S.)
 Recognize Bounded F.S. from Unbounded F.S. What that means for an existence of
Max/Min.
 Find the Corners of F.S.
 Recognize and set the Objective Function
 Define the Decision Variables***
 Shade the solution (truth) or non-solution (false)
 Find the optimal solution from the Table or from the Graph
8. Solve Linear Programming Problem by Simplex Method:
 Formulate the linear programming model
 Set the constraints
 Set the non-negativity conditions for decision variables
 Express the Objective Function
 Introduce the slack variables
 Set the non-negativity conditions for slack variables
 Set up the Initial Simplex Tableau
 Differentiate basic variable from the non-basic variable
 Explain the Feasible Solution Set after each step/iteration
 Recognize entering and exiting variables.
 Find the pivot element
 Pivot the column
 Recognize when:
 Optimal solution was found
 Additional pivot needed
 Optimal solution does not exist
 Interpret the optimal solution in the context of the problem
 Explain the shadow prices
If your answers to all these questions YES, you have nothing to worry about and you are ready for the TEST 2.
Good Luck!!!
Part 1.Solve by the method of your choice. Make sure to use all three Methods.

Question 1
3x + 6y = 60
5x + 4y = 52

Question 2
The equilibrium condition for two substitute goods is given by
5P1 -2P2 =15
-P1 +8P2 =16
Find the equilibrium prices.
Gauss-Jordan Elimination:

Question 3

Question4
6x + 2y + 5z = 73
7x – 3y + z = -1
4x + 8y – 9z = -9
Solve using the Cramer’s Rule:
Part 2.
1. For the given matrix, find:
a) The minors
b) The cofactors of the third row.

[ ]
9 11 4
A= 3 2 7
6 10 4

Cij= (-1)i+jMij(-1)2,4,6 even=1 Cofactor is identical to the Minor.

(-1)3,5,7 odd=-1 Cofactor is opposite to the Minor.
a) M31=, M32, M33
 b) C31=, C32=, C33=

2. For the given matrix, find:

c) The minors
d) The cofactors of the second row.

[ ]
13 6 11
B= 12 9 4
7 10 2

3. Use the determinants to determine whether a unique solution exists (x,y), or (x,y,z) for each of the
following systems od equations:
a) 12x1 +7x2 =147
15x1 +19x2 =168
b) 2x1 +3x2 =27
6x1 +9x2 =81

c) 4x1 +3x2 +5x3=27

x1 +6x2 +2x3=19
3x1 +x2 +3x3=15

d) 4x1 +2x2 +6x3=28

3x1 +x2 +2x3=20
10x1 +5x2 +15x3=70

4. For the given Matrix of Cofactors find:

[ ]
13 −2 8
Matrix of Cofactors C= −9 6 −4
−3 2 −1
a) M11=
b) C11=
c) M23=
d) C23=
e) M31=
f) C31=

5. Find the determinant | A|of the given matrix if in addition matrix of Cofactor is given.

[ ] [ ]
2 4 −3 −16 −8 4
A= 3 −5 2 C= −17 1 −10
−1 3 2 −7 −13 −22
 6. Use the fact that the following two matrices are inverses of each other to solve each system of linear
equations:

[ ] [ ]
1 2 2 5 −2 −2
1 3 2 and −1 1 0
1 2 3 −1 0 1

{
x+ 2 y +2 z=1
a) x+3 y +2 z=−1
x+2 y +3 z=−1

{
5 x −2 y −2 z=3
b) −x+ y =4
−x + z=1

Part 3. Linear Programming Graphical Approach:

1.
 a) I
b) II
c) III
d) IV

2.
 a) I
b) II
c) III
d) IV

3.
 a) I
b) II
c) III
d) IV

4. Minimize the objective function 7x+4y subject to constraints:

4
3

5
2
6

1
 Part 4. Linear Programming Simplex Method:
1. Consider the simplex tableau

x1 x2 s1 s2 P RHS/Totals

1 4 0 5 0 12

0 3 1 -2 0 15

0 4 0 -2 1 10

a) Identify the basic variables

b) Identify non-basis variables
c) Find the corresponding basic feasible solution
d) Determine whether :
 the optimal solution has been found, NO, there is still a negative indicator in the last row.
 an additional pivot is required. Pivot is 5. This is your answer
 or the problem has no optimal solution.

2. Consider the simplex tableau

x1 x2 x3 s1 s2 s3 P

-2 0 1 3 5 0 0 18

0 1 0 -2 0 0 0 25

-3 0 0 3 4 1 0 11

5 0 0 5 3 0 1 24

a) Identify the basic variables

b) Identify non-basis variables
c) Find the corresponding basic feasible solution
d) Determine whether :
 the optimal solution has been found, yes there are no more negative indicators in the bottom
row. This is your answer
 an additional pivot is required,
 or the problem has no optimal solution.
3. Consider the simplex tableau
x1 x2 s1 s2 P

-2 1 0 2 0 30

-2 0 1 3 0 22

-5 0 0 -3 1 21
a) Identify the basic variables
b) Identify non-basis variables
c) Find the corresponding basic feasible solution
d) Determine whether:
 the optimal solution has been found, No still negative indicators in the bottom row.
 an additional pivot is required, but pivot DNE
 or the problem has no optimal solution.
4. Consider the simplex tableau
x1 x2 s1 s2 P

1 3 1 0 0 4

2 3 0 1 0 28

-10 -5 0 0 1 0

a) The pivot element is

b) The entering variable is
c) The exiting variables is
d) Identify the pivot operation needed to pivot the pivot column.

Table after pivoting:

x1 x2 s1 s2 P

1 3 1 0 0 4

0 -3 -2 1 0 20

0 25 10 0 1 40

Optimal solution was found. P=?