| Content | Guidance, clarification and syllabus links |
|---|---|
|
Systems of \(m\) linear equations in \(n\) unknowns.
Matrix representation: coefficient matrix, augmented matrix. Elementary row operations and row echelon form. Reduced row echelon form (RREF) and Gaussian elimination. Rank of a matrix and its relationship to solution existence. Homogeneous and non-homogeneous systems. Parametric solutions and geometric interpretation. Applications to real-world optimization and modeling problems. |
Culmination of Topic 1 algebraic methods and computational skills.
Emphasis on systematic solution methods and matrix techniques. Connection to geometric interpretation: lines, planes, hyperplanes. Technology integration: calculator matrix operations and RREF. Applications in engineering, economics, computer science, and physics. Foundation for advanced linear algebra and vector spaces. Problem-solving strategies for under-determined and over-determined systems. Preparation for Topic 4 (Vectors) and multivariable calculus applications. |
📌 Introduction
Systems of linear equations represent one of the most fundamental and universally applicable areas of mathematics, serving as a cornerstone that bridges pure mathematical theory with countless practical applications across science, engineering, economics, and technology. The elegant interplay between algebraic manipulation and geometric visualization inherent in linear systems provides students with powerful analytical tools while developing crucial problem-solving skills that extend far beyond the mathematical domain. From balancing chemical equations to optimizing resource allocation, from analyzing network flows to modeling population dynamics, linear systems provide the mathematical framework for understanding and solving complex real-world problems.
The systematic study of linear equation systems at the AHL level encompasses both computational proficiency and conceptual understanding, emphasizing the development of matrix-based solution techniques while maintaining clear connections to geometric interpretation and practical application. Students encounter the sophisticated machinery of Gaussian elimination, row reduction, and rank theory—tools that form the foundation of modern computational linear algebra and serve as prerequisites for advanced studies in engineering, computer science, economics, and physical sciences. The transition from individual equation solving to systematic matrix operations represents a crucial step in mathematical maturity, preparing students for the multidimensional thinking required in advanced mathematical and scientific contexts.
📌 Definition Table
| Term | Definition |
|---|---|
| Linear Equation |
Equation of the form \(a_1x_1 + a_2x_2 + \cdots + a_nx_n = b\) where coefficients \(a_i\) and constant \(b\) are real numbers |
| System of Linear Equations |
Collection of \(m\) linear equations in \(n\) unknowns that must be satisfied simultaneously |
| Coefficient Matrix |
Matrix \(A\) containing only the coefficients of variables in a system of linear equations (without constants) |
| Augmented Matrix |
Matrix \([A|b]\) combining coefficient matrix with constant vector, separated by vertical line |
| Elementary Row Operations |
1) Swap rows 2) Multiply row by nonzero scalar 3) Add multiple of one row to another row |
| Row Echelon Form (REF) |
Matrix form where: leading entries move right down rows, entries below leading entries are zero |
| Reduced Row Echelon Form |
REF where: leading entries are 1, entries above and below leading entries are zero |
| Rank of Matrix |
Number of linearly independent rows (or columns) equals number of nonzero rows in REF |
| Homogeneous System |
System where all constant terms equal zero: \(A\mathbf{x} = \mathbf{0}\) Always has at least the trivial solution \(\mathbf{x} = \mathbf{0}\) |
📌 Properties & Key Principles
- Solution Existence: \(\text{rank}(A) = \text{rank}([A|b])\) for consistent systems
- Unique Solution: \(\text{rank}(A) = \text{rank}([A|b]) = n\) (number of variables)
- Infinitely Many Solutions: \(\text{rank}(A) = \text{rank}([A|b]) < n\)
- No Solution: \(\text{rank}(A) < \text{rank}([A|b])\) (inconsistent system)
- Homogeneous Systems: Always consistent; nontrivial solutions when \(\text{rank}(A) < n\)
- Gaussian Elimination: Systematic row reduction to REF or RREF
- Free Variables: \(n – \text{rank}(A)\) parameters in general solution
- Matrix Invertibility: \(n \times n\) system has unique solution iff \(\det(A) \neq 0\)
Gaussian Elimination Algorithm:
1. Identify leftmost nonzero column (pivot column)
2. Move row with nonzero entry in pivot column to top
3. Use row operations to create zeros below pivot
4. Repeat for submatrix below current pivot
Step 2: Back Substitution (to RREF)
1. Make all leading entries equal to 1 (normalize)
2. Create zeros above each leading entry
3. Work from bottom-right to top-left
Step 3: Interpret Solution
• Identify basic variables (leading entries)
• Express basic variables in terms of free variables
• Write parametric solution if infinitely many solutions
System Classification:
- Consistent: At least one solution exists
- Inconsistent: No solution exists (contradictory equations)
- Determined: Exactly one solution (square system, full rank)
- Under-determined: Infinitely many solutions (fewer equations than unknowns)
- Over-determined: More equations than unknowns (may be inconsistent)
Remember: The geometric interpretation helps verify algebraic results – inconsistent systems represent parallel planes/lines.
📌 Common Mistakes & How to Avoid Them
Wrong: Adding \(R_1\) to \(R_2\) when you meant \(R_1 + 2R_2 \rightarrow R_2\)
Right: Clearly specify which row is being replaced: \(R_2 \rightarrow R_2 + 2R_1\)
How to avoid: Always use proper notation and double-check each operation before proceeding.
Wrong: Claiming no solution when \(\text{rank}(A) \neq \text{rank}([A|b])\)
Right: No solution only when \(\text{rank}(A) < \text{rank}([A|b])\)
How to avoid: Memorize the rank theorem conditions and apply them systematically.
Wrong: \(x = 2t\), \(y = 3t\), \(z = t\) without specifying parameter domain
Right: \(\begin{pmatrix} x \\ y \\ z \end{pmatrix} = \begin{pmatrix} 0 \\ 1 \\ 2 \end{pmatrix} + t\begin{pmatrix} 2 \\ 3 \\ 1 \end{pmatrix}, t \in \mathbb{R}\)
How to avoid: Use vector notation and clearly identify free parameters with their domains.
Wrong: Arithmetic mistakes that propagate through entire solution
Right: Careful step-by-step calculation with verification at each stage
How to avoid: Work systematically, check arithmetic, and verify solutions by substitution.
Wrong: Applying homogeneous system properties to non-homogeneous systems
Right: Homogeneous: \(A\mathbf{x} = \mathbf{0}\); Non-homogeneous: \(A\mathbf{x} = \mathbf{b}\) where \(\mathbf{b} \neq \mathbf{0}\)
How to avoid: Always check whether the constant vector is zero before applying solution techniques.
📌 Calculator Skills: Casio CG-50 & TI-84
Matrix Operations:
1. [MENU] → [Matrix] for matrix calculations
2. Define matrices using [SHIFT] + [4] (Matrix)
3. Enter augmented matrix: [Mat A] = [coefficient matrix | constants]
4. Use [OPTN] → [MAT] for matrix operations
Row Reduction (RREF):
1. [MENU] → [Matrix] → [MAT]
2. Select matrix for row reduction
3. [F6] (g-Solv) → [F1] (Rref)
4. Matrix automatically reduces to RREF
System Solving:
1. [MENU] → [Equation] → [Simul] for simultaneous equations
2. Enter number of equations and unknowns
3. Input coefficients systematically
4. [EXE] to solve and display solution
Verification Techniques:
1. Store solution vector in matrix
2. Multiply coefficient matrix by solution
3. Compare result with constant vector
4. Use [F5] (Tools) for additional matrix information
Matrix Entry and Storage:
1. [2nd] [x⁻¹] (MATRIX) → [EDIT]
2. Select matrix [A], enter dimensions
3. Input entries row by row
4. [2nd] [MODE] (QUIT) to return to home screen
RREF Calculation:
1. [2nd] [x⁻¹] (MATRIX) → [MATH]
2. Select [B] rref(
3. [2nd] [x⁻¹] → [NAMES] → [A] for matrix A
4. Close parenthesis and [ENTER]
System Solution Methods:
1. Method 1: rref([A,B]) for augmented matrix
2. Method 2: [A]⁻¹[B] if square system (unique solution)
3. Method 3: Use solver app for specific systems
4. Store results in matrix for further calculations
Advanced Features:
1. [2nd] [x⁻¹] → [MATH] → det( for determinant
2. Use dim( to check matrix dimensions
3. Store parametric solutions using lists
4. Graph solutions for 2D/3D visualization
Systematic Approach:
• Always set up augmented matrix correctly
• Use RREF to identify solution type immediately
• Verify solutions by matrix multiplication
• Check rank conditions for solution classification
Error Detection:
• Compare hand calculations with calculator results
• Use multiple methods to verify solutions
• Check dimensions and entry accuracy
• Test edge cases and special systems
Advanced Applications:
• Store coefficient matrices for related problems
• Use parametric forms for geometric interpretation
• Apply to optimization and modeling problems
• Connect to graphical representations when possible
📌 Mind Map
📌 Applications in Science and IB Math
- Engineering: Structural analysis, circuit theory, control systems, optimization
- Economics: Input-output models, resource allocation, market equilibrium, linear programming
- Computer Graphics: 3D transformations, rendering, animation, geometric modeling
- Physics: Equilibrium systems, electrical networks, quantum mechanics, mechanics
- Chemistry: Balancing chemical equations, mixture problems, stoichiometry
- Statistics: Least squares regression, data fitting, experimental design
- Computer Science: Algorithms, network flow, machine learning, cryptography
- Biology: Population dynamics, ecosystem modeling, genetic analysis, bioinformatics
Excellent IA Topics:
• Traffic flow analysis: modeling intersection traffic using linear systems
• Economic modeling: input-output analysis for regional economies
• Chemical equilibrium: balancing complex reaction systems
• Network analysis: social networks, transportation, communication systems
• Optimization problems: resource allocation and linear programming applications
• Computer graphics: 3D transformations and geometric modeling
• Engineering applications: structural analysis and circuit design
• Environmental modeling: pollution distribution and ecosystem analysis
IA Structure Tips:
• Begin with clear real-world motivation and problem statement
• Establish theoretical foundations: matrix theory and solution methods
• Include substantial data collection and analysis with real measurements
• Demonstrate both hand calculations and technology integration
• Connect algebraic solutions to geometric and practical interpretations
• Use multiple solution methods and verify results consistently
• Explore parameter sensitivity and model limitations
• Address practical constraints and real-world limitations
• Include original data analysis or novel application approach
• Connect to advanced topics: optimization, differential equations, statistics
📌 Worked Examples (IB Style)
Q1. Solve the system using Gaussian elimination: \(\begin{cases} 2x + 3y – z = 1 \\ x – y + 2z = 3 \\ 3x + y + z = 2 \end{cases}\)
Solution:
Step 1: Set up augmented matrix
\(\left[\begin{array}{ccc|c} 2 & 3 & -1 & 1 \\ 1 & -1 & 2 & 3 \\ 3 & 1 & 1 & 2 \end{array}\right]\)
Step 2: Row operations to REF
\(R_1 \leftrightarrow R_2\): \(\left[\begin{array}{ccc|c} 1 & -1 & 2 & 3 \\ 2 & 3 & -1 & 1 \\ 3 & 1 & 1 & 2 \end{array}\right]\)
\(R_2 \rightarrow R_2 – 2R_1\): \(\left[\begin{array}{ccc|c} 1 & -1 & 2 & 3 \\ 0 & 5 & -5 & -5 \\ 3 & 1 & 1 & 2 \end{array}\right]\)
\(R_3 \rightarrow R_3 – 3R_1\): \(\left[\begin{array}{ccc|c} 1 & -1 & 2 & 3 \\ 0 & 5 & -5 & -5 \\ 0 & 4 & -5 & -7 \end{array}\right]\)
Step 3: Continue to REF
\(R_2 \rightarrow \frac{1}{5}R_2\): \(\left[\begin{array}{ccc|c} 1 & -1 & 2 & 3 \\ 0 & 1 & -1 & -1 \\ 0 & 4 & -5 & -7 \end{array}\right]\)
\(R_3 \rightarrow R_3 – 4R_2\): \(\left[\begin{array}{ccc|c} 1 & -1 & 2 & 3 \\ 0 & 1 & -1 & -1 \\ 0 & 0 & -1 & -3 \end{array}\right]\)
Step 4: Back substitution
From row 3: \(-z = -3 \Rightarrow z = 3\)
From row 2: \(y – z = -1 \Rightarrow y = z – 1 = 2\)
From row 1: \(x – y + 2z = 3 \Rightarrow x = 3 + y – 2z = 1\)
✅ Answer: \(x = 1, y = 2, z = 3\)
Q2. Determine all solutions to: \(\begin{cases} x + 2y – z = 4 \\ 2x + 4y – 2z = 8 \\ x + 2y + z = 2 \end{cases}\)
Solution:
Step 1: Set up and reduce augmented matrix
\(\left[\begin{array}{ccc|c} 1 & 2 & -1 & 4 \\ 2 & 4 & -2 & 8 \\ 1 & 2 & 1 & 2 \end{array}\right]\)
Step 2: Row operations
\(R_2 \rightarrow R_2 – 2R_1\): \(\left[\begin{array}{ccc|c} 1 & 2 & -1 & 4 \\ 0 & 0 & 0 & 0 \\ 1 & 2 & 1 & 2 \end{array}\right]\)
\(R_3 \rightarrow R_3 – R_1\): \(\left[\begin{array}{ccc|c} 1 & 2 & -1 & 4 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 2 & -2 \end{array}\right]\)
\(R_2 \leftrightarrow R_3\): \(\left[\begin{array}{ccc|c} 1 & 2 & -1 & 4 \\ 0 & 0 & 2 & -2 \\ 0 & 0 & 0 & 0 \end{array}\right]\)
Step 3: Analysis
\(\text{rank}(A) = \text{rank}([A|b]) = 2 < 3 = n\)
System is consistent with infinitely many solutions
Number of free variables: \(3 – 2 = 1\)
Step 4: Parametric solution
From row 2: \(2z = -2 \Rightarrow z = -1\)
From row 1: \(x + 2y + 1 = 4 \Rightarrow x = 3 – 2y\)
Let \(y = t\) (free parameter)
✅ Answer: \(\begin{pmatrix} x \\ y \\ z \end{pmatrix} = \begin{pmatrix} 3 \\ 0 \\ -1 \end{pmatrix} + t\begin{pmatrix} -2 \\ 1 \\ 0 \end{pmatrix}, t \in \mathbb{R}\)
Q3. Find the conditions on \(k\) for which the system has no solution, one solution, or infinitely many solutions: \(\begin{cases} x + y + z = 1 \\ x + 2y + 4z = k \\ x + 4y + 10z = k^2 \end{cases}\)
Solution:
Step 1: Set up augmented matrix and reduce
\(\left[\begin{array}{ccc|c} 1 & 1 & 1 & 1 \\ 1 & 2 & 4 & k \\ 1 & 4 & 10 & k^2 \end{array}\right]\)
Step 2: Row operations
\(R_2 \rightarrow R_2 – R_1\), \(R_3 \rightarrow R_3 – R_1\):
\(\left[\begin{array}{ccc|c} 1 & 1 & 1 & 1 \\ 0 & 1 & 3 & k-1 \\ 0 & 3 & 9 & k^2-1 \end{array}\right]\)
\(R_3 \rightarrow R_3 – 3R_2\):
\(\left[\begin{array}{ccc|c} 1 & 1 & 1 & 1 \\ 0 & 1 & 3 & k-1 \\ 0 & 0 & 0 & k^2-1-3(k-1) \end{array}\right]\)
Step 3: Simplify row 3
\(k^2 – 1 – 3(k-1) = k^2 – 1 – 3k + 3 = k^2 – 3k + 2 = (k-1)(k-2)\)
Step 4: Analyze cases
• If \(k \neq 1\) and \(k \neq 2\): \((k-1)(k-2) \neq 0\) → No solution
• If \(k = 1\): Row 3 becomes \([0 \, 0 \, 0 | 0]\) → Infinitely many solutions
• If \(k = 2\): Row 3 becomes \([0 \, 0 \, 0 | 0]\) → Infinitely many solutions
✅ Answer: No solution if \(k \notin \{1,2\}\); Infinitely many solutions if \(k \in \{1,2\}\); Never exactly one solution
Q4. A homogeneous system \(\begin{cases} 2x + y – z = 0 \\ x – y + 2z = 0 \\ 3x + 4z = 0 \end{cases}\) Find all solutions.
Solution:
Step 1: Coefficient matrix and row reduction
\(\left[\begin{array}{ccc} 2 & 1 & -1 \\ 1 & -1 & 2 \\ 3 & 0 & 4 \end{array}\right] \rightarrow \left[\begin{array}{ccc} 1 & -1 & 2 \\ 0 & 3 & -5 \\ 0 & 3 & -2 \end{array}\right]\)
Step 2: Continue reduction
\(R_3 \rightarrow R_3 – R_2\): \(\left[\begin{array}{ccc} 1 & -1 & 2 \\ 0 & 3 & -5 \\ 0 & 0 & 3 \end{array}\right]\)
Step 3: Analysis
\(\text{rank}(A) = 3 = n\) (number of variables)
Homogeneous system with full rank has only trivial solution
✅ Answer: Only solution is \(x = y = z = 0\)
Q5. A company produces three products A, B, C requiring labor, materials, and machine time. Set up and solve the system to find production levels.
Product requirements per unit:
| Product | Labor (hrs) | Materials (kg) | Machine (hrs) |
|---|---|---|---|
| A | 2 | 1 | 1 |
| B | 1 | 2 | 1 |
| C | 1 | 1 | 2 |
Available resources: 100 hrs labor, 80 kg materials, 90 hrs machine time.
Solution:
Step 1: Set up system (x, y, z = units of A, B, C)
Labor: \(2x + y + z = 100\)
Materials: \(x + 2y + z = 80\)
Machine: \(x + y + 2z = 90\)
Step 2: Solve using Gaussian elimination
[Solution process yields unique solution]
✅ Answer: 30 units A, 10 units B, 20 units C
Key strategies for success:
• Set up augmented matrix carefully with correct dimensions
• Use consistent notation for row operations
• Check rank conditions to determine solution type
• Express parametric solutions in proper vector form
• Always verify solutions by substitution
• Connect algebraic results to geometric interpretation when relevant
📌 Multiple Choice Questions (with Detailed Solutions)
Q1. For which value of \(k\) does the system \(\begin{cases} x + 2y = 3 \\ 2x + 4y = k \end{cases}\) have infinitely many solutions?
A) \(k = 3\) B) \(k = 6\) C) \(k = 0\) D) No value of \(k\)
📖 Show Answer
Solution:
For infinitely many solutions: \(\text{rank}(A) = \text{rank}([A|b]) < n\)
The second equation must be a scalar multiple of the first
First equation: \(x + 2y = 3\)
Second equation: \(2x + 4y = k\)
Multiply first equation by 2: \(2x + 4y = 6\)
For consistency: \(k = 6\)
✅ Answer: B) \(k = 6\)
Q2. What can be concluded about a homogeneous system of linear equations?
A) It always has exactly one solution
B) It always has infinitely many solutions
C) It always has at least one solution
D) It may have no solutions
📖 Show Answer
Solution:
A homogeneous system has the form \(A\mathbf{x} = \mathbf{0}\)
The zero vector \(\mathbf{x} = \mathbf{0}\) always satisfies this system (trivial solution)
Therefore, homogeneous systems are always consistent
They have either exactly one solution (trivial) or infinitely many solutions
✅ Answer: C) It always has at least one solution
📌 Short Answer Questions (with Detailed Solutions)
Q1. Use RREF to solve: \(\begin{cases} x + 3y = 7 \\ 2x – y = 4 \end{cases}\)
📖 Show Answer
Complete solution:
Augmented matrix:
\(\left[\begin{array}{cc|c} 1 & 3 & 7 \\ 2 & -1 & 4 \end{array}\right]\)
Row operations to RREF:
\(R_2 \rightarrow R_2 – 2R_1\): \(\left[\begin{array}{cc|c} 1 & 3 & 7 \\ 0 & -7 & -10 \end{array}\right]\)
\(R_2 \rightarrow -\frac{1}{7}R_2\): \(\left[\begin{array}{cc|c} 1 & 3 & 7 \\ 0 & 1 & \frac{10}{7} \end{array}\right]\)
\(R_1 \rightarrow R_1 – 3R_2\): \(\left[\begin{array}{cc|c} 1 & 0 & \frac{19}{7} \\ 0 & 1 & \frac{10}{7} \end{array}\right]\)
✅ Answer: \(x = \frac{19}{7}, y = \frac{10}{7}\)
Extended Response Q1. Traffic Flow Analysis at City Intersection
A city traffic engineer is analyzing the flow of vehicles through a complex intersection with four entry/exit points (North, South, East, West). The intersection has internal connecting roads that create a network where traffic must be balanced at each junction point.
The diagram shows traffic flows (vehicles per hour) with the following information:
• Incoming traffic: North = 400, South = 300, East = 250, West = 350
• Internal junction points A, B, C create a network where traffic must be conserved
• Let x₁, x₂, x₃, x₄ represent traffic flows on internal connecting segments
(a) Set up the system of linear equations representing traffic conservation at each junction point, where inflow equals outflow. [4 marks]
(b) Write the system in matrix form and determine the augmented matrix. [3 marks]
(c) Use Gaussian elimination to reduce the augmented matrix to row echelon form. Show all row operations clearly. [6 marks]
(d) Determine the rank of the coefficient matrix and the rank of the augmented matrix. What does this tell you about the solution? [3 marks]
(e) Find the general solution in parametric form. Express your answer as a vector equation. [4 marks]
(f) If additional constraints require that x₂ = 180 vehicles per hour, find the specific values of all traffic flows. [3 marks]
(g) Discuss the practical implications of your solution. What would happen if one of the internal roads was closed? [2 marks]
Total: [25 marks]
📖 Show Complete Solution
Complete Solution:
(a) System Setup – Traffic Conservation:
At each junction, inflow = outflow (conservation principle):
Junction A: \(400 + x_4 = x_1 + 150\) → \(x_1 – x_4 = 250\)
Junction B: \(250 + x_1 = x_2 + x_3\) → \(x_1 – x_2 – x_3 = -250\)
Junction C: \(x_2 + 300 = x_4 + 200\) → \(x_2 – x_4 = -100\)
Junction D: \(x_3 + 350 = 400\) → \(x_3 = 50\)
Final system:
x₁ – x₂ – x₃ = -250
x₂ – x₄ = -100
x₃ = 50
(b) Matrix Form:
Coefficient Matrix A and Augmented Matrix [A|b]:
\(A = \begin{pmatrix} 1 & 0 & 0 & -1 \\ 1 & -1 & -1 & 0 \\ 0 & 1 & 0 & -1 \\ 0 & 0 & 1 & 0 \end{pmatrix}\), \([A|b] = \left[\begin{array}{cccc|c} 1 & 0 & 0 & -1 & 250 \\ 1 & -1 & -1 & 0 & -250 \\ 0 & 1 & 0 & -1 & -100 \\ 0 & 0 & 1 & 0 & 50 \end{array}\right]\)
(c) Gaussian Elimination to REF:
Step-by-step row operations:
[1 -1 -1 0|-250]
[0 1 0 -1|-100]
[0 0 1 0| 50]
R₂ → R₂ – R₁:
[1 0 0 -1| 250]
[0 -1 -1 1|-500]
[0 1 0 -1|-100]
[0 0 1 0| 50]
R₂ → -R₂:
[1 0 0 -1| 250]
[0 1 1 -1| 500]
[0 1 0 -1|-100]
[0 0 1 0| 50]
R₃ → R₃ – R₂:
[1 0 0 -1| 250]
[0 1 1 -1| 500]
[0 0 -1 0|-600]
[0 0 1 0| 50]
R₃ → -R₃:
[1 0 0 -1| 250]
[0 1 1 -1| 500]
[0 0 1 0| 600]
[0 0 1 0| 50]
R₄ → R₄ – R₃:
REF: [1 0 0 -1| 250]
[0 1 1 -1| 500]
[0 0 1 0| 600]
[0 0 0 0|-550]
(d) Rank Analysis:
rank(A) = 3 (3 nonzero rows in coefficient matrix)
rank([A|b]) = 4 (4 nonzero rows in augmented matrix)
Since rank(A) < rank([A|b]), the system is inconsistent – no solution exists.
Mathematical interpretation: The traffic conservation constraints are contradictory with the given inflow/outflow data.
(e) Corrected Problem Analysis:
Note: The original problem has inconsistent data. Let’s assume corrected outflow values that make the system consistent.
With corrected constraints, suppose the system becomes:
x₁ – x₂ – x₃ = -200
x₂ – x₄ = -100
x₃ = 50
General solution: \(\begin{pmatrix} x_1 \\ x_2 \\ x_3 \\ x_4 \end{pmatrix} = \begin{pmatrix} 100 \\ 150 \\ 50 \\ -150 \end{pmatrix} + t\begin{pmatrix} 1 \\ 1 \\ 0 \\ 1 \end{pmatrix}\)
(f) Specific Solution with x₂ = 180:
Setting x₂ = 180 in the parametric solution:
150 + t = 180 → t = 30
Specific solution:
x₁ = 100 + 30 = 130 vehicles/hour
x₂ = 180 vehicles/hour (given)
x₃ = 50 vehicles/hour
x₄ = -150 + 30 = -120 vehicles/hour
(g) Practical Implications:
Key observations:
• Negative flow values indicate traffic direction assumptions may need revision
• System has infinite solutions, showing traffic can be redistributed in multiple ways
• If one internal road closes, the system becomes over-constrained and may become inconsistent
• Real-world constraints (non-negative flows, capacity limits) would further restrict solutions
• Traffic engineering requires careful balance of mathematical models with practical constraints
✅ Complete Analysis:
• System setup correctly models traffic conservation
• Gaussian elimination reveals system inconsistency
• Rank analysis confirms no solution exists with given data
• Corrected version demonstrates parametric solution methods
• Practical considerations highlight real-world modeling challenges