Business Mathematics II QMM-102 *** 2020-2021

Linear Equations in Linear Algebra

In-Class Activities Chapter 2 Solution

Prof: Dr. Khaled Belkadhi – Dr. Nabil Chaabane UPM - L1

Activity 1 (Augmented Matrix of a Linear System)

1. Find the augmented matrix for the given systems of linear equations.

(a) (c)
 
3x1 − 2x2 = −1
 x1 + 2x2 − x4 + x5 = 1

4x1 + 5x2 = 3 2x2 + x3 − x5 = 2
 
7x1 + 3x2 = 2 x3 + 7x4 = 1
 

(b) (d)
 
2x1 + 3x3 = 1
 x 1 = 1

3x1 − x2 + 4x3 = 7 x2 = 2
 
6x1 + x2 − x3 = 0 x3 = 3
 

2. Find the system of linear equations corresponding to the given augmented matrices.
   
2 −1 1 2 3 4
4 −6 −4 −3 −2 −1
(a) A = 
1 −1
 (c) C =   5 −6 1

1
3 0 −8 0 0 3
 
3 0 1 −4 3
−4 0 4 1 −3
  (d) D =  
0 3 −1 −1 −1 −1 3 0 −2 −9
(b) B =
5 2 0 −3 −6 0 0 0 −1 −2

Solution

1. (a)

3x1 − 2x2 = −1
 
 3 −2 −1
4x1 + 5x2 = 3 ⇐⇒ 4 5 3
7 3 2

7x1 + 3x2 = 2


(b)

2x1 + 3x3 = 1
 
 2 0 3 1
3x1 − x2 + 4x3 = 7 ⇐⇒ 3 −1 4 7
6 1 −1 0

6x1 + x2 − x3 = 0


1
UPM - L1 – Linear Equations in Linear Algebra – In-Class Activities Chapter 2 Solution 2

(c)

x1 + 2x2 − x4 + x5 = 1
 
 1 2 0 −1 1 1
2x2 + x3 − x5 = 2 ⇐⇒ 0 2 1 0 −1 2
0 0 1 7 0 1

x3 + 7x4 = 1


(d)

x 1 = 1
 
 1 0 0 1
x2 = 2 ⇐⇒ 0 1 0 2
0 0 1 3

x3 = 3


2. (a)

2

−1


2x = −1

4x = −6
4 −6 ⇐⇒
A=
1 −1 x = −1

3 0

3x = 0


