## Course Information Package

Course Unit CodeAMAT110
Course Unit Details
Number of ECTS credits allocated5
Learning Outcomes of the course unitBy the end of the course, the students should be able to:
1. Recognise the kinds of functions. Solve and draw simple equations and manipulate basic functions (linear, quadratic, exponential, and logarithmic)
2. Solve systems of linear equations (using various methods (determinants-Cramer’s method, substitution, elimination, comparison).
3. Understand the concept of a matrix (determine the size and the elements)
4. Recognize types of matrix (the symmetric matrix and the Identity).
5. Perform operations on matrices (addition, subtraction, multiplication, division by scalar).
6. Calculate the cofactors, the minors, the transpose and the inverse of a matrix in order to solve systems of linear equations.
7. Formulate and solve Linear Programming problems using the graphical method (determine and interpret the feasible region)
8. Solve Linear Programming problems using the SIMPLEX method (minimization and maximization).
Mode of DeliveryFace-to-face
PrerequisitesNONECo-requisitesNONE
Recommended optional program componentsNONE
Course Contents

Basic Algebra

Review of basic Algebra. Functions; Nature and notation, types of functions, (linear, quadratic, cubic, polynomial, rational, exponential, logarithmic). Graphical representation. Linear equations and analytical geometry of the straight line.  Linear functions.

Matrix Algebra-Simultaneous equations

The concept of a matrix. Types and properties of matrices. Transpose, inverse, symmetric, and identity matrix. Matrix algebra. Addition, subtraction, division, multiplication. Square matrices. Use of matrices to solve simultaneous equations (systems of linear equations with two or with three unknowns).

Linear programming-Formulation and graphical Solution

Inequalities in the plane. Introduction to Linear Programming. Graphical solutions for maximization and minimization. Applications in business problems. Special cases (no feasible region, unboundness and multiple solutions)

Linear programming-Formulation and Simplex Method

Further linear programming. Formulation of more complicated problems. Linear programming in 3-dimensions. The usage of Simplex Method. Duality and Sensitivity Analysis.