Module Details

The information contained in this module specification was correct at the time of publication but may be subject to change, either during the session because of unforeseen circumstances, or following review of the module at the end of the session. Queries about the module should be directed to the member of staff with responsibility for the module.
Title Optimisation
Code COMP331
Coordinator Dr M Gairing
Computer Science
M.Gairing@liverpool.ac.uk
Year CATS Level Semester CATS Value
Session 2017-18 Level 6 FHEQ First Semester 15

Aims

  1. To provide a foundation for modelling various continuous and discrete optimisation problems.
  2. To provide the tools and paradigms for the design and analysis of algorithms for continuous and discrete optimisation problems. Apply these tools to real-world problems.
  3. To review the links and interconnections between optimisation and computational complexity theory.  
  4. To provide an in-depth, systematic and critical understanding of selected significan t topics at the intersection of optimisation, algorithms and (to a lesser extent) complexity theory, together with the related research issues. 

Learning Outcomes

A conceptual understanding of current problems and techniques in the field of optimisation.

The ability to formulate optimisation models for the purpose of modelling particular applications.
The ability to use appropriate algorithmic paradigms and techniques in context of a particular optimisation model. 

Syllabus

  1. Basics: Linear Algebra, Geometry and Graph Theory. (5 lectures)
  2. Linear Programming Basics: Introduction, Definitions, Examples, Geometric and Algebraic views of Linear Programming, Mixed Integer Linear Programming (7 lectures)
  3. Linear Programming: Simplex Algorithm (6 lecture)
  4. Linear Programming: Duality (5 lectures )
  5. Algorithms for important optimisation problems (e.g. optimal trees and paths, network flows). (7 lectures)




Teaching and Learning Strategies

Lectures - Formal Lectures

Tutorials - Using standard LP solvers, exercises


Teaching Schedule

  Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other TOTAL
Study Hours           30
Formal Lectures
10
Using standard LP solvers, exercises
40
Timetable (if known)              
Private Study 110
TOTAL HOURS 150

Assessment

EXAM Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
Unseen Written Exam  150  Semester 1  75  No reassessment opportunity  Standard UoL penalty applies  Final Exam There is no reassessment opportunity, No resit opportunity for final year modules. Notes (applying to all assessments) - none 
CONTINUOUS Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
Coursework  2 sets of assessment  Semester 1  15  No reassessment opportunity  Non-standard penalty applies  Assessment 1 There is no reassessment opportunity, No resit opportunity for final year modules. Non-standard penalty applies for late submission,  
Coursework  2 sets of assessment  1st semester  10  No reassessment opportunity  Standard UoL penalty applies  Assessment 2 There is no reassessment opportunity, No resit opportunity for final year modules. 

Recommended Texts

Reading lists are managed at readinglists.liverpool.ac.uk. Click here to access the reading lists for this module.
Explanation of Reading List: