In this module, you will learn how to solve a system of linear equations and describe their nature of solutions. You will define the criteria to determine the consistency of linear systems, a concept that would help you determine the nature of solutions. Lastly, you will also gain insight into analytical methods such as the Gauss elimination method, matrix inversion method, and Cramer’s rule.

In this module, you will learn about vector spaces. The concepts required to characterise vector spaces, such as linear dependence, linear independence, linear span, basis, and dimension will be discussed in detail. You will also learn linear transformation and its properties, including the rank–nullity theorem.

In this module, you will learn how to determine eigenvalues and the corresponding eigenvectors of square matrices. Certain properties of eigenvalues and eigenvectors pertaining to special matrices would be explained in detail after introducing the necessary concepts on complex numbers. You will also gain insight into computing eigenvalues numerically using the Power method.

In this module, you will explore the methods of solving a linear system numerically. You will also learn methods such as decomposition methods and iterative methods, namely Gauss–Seidel and Jacobi methods, to compute solutions of linear systems.

In this module, you will learn about the formulation of Linear Programming Problems (LPP) using practical applications. You will also gain insight into the concepts of objective function and constraints.

In this module, you will learn about the graphical solution of linear programming problems with two decision variables and the basic concepts of convex sets and application to Linear Programming Problems.

In this module, you will learn to solve an LPP algebraically by using a procedure called the simplex method. You will also be introduced to the concepts of slack and surplus variables, basic solution, and basic feasible solution. Lastly, you will learn to construct Simplex Tableau using matrix manipulation.

In this module, you will learn the concept of artificial variables. You will also learn M-method and Two-Phase method for solving LPP. You will recognize various special cases such as unboundedness, infeasibility, and alternate optima.

In this module, you will learn the construction of a dual problem and the relationship between primal and dual. You will also learn the procedure of the dual simplex method.