Courses Catalogue

Linear Programming

COURSE CODE: COS 1203
COURSE CREDIT UNIT: 3
ACADEMIC PROGRAMME: Computer Science, B.Sc
COLLEGE/SCHOOL/FACULTY: School of Mathematics and Computing
STATUS: Core
PROGRAMME TYPE: Undergraduate

Course Content and Outline

Objectives:

The major aims of the course are to:

1.      Teach the student how to analyze and formulate LP problems

2.      Introduce the student to the different methods of solving LP problems

3.      Teach the student how to analyze and formulate LP problems

4.      Introduce the student to the different methods of solving LP problems

5.      Expose the student to the graphical method for solving LP problems

6.      Introduce the student to the Simplex method for solving LP problems

7.      Teach the student how to formulate the dual of the primal LP problem

8.      Expose the student to the sensitivity analysis methods for LP problems

 

Learning outcomes:

On completion of this course unit, the students will be able to:

  1. Identify problems that  be solved under limited resources
  2. Formulate an LP Problem
  3. Solve the LP problem using LP methods
  4. Formulate both the Dual and Primal LP problems

Carry out a sensitivity-analysis (post-optimality analysis) of the formulated LP problem

Expose the student to the graphical method for solving LP

Topics to cover:

  • Geometry of LP problems 5hrs
  • Simplex method for solving LPs 7hrs
  • Duality theory of LP 5hrs
  • Sensitivity analysis 7hrs
  • Network flow problems 7hrs
  • Intro to path-following Interior Point Methods 7hrs
  • Intro to Integer Linear Programming 7hrs