Study guide
2.3 Linear Algebra: Matrix Operations, Systems of Equations, and Vectors
FE Industrial and Systems Study Guide Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Overview, CBT Strategy & Handbook Navigation
1.1 FE Industrial Exam Structure, CBT Logistics, and Pacing 1.2 Using the NCEES FE Reference Handbook and Approved Calculators
2 Chapter 2: Mathematics for Industrial Engineers
2.1 Analytic Geometry, Coordinate Systems, and Trigonometry 2.2 Calculus: Differential, Integral, and Series Approximations 2.3 Linear Algebra: Matrix Operations, Systems of Equations, and Vectors
3 Chapter 3: Engineering Sciences Core
3.1 Thermodynamics Fundamentals and Fluid Flow Principles 3.2 Statics, Dynamics, and Mechanics of Materials Core 3.3 Electrical Circuits, DC/AC Analysis, and Power in Industrial Systems
4 Chapter 4: Ethics and Professional Practice
4.1 NCEES Model Rules of Professional Conduct and Technical Society Ethics 4.2 Engineering Licensure, Public Welfare, and Professional Liability 4.3 Engineering Contracts, Intellectual Property, and Conflicts of Interest
5 Chapter 5: Engineering Economics
5.1 Time Value of Money, Discount Factors, and Equivalence 5.2 Evaluating Alternatives: Present Worth, Equivalent Annual Cost, and IRR 5.3 Incremental Rate of Return, Replacement Analysis, and Break-Even 5.4 Depreciation Methods, MACRS, Income Taxes, and Inflation
6 Chapter 6: Probability Foundations & Distributions
6.1 Basic Probability Concepts, Conditional Probability, and Bayes' Theorem 6.2 Discrete Probability Distributions 6.3 Continuous Probability Distributions
7 Chapter 7: Statistical Inference, Regression & Design of Experiments
7.1 Sampling Distributions, Central Limit Theorem, and Confidence Intervals 7.2 Hypothesis Testing: Means, Proportions, and Variances 7.3 Linear Regression, Correlation Analysis, and Design of Experiments (ANOVA)
8 Chapter 8: Data, Logic, Modeling & Linear Programming
8.1 Optimization Modeling: Decision Variables, Objectives, and Constraints 8.2 Linear Programming: Graphical Solutions and Simplex Fundamentals 8.3 Duality, Sensitivity Analysis, and Integer Linear Programming 8.4 Data, Logic Development, and Analytics
9 Chapter 9: Stochastic Models & Simulation
9.1 Queuing Theory: Little's Law, M/M/1, and Multi-Server Systems 9.2 Discrete-Time Markov Chains: Transition Matrices and Steady-State Probabilities 9.3 Discrete-Event Simulation Principles and Monte Carlo Modeling
10 Chapter 10: Engineering Management, Project Planning & Performance Measurement
10.1 Organizational Structure, Leadership, and Worker Motivation Theories 10.2 Project Management: WBS, Critical Path Method (CPM), PERT, and Crashing 10.3 Earned Value Management (EVM), Decision Trees, and Risk Preference 10.4 Performance Measurement: Productivity, KPIs, Wage Systems, and the Balanced Scorecard
11 Chapter 11: Manufacturing & Production Systems
11.1 Manufacturing Processes, Material Processing, and Tolerancing 11.2 Assembly Line Balancing, Takt Time, Cycle Time, and Throughput 11.3 Sustainable Manufacturing, Waste Minimization, and Life-Cycle Assessment
12 Chapter 12: Production Planning, Inventory Control & Sequencing
12.1 Demand Forecasting Methods and Forecast Error Tracking 12.2 Aggregate Planning, Master Production Scheduling (MPS), and MRP 12.3 Deterministic Inventory Models: EOQ, EPQ, and Safety Stock 12.4 Job Sequencing, Dispatching Rules, and Flow Shop Scheduling
13 Chapter 13: Lean Systems & Theory of Constraints
13.1 Lean Foundations: Value Stream Mapping, Seven Wastes, and 5S 13.2 Pull Systems, Kanban, Just-In-Time (JIT), and SMED Setup Reduction 13.3 Theory of Constraints: Bottleneck Identification and Drum-Buffer-Rope
14 Chapter 14: Facilities Planning & Material Handling
14.1 Facility Location Analysis: Qualitative Factor Rating and Centroid Method 14.2 Facility Layout Design and Flow Analysis 14.3 Material Handling Equipment, Warehousing, and AS/RS
15 Chapter 15: Supply Chain Design & Logistics
15.1 Supply Chain Network Architecture and Transportation Modes 15.2 Distribution Strategies, Cross-Docking, and Vehicle Routing 15.3 The Bullwhip Effect, Risk Pooling, and Supply Chain Coordination
16 Chapter 16: Human Factors & Cognitive Ergonomics
16.1 Cognitive Engineering, Human-Machine Interface, Displays, and Controls 16.2 Anthropometric Principles, Percentile Design, and Biomechanical Posture 16.3 Environmental Ergonomics: Industrial Noise, Lighting, and Heat Stress
17 Chapter 17: Physical Ergonomics & Workplace Safety
17.1 Physical Ergonomics: The NIOSH Manual Lifting Equation 17.2 Cumulative Trauma Disorders and Postural Assessment 17.3 Workplace Safety: OSHA Standards, Hazard Analysis, and Control Hierarchy
18 Chapter 18: Work Design & Measurement
18.1 Methods Engineering, Process Charting, and Principles of Motion Economy 18.2 Direct Stopwatch Time Study: Observed Time, Performance Rating, and Allowances 18.3 Predetermined Time Systems, Work Sampling, and Learning Curves
19 Chapter 19: Quality Management, Six Sigma & Analytical Tools
19.1 Quality Philosophies, Total Quality Management, and Cost of Quality 19.2 Six Sigma DMAIC Methodology and Quality Function Deployment 19.3 The Seven Basic Quality Tools, Root Cause Analysis, and Taguchi Loss Function
20 Chapter 20: Statistical Process Control
20.1 Statistical Process Control Principles, Variation, and Run Rules 20.2 Variable Control Charts: X-bar & R, X-bar & S, and Individual-Moving Range 20.3 Attribute Control Charts: Defectives (p, np) and Defects (c, u)
21 Chapter 21: Process Capability & Acceptance Sampling
21.1 Process Capability Indices and Defect Levels 21.2 Acceptance Sampling Concepts and Operating Characteristic Curves 21.3 Sampling Risks, AQL, LTPD, and Standard Sampling Plans
22 Chapter 22: Systems Engineering & Life-Cycle Management
22.1 The Systems Engineering V-Model, Stakeholder Requirements, and Functional Architecture 22.2 Configuration Management, Interface Control, and Verification & Validation 22.3 Life-Cycle Costing, Maintainability, and System Availability
23 Chapter 23: Reliability Engineering & Risk Analysis
23.1 Reliability Mathematics, Hazard Rates, and the Bathtub Curve 23.2 System Reliability Configurations: Series, Parallel, and k-out-of-n Systems 23.3 Failure Modes and Effects Analysis and Fault Tree Analysis
2.3 Linear Algebra: Matrix Operations, Systems of Equations, and Vectors
Key Takeaways Explain This Topic AI
Matrix multiplication is non-commutative (AB != BA), and the transpose and inverse of a matrix product reverse the multiplication sequence: (AB)^T = B^T * A^T and (AB)^(-1) = B^(-1) * A^(-1).
Multiplying an n x n square matrix by a scalar c scales its determinant by c^n according to det(c*A) = c^n * det(A), while the determinant of the matrix inverse satisfies det(A^(-1)) = 1 / det(A).
A system of linear equations A*x = b possesses a unique solution if and only if det(A) != 0 and rank(A) = rank([A | b]) = n (full rank).
In industrial engineering, the Simplex algorithm evaluates basic solutions via x_B = B^(-1) b and shadow prices via pi = c_B * B^(-1), while discrete Markov chains model long-run equilibrium via pi P = pi.
The vector dot product u . v = ||u||*||v||*cos(theta) tests for orthogonality when equal to zero, whereas the cross product u x v produces an orthogonal vector whose magnitude equals the area of the spanned parallelogram.
Last updated: September 2026
Linear algebra is the foundational mathematical language of industrial systems engineering. It forms the computational mechanics beneath the Simplex method in Linear Programming (LP), discrete-time Markov chains in queuing and reliability, Input-Output Leontief models in supply chain logistics, and 3D vector statics in material handling equipment. Mastery of matrix properties, determinants, inverses, eigenvalues, and vectors is a high-yield competency on the NCEES FE exam.
- 1. Matrix Operations and Fundamental Algebraic Properties
- Matrix Conformability and Multiplication
A matrix of dimensions m × n m \times n m × n possesses m m m rows and n n n columns. Two matrices A A A and B B B can be added or subtracted if and only if their dimensions are identical ( m × n m \times n m × n ).
Matrix multiplication C = A B C = A B C = A B is conformable if and only if the number of columns in A A A equals the number of rows in B B B : ( m × k ) × ( k × n ) ⟹ ( m × n ) (m \times k) \times (k \times n) \implies (m \times n) ( m × k ) × ( k × n ) ⟹ ( m × n )
Each entry c i j c_{ij} c ij in the product matrix is the dot product of row i i i of matrix A A A and column j j j of matrix B B B : c i j = ∑ r = 1 k a i r b r j c_{ij} = \sum_{r=1}^k a_{ir} b_{rj} c ij = r = 1 ∑ k a i r b r j
Core Properties of Matrix Algebra
Non-Commutative : In general, A B ≠ B A A B \neq B A A B = B A . Even if both A B A B A B and B A B A B A exist and share identical square dimensions, their product matrices are typically unequal.
Associative : A ( B C ) = ( A B ) C A(B C) = (A B)C A ( BC ) = ( A B ) C and k ( A B ) = ( k A ) B = A ( k B ) k(A B) = (k A)B = A(k B) k ( A B ) = ( k A ) B = A ( k B ) .
Distributive : A ( B + C ) = A B + A C A(B + C) = A B + A C A ( B + C ) = A B + A C and ( A + B ) C = A C + B C (A + B)C = A C + B C ( A + B ) C = A C + BC .
Identity Matrix ( I I I ) : A square matrix with ones on the main diagonal and zeros elsewhere, satisfying A I = I A = A A I = I A = A A I = I A = A .
Matrix Transpose and Inverse Properties
The transpose A T A^T A T is formed by swapping the row and column indices of A A A (i.e., ( A T ) i j = a j i (A^T)_{ij} = a_{ji} ( A T ) ij = a ji ):
- ( A T ) T = A (A^T)^T = A ( A T ) T = A
- ( A + B ) T = A T + B T (A + B)^T = A^T + B^T ( A + B ) T = A T + B T
- Reversal of Product Transpose : ( A B ) T = B T A T (A B)^T = B^T A^T ( A B ) T = B T A T (order reverses!)
A square matrix is symmetric if A T = A A^T = A A T = A , and skew-symmetric if A T = − A A^T = -A A T = − A .
A square matrix A A A has an inverse A − 1 A^{-1} A − 1 if and only if its determinant is non-zero ( det ( A ) ≠ 0 \det(A) \neq 0 det ( A ) = 0 , non-singular): A A − 1 = A − 1 A = I A A^{-1} = A^{-1} A = I A A − 1 = A − 1 A = I
Reversal of Product Inverse : ( A B ) − 1 = B − 1 A − 1 (A B)^{-1} = B^{-1} A^{-1} ( A B ) − 1 = B − 1 A − 1 (order reverses!)
Inverse Transpose : ( A T ) − 1 = ( A − 1 ) T (A^T)^{-1} = (A^{-1})^T ( A T ) − 1 = ( A − 1 ) T
Orthogonal Matrix : A matrix where A T = A − 1 A^T = A^{-1} A T = A − 1 , which means A T A = I A^T A = I A T A = I .
- 2. Determinants, Inverses, and Scaling Rules
- Calculating Determinants
2 × 2 2 \times 2 2 × 2 Matrix : det [ a b c d ] = a d − b c \det \begin{bmatrix} a & b \\ c & d \end{bmatrix} = ad - bc det [ a c b d ] = a d − b c
2 × 2 2 \times 2 2 × 2 Matrix Inverse : [ a b c d ] − 1 = 1 a d − b c [ d − b − c a ] \begin{bmatrix} a & b \\ c & d \end{bmatrix}^{-1} = \frac{1}{ad - bc} \begin{bmatrix} d & -b \\ -c & a \end{bmatrix} [ a c b d ] − 1 = a d − b c 1 [ d − c − b a ]
3 × 3 3 \times 3 3 × 3 Matrix (Cofactor Expansion along Row 1) : det [ a 11 a 12 a 13 a 21 a 22 a 23 a 31 a 32 a 33 ] = a 11 ( a 22 a 33 − a 23 a 32 ) − a 12 ( a 21 a 33 − a 23 a 31 ) + a 13 ( a 21 a 32 − a 22 a 31 ) \det \begin{bmatrix} a_{11} & a_{12} & a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33} \end{bmatrix} = a_{11}(a_{22} a_{33} - a_{23} a_{32}) - a_{12}(a_{21} a_{33} - a_{23} a_{31}) + a_{13}(a_{21} a_{32} - a_{22} a_{31}) det a 11 a 21 a 31 a 12 a 22 a 32 a 13 a 23 a 33 = a 11 ( a 22 a 33 − a 23 a 32 ) − a 12 ( a 21 a 33 − a 23 a 31 ) + a 13 ( a 21 a 32 − a 22 a 31 )
Exam Trap : Remember the alternating signs of the cofactors: + − + + - + + − + across the first row. The middle term MUST carry a minus sign: − a 12 M 12 -a_{12} M_{12} − a 12 M 12 .
Critical Determinant Theorems Tested on the FE
Matrix Property Mathematical Theorem FE Exam Context
Scalar Multiplication det ( c A ) = c n det ( A ) \det(c A) = c^n \det(A) det ( c A ) = c n det ( A ) for n × n n \times n n × n matrix Multiplying every row by constant c c c factors out c c c from each of the n n n rows.
Product Determinant det ( A B ) = det ( A ) det ( B ) \det(A B) = \det(A) \det(B) det ( A B ) = det ( A ) det ( B ) Determinant of a combined multi-stage linear transformation.
Inverse Determinant det ( A − 1 ) = 1 det ( A ) \det(A^{-1}) = \frac{1}{\det(A)} det ( A − 1 ) = d e t ( A ) 1 Directly follows from det ( A A − 1 ) = det ( I ) = 1 \det(A A^{-1}) = \det(I) = 1 det ( A A − 1 ) = det ( I ) = 1 .
Transpose Determinant det ( A T ) = det ( A ) \det(A^T) = \det(A) det ( A T ) = det ( A ) Reflection across the main diagonal preserves volume scaling.
Singular Matrix det ( A ) = 0 ⟺ A − 1 does not exist \det(A) = 0 \iff A^{-1} \text{ does not exist} det ( A ) = 0 ⟺ A − 1 does not exist Rows or columns are linearly dependent (rank < n < n < n ).
3. Systems of Linear Equations: Existence, Uniqueness, and Methods
A system of m m m linear equations in n n n unknowns is written in matrix form as: A x = b A \mathbf{x} = \mathbf{b} A x = b
Where A A A is the m × n m \times n m × n coefficient matrix, x \mathbf{x} x is the n × 1 n \times 1 n × 1 vector of decision variables, and b \mathbf{b} b is the m × 1 m \times 1 m × 1 right-hand-side requirements vector.
The Rouché-Capelli Theorem (Rank Conditions)
To determine the solvability of A x = b A \mathbf{x} = \mathbf{b} A x = b , analyze the rank of the coefficient matrix A A A and the augmented matrix [ A ∣ b ] [A \mid \mathbf{b}] [ A ∣ b ] : Linear System: A x = b
- ├── rank(A) < rank([A | b]) ──────> Inconsistent (No solution)
- └── rank(A) = rank([A | b]) = r
- ├── r = n (Full rank) ───────> Consistent: Unique solution
- └── r < n (Underdetermined) ──> Consistent: Infinite solutions (n - r free variables)
- Solution Techniques
Matrix Inversion : If A A A is square ( n × n n \times n n × n ) and det ( A ) ≠ 0 \det(A) \neq 0 det ( A ) = 0 : x = A − 1 b \mathbf{x} = A^{-1} \mathbf{b} x = A − 1 b
Gaussian Elimination : Applies elementary row operations to reduce [ A ∣ b ] [A \mid \mathbf{b}] [ A ∣ b ] to upper triangular row echelon form, followed by back substitution. The standard algorithm used in computer solvers.
Cramer's Rule : For a square system where det ( A ) ≠ 0 \det(A) \neq 0 det ( A ) = 0 , the i i i -th unknown x i x_i x i is computed directly as: x i = det ( A i ) det ( A ) x_i = \frac{\det(A_i)}{\det(A)} x i = det ( A ) det ( A i ) Where A i A_i A i is the matrix formed by replacing the i i i -th column of A A A with the right-hand-side vector b \mathbf{b} b .
- 4. Eigenvalues, Eigenvectors, and System Dynamics
- The Characteristic Equation
For an n × n n \times n n × n matrix A A A , a scalar λ \lambda λ is an eigenvalue and a non-zero vector v \mathbf{v} v is its corresponding eigenvector if: A v = λ v ⟺ ( A − λ I ) v = 0 A \mathbf{v} = \lambda \mathbf{v} \quad \iff \quad (A - \lambda I)\mathbf{v} = \mathbf{0} A v = λ v ⟺ ( A − λ I ) v = 0
Because v ≠ 0 \mathbf{v} \neq \mathbf{0} v = 0 , the system has non-trivial solutions if and only if the coefficient matrix is singular: det ( A − λ I ) = 0 \det(A - \lambda I) = 0 det ( A − λ I ) = 0
This yields the n n n -th degree characteristic polynomial . Its roots are the eigenvalues λ 1 , λ 2 , … , λ n \lambda_1, \lambda_2, \dots, \lambda_n λ 1 , λ 2 , … , λ n .
Fundamental Eigenvalue Invariants
Trace Relationship : The sum of the eigenvalues equals the trace (sum of main diagonal elements) of matrix A A A : ∑ i = 1 n λ i = tr ( A ) = ∑ i = 1 n a i i \sum_{i=1}^n \lambda_i = \operatorname{tr}(A) = \sum_{i=1}^n a_{ii} i = 1 ∑ n λ i = tr ( A ) = i = 1 ∑ n a ii
Determinant Relationship : The product of the eigenvalues equals the determinant of A A A : ∏ i = 1 n λ i = det ( A ) \prod_{i=1}^n \lambda_i = \det(A) i = 1 ∏ n λ i = det ( A )
These two invariants provide an instantaneous check on the FE exam: if the eigenvalues you calculate do not sum to the trace of A A A or multiply to det ( A ) \det(A) det ( A ) , an arithmetic error occurred.
5. Vector Operations: Dot Product, Cross Product, and Projections
Let vectors u = u x i + u y j + u z k \mathbf{u} = u_x \mathbf{i} + u_y \mathbf{j} + u_z \mathbf{k} u = u x i + u y j + u z k and v = v x i + v y j + v z k \mathbf{v} = v_x \mathbf{i} + v_y \mathbf{j} + v_z \mathbf{k} v = v x i + v y j + v z k with angle θ \theta θ between them:
Dot Product (Scalar Product) u ⋅ v = u x v x + u y v y + u z v z = ∥ u ∥ ∥ v ∥ cos θ \mathbf{u} \cdot \mathbf{v} = u_x v_x + u_y v_y + u_z v_z = \|\mathbf{u}\| \|\mathbf{v}\| \cos \theta u ⋅ v = u x v x + u y v y + u z v z = ∥ u ∥∥ v ∥ cos θ
Orthogonality Test : u ⋅ v = 0 ⟺ u ⊥ v \mathbf{u} \cdot \mathbf{v} = 0 \iff \mathbf{u} \perp \mathbf{v} u ⋅ v = 0 ⟺ u ⊥ v (non-zero vectors are perpendicular).
Vector Magnitude : ∥ u ∥ = u ⋅ u = u x 2 + u y 2 + u z 2 \|\mathbf{u}\| = \sqrt{\mathbf{u} \cdot \mathbf{u}} = \sqrt{u_x^2 + u_y^2 + u_z^2} ∥ u ∥ = u ⋅ u = u x 2 + u y 2 + u z 2 .
Angle Between Vectors : cos θ = u ⋅ v ∥ u ∥ ∥ v ∥ \cos \theta = \frac{\mathbf{u} \cdot \mathbf{v}}{\|\mathbf{u}\| \|\mathbf{v}\|} cos θ = ∥ u ∥∥ v ∥ u ⋅ v .
Scalar Component of u \mathbf{u} u on v \mathbf{v} v : comp v ( u ) = u ⋅ v ∥ v ∥ \operatorname{comp}_{\mathbf{v}}(\mathbf{u}) = \frac{\mathbf{u} \cdot \mathbf{v}}{\|\mathbf{v}\|} comp v ( u ) = ∥ v ∥ u ⋅ v .
Vector Projection of u \mathbf{u} u on v \mathbf{v} v : proj v ( u ) = ( u ⋅ v ∥ v ∥ 2 ) v \operatorname{proj}_{\mathbf{v}}(\mathbf{u}) = \left( \frac{\mathbf{u} \cdot \mathbf{v}}{\|\mathbf{v}\|^2} \right) \mathbf{v} proj v ( u ) = ( ∥ v ∥ 2 u ⋅ v ) v
Cross Product (Vector Product in 3D)
The cross product u × v \mathbf{u} \times \mathbf{v} u × v produces a vector perpendicular to both u \mathbf{u} u and v \mathbf{v} v according to the right-hand rule: u × v = det [ i j k u x u y u z v x v y v z ] = ( u y v z − u z v y ) i − ( u x v z − u z v x ) j + ( u x v y − u y v x ) k \mathbf{u} \times \mathbf{v} = \det \begin{bmatrix} \mathbf{i} & \mathbf{j} & \mathbf{k} \\ u_x & u_y & u_z \\ v_x & v_y & v_z \end{bmatrix} = (u_y v_z - u_z v_y)\mathbf{i} - (u_x v_z - u_z v_x)\mathbf{j} + (u_x v_y - u_y v_x)\mathbf{k} u × v = det i u x v x j u y v y k u z v z = ( u y v z − u z v y ) i − ( u x v z − u z v x ) j + ( u x v y − u y v x ) k
Anti-Commutative : u × v = − ( v × u ) \mathbf{u} \times \mathbf{v} = -(\mathbf{v} \times \mathbf{u}) u × v = − ( v × u ) .
Magnitude : ∥ u × v ∥ = ∥ u ∥ ∥ v ∥ sin θ \|\mathbf{u} \times \mathbf{v}\| = \|\mathbf{u}\| \|\mathbf{v}\| \sin \theta ∥ u × v ∥ = ∥ u ∥∥ v ∥ sin θ , which equals the area of the parallelogram formed by u \mathbf{u} u and v \mathbf{v} v .
Parallelism Test : u × v = 0 ⟺ u \mathbf{u} \times \mathbf{v} = \mathbf{0} \iff \mathbf{u} u × v = 0 ⟺ u and v \mathbf{v} v are collinear (parallel).
- 6. Industrial Engineering Applications: LP Simplex and Markov Chains
- Linear Programming (LP) Simplex Matrix Mechanics
In an LP with standard constraints A x = b , x ≥ 0 A \mathbf{x} = \mathbf{b}, \mathbf{x} \ge \mathbf{0} A x = b , x ≥ 0 , the matrix A A A is partitioned into basic columns B B B ( m × m m \times m m × m ) and non-basic columns N N N ( m × ( n − m ) m \times (n - m) m × ( n − m ) ): [ B ∣ N ] [ x B x N ] = b ⟹ B x B + N x N = b [B \mid N] \begin{bmatrix} \mathbf{x}_B \\ \mathbf{x}_N \end{bmatrix} = \mathbf{b} \quad \implies \quad B \mathbf{x}_B + N \mathbf{x}_N = \mathbf{b} [ B ∣ N ] [ x B x N ] = b ⟹ B x B + N x N = b
Basic Feasible Solution (BFS) : Set non-basic variables to zero ( x N = 0 \mathbf{x}_N = \mathbf{0} x N = 0 ), giving: x B = B − 1 b \mathbf{x}_B = B^{-1} \mathbf{b} x B = B − 1 b
Simplex Multipliers (Dual Variables / Shadow Prices) : With objective vector partitioned as c = [ c B ∣ c N ] \mathbf{c} = [\mathbf{c}_B \mid \mathbf{c}_N] c = [ c B ∣ c N ] , the shadow price vector π \boldsymbol{\pi} π is: π = c B B − 1 \boldsymbol{\pi} = \mathbf{c}_B B^{-1} π = c B B − 1
Reduced Costs (Relative Profits) : For entering variable selection: c ˉ j = c j − π a j = c j − c B B − 1 a j \bar{c}_j = c_j - \boldsymbol{\pi} \mathbf{a}_j = c_j - \mathbf{c}_B B^{-1} \mathbf{a}_j c ˉ j = c j − π a j = c j − c B B − 1 a j
Discrete-Time Markov Chains (DTMC)
A discrete Markov chain models system state transitions across time steps. The square transition probability matrix P = [ p i j ] P = [p_{ij}] P = [ p ij ] satisfies p i j ≥ 0 p_{ij} \ge 0 p ij ≥ 0 and row sum ∑ j p i j = 1 \sum_{j} p_{ij} = 1 ∑ j p ij = 1 .
n n n -Step Transitions : The transition probabilities after n n n operational steps are given by the matrix power P n P^n P n .
Steady-State (Stationary) Probability Distribution ( π \boldsymbol{\pi} π ) : For an irreducible and ergodic chain, the long-run probability vector π = [ π 1 , π 2 , … , π k ] \boldsymbol{\pi} = [\pi_1, \pi_2, \dots, \pi_k] π = [ π 1 , π 2 , … , π k ] satisfies: π P = π and ∑ i = 1 k π i = 1 \boldsymbol{\pi} P = \boldsymbol{\pi} \quad \text{and} \quad \sum_{i=1}^k \pi_i = 1 π P = π and i = 1 ∑ k π i = 1 Notice that this is a linear system: π ( P − I ) = 0 \boldsymbol{\pi}(P - I) = \mathbf{0} π ( P − I ) = 0 . It represents finding the normalized left eigenvector of matrix P P P corresponding to eigenvalue λ = 1 \lambda = 1 λ = 1 .
- 7. Step-by-Step Worked Engineering Examples
- Worked Example 2.3.1: Steady-State Availability of a Machine Workcell
Problem : An automated CNC mill operates in two operational states: State 1 (Operational) and State 2 (Under Maintenance). Hourly transition probabilities are defined by matrix P P P : P = [ 0.8 0.2 0.4 0.6 ] P = \begin{bmatrix} 0.8 & 0.2 \\ 0.4 & 0.6 \end{bmatrix} P = [ 0.8 0.4 0.2 0.6 ]
Compute the long-run stationary probability π 1 \pi_1 π 1 that the machine is operational.
Solution :
Formulate the steady-state equation π P = π \boldsymbol{\pi} P = \boldsymbol{\pi} π P = π with normalization π 1 + π 2 = 1 \pi_1 + \pi_2 = 1 π 1 + π 2 = 1 : [ π 1 π 2 ] [ 0.8 0.2 0.4 0.6 ] = [ π 1 π 2 ] [\pi_1 \quad \pi_2] \begin{bmatrix} 0.8 & 0.2 \\ 0.4 & 0.6 \end{bmatrix} = [\pi_1 \quad \pi_2] [ π 1 π 2 ] [ 0.8 0.4 0.2 0.6 ] = [ π 1 π 2 ]
Expand the column equations: Column 1: 0.8 π 1 + 0.4 π 2 = π 1 ⟹ 0.4 π 2 = 0.2 π 1 ⟹ π 1 = 2 π 2 \text{Column 1: } 0.8 \pi_1 + 0.4 \pi_2 = \pi_1 \quad \implies \quad 0.4 \pi_2 = 0.2 \pi_1 \quad \implies \quad \pi_1 = 2 \pi_2 Column 1: 0.8 π 1 + 0.4 π 2 = π 1 ⟹ 0.4 π 2 = 0.2 π 1 ⟹ π 1 = 2 π 2 Column 2: 0.2 π 1 + 0.6 π 2 = π 2 ⟹ 0.2 π 1 = 0.4 π 2 ( redundant ) \text{Column 2: } 0.2 \pi_1 + 0.6 \pi_2 = \pi_2 \quad \implies \quad 0.2 \pi_1 = 0.4 \pi_2 \quad (\text{redundant}) Column 2: 0.2 π 1 + 0.6 π 2 = π 2 ⟹ 0.2 π 1 = 0.4 π 2 ( redundant )
Substitute π 1 = 2 π 2 \pi_1 = 2 \pi_2 π 1 = 2 π 2 into the normalization condition π 1 + π 2 = 1 \pi_1 + \pi_2 = 1 π 1 + π 2 = 1 : 2 π 2 + π 2 = 1 ⟹ 3 π 2 = 1 ⟹ π 2 = 1 3 ≈ 0.3333 2 \pi_2 + \pi_2 = 1 \quad \implies \quad 3 \pi_2 = 1 \quad \implies \quad \pi_2 = \frac{1}{3} \approx 0.3333 2 π 2 + π 2 = 1 ⟹ 3 π 2 = 1 ⟹ π 2 = 3 1 ≈ 0.3333
Calculate π 1 \pi_1 π 1 : π 1 = 2 ( 1 3 ) = 2 3 ≈ 0.6667 \pi_1 = 2 \left(\frac{1}{3}\right) = \frac{2}{3} \approx 0.6667 π 1 = 2 ( 3 1 ) = 3 2 ≈ 0.6667
Engineering Conclusion : In the long run, the milling cell is operational 66.7 % 66.7\% 66.7% of the time.
Worked Example 2.3.2: 3D Force Torque Vector via Cross Product
Problem : A maintenance gantry crane cable exerts a tension force vector F = 4 i − 2 j + 6 k kN \mathbf{F} = 4\mathbf{i} - 2\mathbf{j} + 6\mathbf{k}\text{ kN} F = 4 i − 2 j + 6 k kN at point P P P . The position vector from the pivot origin to point P P P is r = 2 i + 3 j − 1 k m \mathbf{r} = 2\mathbf{i} + 3\mathbf{j} - 1\mathbf{k}\text{ m} r = 2 i + 3 j − 1 k m . Compute the resulting torque (moment) vector M = r × F \mathbf{M} = \mathbf{r} \times \mathbf{F} M = r × F .
Solution :
Set up the determinant form: M = r × F = det [ i j k 2 3 − 1 4 − 2 6 ] \mathbf{M} = \mathbf{r} \times \mathbf{F} = \det \begin{bmatrix} \mathbf{i} & \mathbf{j} & \mathbf{k} \\ 2 & 3 & -1 \\ 4 & -2 & 6 \end{bmatrix} M = r × F = det i 2 4 j 3 − 2 k − 1 6
Expand by cofactors along the top row: i -component : ( 3 ) ( 6 ) − ( − 1 ) ( − 2 ) = 18 − 2 = 16 i \mathbf{i}\text{-component}: (3)(6) - (-1)(-2) = 18 - 2 = 16\mathbf{i} i -component : ( 3 ) ( 6 ) − ( − 1 ) ( − 2 ) = 18 − 2 = 16 i j -component : − [ ( 2 ) ( 6 ) − ( − 1 ) ( 4 ) ] = − [ 12 − ( − 4 ) ] = − [ 16 ] = − 16 j \mathbf{j}\text{-component}: -[(2)(6) - (-1)(4)] = -[12 - (-4)] = -[16] = -16\mathbf{j} j -component : − [( 2 ) ( 6 ) − ( − 1 ) ( 4 )] = − [ 12 − ( − 4 )] = − [ 16 ] = − 16 j k -component : ( 2 ) ( − 2 ) − ( 3 ) ( 4 ) = − 4 − 12 = − 16 k \mathbf{k}\text{-component}: (2)(-2) - (3)(4) = -4 - 12 = -16\mathbf{k} k -component : ( 2 ) ( − 2 ) − ( 3 ) ( 4 ) = − 4 − 12 = − 16 k
Combine terms: M = 16 i − 16 j − 16 k kN ⋅ m \mathbf{M} = 16\mathbf{i} - 16\mathbf{j} - 16\mathbf{k}\text{ kN}\cdot\text{m} M = 16 i − 16 j − 16 k kN ⋅ m
8. NCEES Reference Handbook Tips & Realistic Exam Traps
The Scalar Matrix Scaling Determinant Trap : If a question states that an n × n n \times n n × n matrix A A A has det ( A ) = 4 \det(A) = 4 det ( A ) = 4 and asks for det ( 3 A ) \det(3A) det ( 3 A ) , the answer is NOT 3 × 4 = 12 3 \times 4 = 12 3 × 4 = 12 . For an n × n n \times n n × n matrix, every row is multiplied by 3 3 3 , which factors out 3 n 3^n 3 n : det ( 3 A ) = 3 n det ( A ) \det(3A) = 3^n \det(A) det ( 3 A ) = 3 n det ( A ) . For a 3 × 3 3 \times 3 3 × 3 matrix, det ( 3 A ) = 3 3 ( 4 ) = 27 × 4 = 108 \det(3A) = 3^3 (4) = 27 \times 4 = 108 det ( 3 A ) = 3 3 ( 4 ) = 27 × 4 = 108 .
Order Reversal in Inverses and Transposes : Remember that ( A B ) − 1 = B − 1 A − 1 (AB)^{-1} = B^{-1} A^{-1} ( A B ) − 1 = B − 1 A − 1 and ( A B ) T = B T A T (AB)^T = B^T A^T ( A B ) T = B T A T . Questions frequently present A − 1 B − 1 A^{-1} B^{-1} A − 1 B − 1 or A T B T A^T B^T A T B T as attractive distractors.
Cramer's Rule Column Placement : In Cramer's rule x i = det ( A i ) det ( A ) x_i = \frac{\det(A_i)}{\det(A)} x i = d e t ( A ) d e t ( A i ) , replace the i i i -th column of A A A with b \mathbf{b} b , not the i i i -th row. Interchanging rows instead of columns will lead to completely incorrect solutions.
Cross Product Non-Commutativity : Vector cross products are anti-commutative: r × F = − ( F × r ) \mathbf{r} \times \mathbf{F} = -(\mathbf{F} \times \mathbf{r}) r × F = − ( F × r ) . Computing moment as F × r \mathbf{F} \times \mathbf{r} F × r will produce the opposite signs across every vector component.