(b)
  (
0 3 −1 −1 −1 3x2 − x3 − x4 = −1
B= ⇐⇒
5 2 0 −3 −6 5x1 + 2x2 − 3x4 = −6

(c)

1

2 3 4


 x1 + 2x2 + 3x3 = 4

 ⇐⇒ −4x1 − 3x2 − 2x3 = −1
−4 −3 −2 −1

C=
5 −6 1 1 
 5x1 − 6x2 + x3 = 1
−8 0 0 3

−8x1 = 3


(d)


3 0 1 −4 3


3x1 + x3 − 4x4 = 3

−4x + 4x + x = −3
−4 0 4 1 −3 1 3 4
D=
−1 ⇐⇒
3 0 −2 −9 
−x 1 + 3x 2 − 2x 4 = −9
0 0 0 −1 −2

−x = −2

4

Activity 2 (Echelon Form and Reduced Echelon Form of a Matrix)

Determine which matrices are in the echelon form and which matrices are in the reduced echelon
form
   
1 0 0 0 1 0 0 0
1. A = 0 1 0 0 0 1 1 0
3. C =  
0 0 1 1 0 0 0 0
0 0 0 1
 
  1 1 0 1 1
1 0 1 0 0 2 0 2 2
4. D =  
2. B = 0 1 1 0 0 0 0 3 3
0 0 0 1 0 0 0 0 4
UPM - L1 – Linear Equations in Linear Algebra – In-Class Activities Chapter 2 Solution 3

   
1 1 0 1 1 0 0 0
5. E = 0 0 3 1 1 1 0 0
7. G =  
0 0 0 0 0 1 1 0
0 0 1 1
 
  0 1 1 1 1
1 1 0 0 0 0 2 2 2
8. H =  
6. F = 0 1 1 0 0 0 0 0 3
0 0 1 1 0 0 0 0 0

Solution

• Matrices in echelon form: A, B, D, E, F and H.

• Matrices in reduced echelon form: A and B.

Activity 3 (Reduced Echelon Form of a Matrix)

Use the Gauss-Jordan Elimination to find the reduced echelon form of the following matrices. Circle
the pivot position in the final matrix and in the original matrix, and list the pivot columns
   
1 1 1 1 1 2 3
1 1 1 1 4. D =
2 3 4
1. A = 0 1 2 3


0 1 2 3  
  1 2 3 4
1 2 1 5. E = 4 5 6 7
2. B = 2 2 2 6 7 8 9
1 0 1
   
1 2 1 2 1 1 3 5 7
3. C = 2 1 2 1 2 6. F = 3 5 7 9
0 1 0 1 0 5 7 9 1

Solution

1.
       
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
 1 1 1 1  0 0 0 0  0 1 2 3  0 1 2 3
  R2 ← R2 − R1   R2 ↔ R3   R4 ← R4 − R2  
 0 1 2 3 −−−−−−−−−−→ 
 0 1 2 3 −−−−−−→ 
 0 0 0 0 −−−−−−−−−−→ 
 0 0 0 0
0 1 2 3 0 1 2 3 0 1 2 3 0 0 0 0

  Pivot positions
1 0 −1 −2
 0 1 2 3
R ← R1 − R2 
−−1−−−−−

−−−→  0 0 0 0
0 0 0 0
Pivot columns
UPM - L1 – Linear Equations in Linear Algebra – In-Class Activities Chapter 2 Solution 4

2.
       
1 2 1 1 2 1 1 2 1 1 2 1
1
 2 2 2 R2 ← R2 − 2R1  0 −2 0 R ← R − R R ← − R
   
 0 -2 0 2 2 0 1 0
−−3−−−−−
3
−−−→1

1 0 1
−−−−−−−−−−−→
1 0 1 −−−−−−−2−→
0 −2 0 0 −2 0

    Pivot positions
1 2 1 1 0 1
R3 ← R3 + 2R2  0 R1 ← R1 − 2R2  0
   
−−−−−−−−−−−→ 1 0 − −−−−−−−−−−→ 1 0
0 0 0 0 0 0
Pivot columns

3.
     
1 2 1 2 1 1 2 1 2 1 1 2 1 2 1
1
 2 1 2 1 2 R2 ← R2 − 2R1  0 0 R2 ← − 3 R2  0
   
−−−−−−−−−−−→ -3 0 −3 1 0 1 0
0 1 0 1 0 −−−−−−−−→
0 1 0 1 0 0 1 0 1 0

    Pivot positions
1 2 1 2 1 1 0 1 0 1
R ← R3 − R2  0 0 1 0 R ← R − 2R  0
   
−−3−−−−−−−−→ 1 −−1−−−−−1−−−−→2 1 0 1 0
0 0 0 0 0 0 0 0 0 0
Pivot columns

4.
  ! !
1 2 3 1 2 3 1 2 3
R2 ← R2 − 2R1 R2 ← −R2
2 3 4 −−−−−−−−−−−→ 0 -1 −2 −−−−−−−→ 0 1 2

! Pivot positions
1 0 −1
R ← R − 2R
−−1−−−−−1−−−−→2 0 1 2
Pivot columns

5.
     
1 2 3 4 1 2 3 4 1 2 3 4
R ← R − 4R  1
 4 5 6 7 R2 ← R2 − 6R1  0 R ← − R
  
-3 −6 −9 2 2 0 1 2 3 
−−−−−−−3−→
 
3 3 1
6 7 8 9 −−−−−−−−−−−→ 0 −5 −10 −15 0 −5 −10 −15

    Pivot positions
1 2 3 4 1 0 −1 −2
R3 ← R3 + 5R2  0 2 3 R 1 ← R1 − 2R2  0
   
−−−−−−−−−−−→ 1 −−−−−−−−−−−→ 1 2 3
0 0 0 0 0 0 0 0
Pivot columns
UPM - L1 – Linear Equations in Linear Algebra – In-Class Activities Chapter 2 Solution 5

6.
     
1 3 5 7 1 3 5 7 1 3 5 7
R ← R − 3R  1
 3 5 7 9 R2 ← R2 − 5R1  −8 −12 R2 ← − 4 R2  0
  
0 -4 1 2 3 
5
3 3
7 9 1 −−−−−−−−−−−→
1 −−−−−−−−→
0 −8 −16 −34 0 −8 −16 −34
 
1 3 5 7
   
1 3 5 7 1 3 5 0
 R1 ← R1 − 7R3 
R ← R + 8R  0 1 2 3
 
 R3 ← − 1 R3  0 1 2 3 0 1 2 0 

−−3−−−−−3−−−−→2   −−−−−−−10 R2 ← R2 − 3R3
  
−−→ −−−−−−−−−−−→
0 0 0 -10 0 0 0 1 0 0 0 1

  Pivot positions
1 0 −1 0
R ← R − 3R  0 1 2 0 
 
−−1−−−−−1−−−−→2
0 0 0 1
Pivot columns

Activity 4 (Consistent/Inconsistent Linear Systems)

In each question suppose that the augmented matrix for a linear system has been reduced to given
reduced row echelon form. State how many solutions does the system have and solve it. If the system
has more than one solution, specify the leading variables and the free variables.
   
1 0 0 0 1 0 0 0 2 −2
1. A = 0 1 0 −2 0 1 −2 0 0 1 
3. C =  
0 0 1 4 0 0 0 1 7 0 
0 0 0 0 0 0
   
1 0 0 3 2 1 2 0 0
2. B = 0 1 0 1 0 4. D = 0 0 1 0
0 0 1 −4 1 0 0 0 1

Solution

x1 x2 x3
 
1 0 0 0
1. A =  0 1 0 −2 
 

0 0 1 4
No pivot in the last column → the linear system is consistent.

x1 = 0

All variables are basic variables (no free variables) → unique solution: x2 = −2

x3 = 4


x1 x2 x3 x4
 
1 0 0 3 2
2. B =  0 1 0 1 0 
 

0 0 1 −4 1
No pivot in the last column → the linear system is consistent.
x1 , x2 and x3 are basic variables and x4 is a free variable (no pivot in column 4) → infinite number


 x1 = 2 − 3x4

x = −x
2 4
of solutions:


 x 3 = 1 + 4x4
x4 is free

UPM - L1 – Linear Equations in Linear Algebra – In-Class Activities Chapter 2 Solution 6

x1 x2 x3 x4 x5
 
1 0 0 0 2 −2
0 1 −2 0 0 1 
 
3. C =

 
 0 0 0 1 7 0 
0 0 0 0 0 0
No pivot in the last column → the linear system is consistent.
1 , x2 and x4 are basic variables. x3 and x5 are free variables → infinite number of solutions:
x


 x1 = −2 − 2x5
x2 = 1 + 2x3



x3 is free

x4 = −7x5





x is free
5

x1 x2 x3
 
1 2 0 0
4. D =  0 0 1 0 
 

0 0 0 1
There is a pivot in the last column → the system is inconsistent (no solution).

Activity 5 (Consistent/Inconsistent Linear Systems)

Suppose each matrix represents the augmented matrix for a system of linear equations. In each case,
determine if the system is consistent. If the system is consistent, determine if the solution is unique.
The leading entries () may have any nonzero value. The starred entries (*) may have any value
(including 0).
   
 ∗ ∗ ∗  ∗ ∗
1. A =  0  ∗ ∗ 3. C =  0  ∗
0 0  0 0 0 0
   
0  ∗ ∗ ∗  ∗ ∗ ∗ ∗
2. B = 0 0  ∗ ∗  4. D =  0 0  ∗ ∗
0 0 0 0  0 0 0  0

Solution

x1x2 x3
 
 ∗ ∗ ∗
1. A =  0  ∗ ∗ 
0 0  0
The system is consistent with a unique solution.
x1 x2 x3 x4
 
0  ∗ ∗ ∗
2. B =  0 0  ∗ ∗ 
0 0 0 0 
The system is inconsistent (there is a pivot in the last column).
x1x2
 
 ∗ ∗
3. C =  0  ∗ 
0 0 0
The system is consistent with a unique solution.
UPM - L1 – Linear Equations in Linear Algebra – In-Class Activities Chapter 2 Solution 7

x1 x2 x3 x4
 
 ∗ ∗ ∗ ∗
4. D =  0 0  ∗ ∗ 
0 0 0  0
The system is consistent with an infinite number of solutions (x2 is a free variable).

Activity 6 (Gauss-Jordan Elimination)

Use the Gauss-Jordan elimination to find the complete solution of the following linear systems.
 
2x − 4y + z = 3
 8x + 5y + 11z = 30

1. x − 3y + z = 5 3. −x − 4y + 2z = 3
 
3x − 7y + 2z = 12 2x − y + 5z = 12
 


 
 x1 + 2x3 + 4x4 = −8

2x − 3y = −21
x − 3x − x = 6
 2 3 4
4.
2. 3x + 2y = 1 

 3x 1 + 4x 2 − 6x 3 + 8x4 = 0

8x − 5y = −49 −x2 + 3x3 + 4x4 = −12
 

Solution

1.

2x − 4y + z = 3
   
 2 −4 1 3 1 −3 1 5
x − 3y + z = 5 ⇐⇒ 1 −3 1 5  R1 ↔ R2  2 −4 1 3
−−−−−−→
3 −7 2 12 3 −7 2 12

3x − 7y + 2z = 12

   
1 −3 1 5 1 −3 1 5
R2 ← R2 − 2R1  1
−7 R2 ← 2 R2  0 − 21 − 72 
  
R ← R − 3R  0 2 −1 1
−−3−−−−−3−−−−→1 −−−−−−−→
0 2 −1 −3 0 2 −1 −3
 
1 −3 1 5
R3 ← R3 − 2R2  0 1 − 12 − 27 
 
−−−−−−−−−−−→
0 0 0 4
| {z }
Echelon form

There is a pivot in the last column → the system is inconsistent. In this case, we don’t need to
continue to the reduced echelon form.

2.
 
− 32 − 21

2x − 3y = −21


2 −3 −21
 
1 − 32 − 21
 1 2
2 R ← R − 3R  
3x + 2y = 1 ⇐⇒  3 2 1  R1 ← 12 R1  3 2 1  R2 ← R2 − 8R1  0 13
2
65 
2
8 −5 −49 −−−−−−−→
3 3 1  
8 −5 −49 −−−−−−−−−−−→

8x − 5y = −49

0 7 35
     
3 21 3 21
1 −2 − 2 1 −2 − 2 1 0 −3 (
2 3 x = −3
R2 ← 13 R2  0 R3 ← R3 − 7R2  0 5  R1 ← R1 + 2 R2  0 5  ⇐⇒
     
1 5 − −− −−−− −−−−→ 1 1
−−−−−−−−→ −−−−−−−−−−−→ y=5
0 7 35 0 0 0 0 0 0
| {z }
Echelon Form

Remark: No pivot in the last column in echelon form matrix → the system is consistent, we have
to continue to the reduced echelon form to find the solution set.
UPM - L1 – Linear Equations in Linear Algebra – In-Class Activities Chapter 2 Solution 8

3.
  
8x + 5y + 11z = 30
 
 8 5 11 30 -1 −4 2 3
−x − 4y + 2z = 3 ⇐⇒ −1 −4 2 3  R1 ↔ R2 
 
−−−−−−→ 8 5 11 30
2 −1 5 12


2x − y + 5z = 12 2 −1 5 12
   

1 4 −2 −3
 1 4 −2 −3 1 4 −2 −3
R1 ← −R1  8 R2 ← R2 − 8R1  
R ← − 1
R
5 11 30 R ← R − 2R  0
 
−−−−−−−→
  -27 27 54  2
 −−−−−−−27 2  0 1 −1 −2
2 −1 5
3 3
12 −−−−−−−−−−−→
1 −−→
0 −9 9 18 0 −9 9 18
    
1 4 −2 −3 1 0 2 5 x = 5 − 2z

R3 ← R3 + 9R2  0 R ← R − 4R ⇐⇒ y =z−2
   
−−−−−−−−−−−→ 1 −1 −2 −−1−−−−−1−−−−→2
  0 1 −1 −2 

0 0 0 0 0 0 0 0 
z is free
| {z }
Echelon form

4.


 x1 + 2x3 + 4x4 = −8 
1 0 2 4 −8
 
1 0 2 4 −8


x − 3x − x = 6
2 3 4  0 1 −3
−1 6   0 1 −3 −1 6 
⇐⇒   R3 ← R3 − 3R1  

 3x1 + 4x2 − 6x3 + 8x4 = 0  3 4 −6 8 0  −−−−−−−−−−−→  0 4 −12 −4 24 
0 −1 3 4 −12


−x2 + 3x3 + 4x4 = −12 0 −1 3 4 −12
 
4 −8
 
1 0 2 4 −8 1 0 2
R3 ← R3 − 4R2  0 1 −3 −1 6 
 
 0 1 −3 −1 6 R3 ↔ R4 
R4 ← R4 + R2  0 0 0 0 0  −−−−−−→  0

0 0 3 −6

−−−−−−−−−−−→
0 0 0 3 −6 0 0 0 0 0
| {z }
Echelon Form
    
1 0 2 4 −8 1 0 2 0 0 
 x1 = −2x3

x

0 1 −3 −1 6  R1 ← R1 − 4R3 
 
0 1 −3 0 4

2 = 4 + 3x3
R3 ← 13 R3   ⇐⇒

 R ←R +R 
−−−−−−−→  0 0 0 1 −2 −−−
2
−−−−2−−−−→
3  0 0 0 1 −2 x
 3

 is free
0 0 0 0 0 0 0 0 0 0 x4 = −2


Activity 7 (Number of Solutions of a Linear System)

Determine for which values of k the system has no solutions, exactly one solution or infinitely many
solutions.

x + y + z = −2

1. 3x − 5y + 13z = 18

x − 2y + 5z = k


x + 2y + z = 2

2. 2x − 2y + 3z = 1

x + 2y − kz = k


x + 2y + z = 2

3. 2x − 2y + 3z = 1

x + 2y − (k 2 − 3)z = k

UPM - L1 – Linear Equations in Linear Algebra – In-Class Activities Chapter 2 Solution 9

Solution

1.
  
x + y + z = −2 −2
 
 1 1 1 −2 1 1 1
3x − 5y + 13z = 18 ⇐⇒  3 −5 13 18  R 2 ← R2 − 3R1  
R ← R − R  0 -8 10 24 
3 3 1
1 −2 5 k −−−−−−−−−−−→

x − 2y + 5z = k 0 −3 4 k + 2

 
−2
 
1 1 1 −2 1 1 1
− 54 −3 
 
R2 ← − 18 R2  0 1 − 54 −3  R 3 ← R3 + 3R2  0 1
  
−−−−−−−−→ −−−−−−−−−−−→ 1

0 −3 4 k+2 0 0 4 k−7
| {z }
Echelon Form

The system is consistent and there is no free variable → unique solution for all k ∈ R.
2.
 
 1 2 1 2
x + 2y + z = 2
 
 1 2 1 2
R ← R − 2R  0
 
-6 1 −3 
2x − 2y + 3z = 1 ⇐⇒  2 −2 3 1 R2 ← R2 − R 1  
3 3 1 
1 2 −k k −−−−−−−−−−−→
 
x + 2y − kz = k k−2

0 0 -k-1
| {z }
Echelon Form

• if k = −1: −k − 1 = 0 and k − 2 = −3 6= 0 → the obtained echelon form has a pivot in the

last column → no solution.
• if k 6= −1: −k − 1 6= 0 and is a pivot → the system is consistent and it has a unique solution.
3.
 
 1 2 1 2
x + 2y + z = 2
 
 1 2 1 2 
0 -6 1 −3 

2x − 2y + 3z = 1 ⇐⇒  2 R2 ← R2 − 2R1 
−2 3 1 R ←R −R 
 
3 3 1  
1 2 k2 − 3 k −−−−−−−−−−−→  0

x + 2y + (k 2 − 3)z = k k2 − 4 k−2
 
0
| {z }
Echelon Form

• if k 2 − 4 6= 0 ⇐⇒ k 6= 2 and k 6= −2: k 2 − 4 6= 0 and is a pivot → the system is consistent

and it has a unique solution.
• if k 2 − 4 = 0 ⇐⇒ k = −2 or k = 2
– if k = −2: k 2 − 4 = 0 and k − 2 = −4 6= 0 → the obtained echelon form has a pivot in
the last column → no solution.
– if k = 2: k 2 − 4 = 0 and k − 2 = 0 → the system is consistent and the there is no pivot
in the third column (i.e. z is a free variable) → infinite number of solutions.

Activity 8 (Application of vector equations)

A steam plant burns two types of coal: anthracite (A) and bituminous (B). For each ton of A burned,
the plant produces 27.6 million Btu of heat, 3100 grams (g) of sulfur dioxide, and 250 g of particulate
matter (solid-particle pollutants). For each ton of B burned, the plant produces 30.2 million Btu, 6400
g of sulfur dioxide, and 360 g of particulate matter.
1. How much heat does the steam plant produce when it burns x1 tons of A and x2 tons of B?
2. Suppose the output of the steam plant is described by a vector that lists the amounts of heat,
sulfur dioxide, and particulate matter. Express this output as a linear combination of two vectors,
assuming that the plant burns x1 tons of A and x2 tons of B.
UPM - L1 – Linear Equations in Linear Algebra – In-Class Activities Chapter 2 Solution 10

3. Over a certain time period, the steam plant produced 162 million Btu of heat, 23,610 g of sulfur
dioxide, and 1623 g of particulate matter. Determine how many tons of each type of coal the steam
plant must have burned. Include a vector equation as part of your solution.

Solution

1. When the steam plant burns x1 tons of A and x2 tons of B, it produces 27.6x1 + 30.2x2 million
Btu of heat.
2.
     
heat (million Btu) 27.6 30.2
 sulfur dioxide (g)  = x1 3100 + x2 6400
particulate matter (g) 250 360

3. We have to solve the vector equation:

     
27.6 30.2 162
x1 3100 + x2 6400 = 23610
250 360 1623

 
151 135
  1 138 23
 
151 135
1
 
 27.6 30.2 162  138 23
 
 R1 ← 1 R1   R2 ← R2 − 3100R1  207550

124530 
−−−→ 3100 6400 23610 R3 ← R3 − 250R1  0
 
 3100 6400 23610 −−−−−−27.6 69 23 

250 360 1623 −
− −−−−−−−−−− −−→  
250 360 1623  5965 3579

0 69 23

151 135
 
1 138 23

1 151 135
 
1 0 39

  138 23 10
69 9  5965
  
 R1 ← R1 − 151 R2  0

R2 ← 207550 R2  0 1 5  R3 ← R3 − 69 R2  0
9 9
  1 5  −−−−−−−−−−138 1 5

−−−−−−−−−−−→ 
5965 3579
 −
− −−−−−−−−−− − −
→ −−−→  
0 69 23 0 0 0 0 0 0
 39
x1 = 10 = 3.9 tons of A
⇐⇒
 x2 = 95 = 1.8 tons of B

Activity 9 (Matrix Equations)

Write the system first as a matrix equation.

( 
1.
3x1 + x2 − 5x3 = 9 8x1 − x2 = 4

x2 + 4x3 = 0 2. 5x1 + 4x2 = 1

x1 − 3x2 = 2


Solution
 
x
(
−5  1 
   
3x1 + x2 − 5x3 = 9 3 1 9
1. ⇐⇒ x2 =
x2 + 4x3 = 0 0 1 4 0
x3

8x1 − x2 = 4
   
 8 −1   4
x
2. 5x1 + 4x2 = 1 ⇐⇒ 5 4  1 = 1
x2
1 −3 2

x1 − 3x2 = 2

UPM - L1 – Linear Equations in Linear Algebra – In-Class Activities Chapter 2 Solution 11

Activity 10 (Matrix Equations)

Solve Ax = b using Gauss-Jordan elimination.

     
2 −3 2 x1 13
1. A = 3 1 −1 ; x = x2  ; b =  2 
3 −4 −3 x3 1
   
1 3 4   11
2 3 x1
2  7
2. A = 4 9 10 ; x = x2 ; b = 20
    
x3
3 −2 1 1
 
  x1  
1 −1 2 −3  x2  9
3. A = 4 0 11 −10 ; x =   x3 
 ; b = 46
3 −1 8 −6 27
x4

Solution
   
2 −3 2 13 2
1. Augmented matrix = 3 1 −1 2  =⇒ Solution: x = −1
3 −4 −3 1 3
 
1 3 4 11
2 3 2 7
2. Augmented matrix = 
4
 =⇒ Solution: No solution, the system is inconsistent.
9 10 20
3 −2 1 1

39 + 27
 
  2 x4
1 −1 2 −3 9 
 10 + 5 x4 

3. Augmented matrix = 4 0 11 −10 46 =⇒ Solution: x =  
2  ; x4 ∈ R

3 −1 8 −6 27 −10 − 4x4 
x4

Activity 11 (Applications)

A small manufacturing plant makes three types of inflatable boats: one-person, two-person, and four-
person models. Each boat requires the services of three departments, as listed in the table. The cutting,
assembly, and packaging departments have available a maximum of 380, 330, and 120 labor-hours per
week, respectively.
Department One-Person Boat Two-Person Boat Four-Person Boat
Cutting 0.5 hr 1 hr 1.5 hr
Assembly 0.6 hr 0.9 hr 1.2 hr
Packaging 0.2 hr 0.3 hr 0.5 hr

1. How many boats of each type must be produced each week for the plant to operate at full capacity?

2. How is the production schedule in question 1 affected if the packaging department is no longer
used?
3. How is the production schedule in question 1 affected if the four-person boat is no longer produced?
UPM - L1 – Linear Equations in Linear Algebra – In-Class Activities Chapter 2 Solution 12

Solution

1. Let:
x1 = number of one-person boats.
x2 = number of two-person boats.
x3 = number of four-person boats.
The system to solve is:

0.5x1 + x2 + 1.5x3 = 380 (×2)

0.6x1 + 0.9x2 + 1.2x3 = 330 (×10)

0.2x1 + 0.3x2 + 0.5x3 = 120 (×10)


by multiplying each equation with the specified coefficient, we can write the augmented matrix of
the system and solve it using Gauss-Jordan elimination.

     
1 2 3 760 1 2 3 760 1 2 3 760
R ← R − 6R 
 6 9 12 3300 R2 ← R2 − 2R1  0  R2 ← − 31 R2  0
  
-3 −6 −1260 1 2 420 
2
3 3
3 5 1200 −−−−−−−−−−−→
1 −−−−−−−−→
0 −1 −1 −320 0 −1 −1 −320
   
1 2 3 760 1 2 0 460
 R1 ← R1 − 3R3 
R3 ← R3 + R2  0 1 2 420 R ← R − 2R  0 1 0 220
 
−−−−−−−−−−→ 2 2 3
0 0 1 100 −−−−−−−−−−−→ 0 0 1 100
  
1 0 0 20 x1 = 20

R1 ← R1 − 2R2  0 1 0 220 ⇐= x2 = 220
 
−−−−−−−−−−−→ 
0 0 1 100 x3 = 100


2. We discard the third equation (packaging).

  ! !
1 2 3 760 1 2 3 760 1 2 3 760
R2 ← R2 − 6R1 R2 ← − 31 R2
6 9 12 3300 −−−−−−−−−−−→ 0 -3 −6 −1260 −−−−−−−−→ 0 1 2 420

x1 = x3 − 80
! 
1 0 −1 −80
R ← R − 2R =⇒ x2 = 420 − 2x3
−−1−−−−−1−−−−→2 0 1 2 420 
x3 free


Because x1 and x2 are non-negative, there are two conditions on x3 : x3 ≥ 80 and x3 ≤ 210
Conclusion: For every x3 four-person boats produced, 80 ≤ x3 ≤ 210, x3 − 80 one-person boats
and 420 − 2x3 two-person boats are to be produced.
3. Here, we exclude the variable x3 .

     
1 2 760 1 2 760 1 2 760
 6 R2 ← R2 − 6R1  R ← − 1
R
9 3300 R ← R − 2R  0
  
 -3 −1260 2 2 0 1 420 
2
3 3
3 1200 −−−−−−−−−−−→
1 −−−−−−−3−→
0 −1 −320 0 −1 −320
 
1 2 760
0 1 420 
 
R3 ← R3 + R2 

−−−−−−−−−−→ 
0 0 100

There is a pivot in the last column, then the system is inconsistent. No production schedule is
possible for the plant to operate at full capacity.
UPM - L1 – Linear Equations in Linear Algebra – In-Class Activities Chapter 2 Solution 13

Activity 12 (Applications)

A dietitian in a hospital is to arrange a special diet composed of three basic foods. The diet is to
include exactly 340 units of calcium, 180 units of iron, and 220 units of magnesium. The number of units
per ounce of each special ingredient for each of the foods is indicated in the table.
• Units per Ounce
• Food A Food B Food C
Calcium 30 10 20
Iron 10 10 20
Magnesium 10 30 20

1. How many ounces of each food must be used to meet the diet requirements?

2. How is the diet in question 1 affected if food C is not used?

3. How is the diet in question 1 affected if the magnesium requirement is dropped?

Solution

1. Let:
x1 = number of ounces of food A.
x2 = number of ounces of food B.
x3 = number of ounces of food C.
The system to solve is:

30x1 + 10x2 + 20x3 = 340

10x1 + 10x2 + 20x3 = 180

10x1 + 30x2 + 20x3 = 220


We can divide all the rows by 10 and switch row 1 and 2, we obtain:

     
1 1 2
18 1 1 2 18 1 1 2 18
34 R 2 ← R2 − 3R1   2 ← − 1 R2 0 1 2 10
R3 ← R3 − R1 0 −2 −4 −20 R
3 1 2
1 3 22 −−−−−−−−−−−→ 0 2
2 0 4 −−−−−−−2−→ 0 2 0 4
     
1 1 2 18 1 1 2 18 1 1 0 10
R3 ← R3 − 2R2 0 1 2 10  R3 ← − 14 R3 0 1 2 10 R 1 ← R1 − 2R3 0 1 0 2
−−−−−−−−−−−→ R2 ← R2 − 2R3
0 0 −4 −16 −−−−−−−−→ 0 0 1 4 −−−−−−−−−−−→ 0 0 1 4

x 1 = 8
 
1 0 0 8 
R ← R1 − R2 0 1 0 2 =⇒ x2 = 2
−−1−−−−−
 
−−−→
0 0 1 4

x3 = 4


2. Food C is not used, we exclude the variable x3 . We perform a Gauss-Jordan elimination and we
conclude that there is no solution.

3. We discard
 the third equation, we perform a Gauss-Jordan elimination and we find the following
x1 = 8

solution x2 = 10 − 2x3

x3 free


Because x2 is non-negative, 0 ≤ x3 ≤ 5.