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 C Ikenmeyer
Computer Science
Christian.Ikenmeyer@liverpool.ac.uk
Year CATS Level Semester CATS Value
Session 2021-22 Level 6 FHEQ First Semester 15

Aims

To provide a foundation for modelling various continuous and discrete optimisation problems.
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.
To review the links and interconnections between optimisation and computational complexity theory.   
To provide an in-depth, systematic and critical understanding of selected significant topics at the intersection of optimisation, algorithms and (to a lesser extent) complexity theory, together with the related research issues. 


Learning Outcomes

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

(LO2) The ability to formulate optimisation models for the purpose of modelling particular applications.

(LO3) The ability to use appropriate algorithmic paradigms and techniques in context of a particular optimisation model. 

(S1) Critical thinking and problem solving - Critical analysis


Syllabus

 

Basics: Linear Algebra, Geometry and Graph Theory. (5 lectures)

Linear Programming Basics: Introduction, Definitions, Examples, Geometric and Algebraic views of Linear Programming, Mixed Integer Linear Programming (7 lectures)

Linear Programming: Simplex Algorithm (6 lecture)

Linear Programming: Duality (5 lectures )

Algorithms for important optimisation problems (e.g. optimal trees and paths, network flows). (7 lectures)


Teaching and Learning Strategies

Teaching Method 1 - Lectures
Description: Formal Lectures
Attendance Recorded: Not yet decided

Teaching Method 2 - Tutorials
Description: Using standard LP solvers, exercises
Attendance Recorded: Not yet decided

Due to Covid-19, in 2021/22, one or more of the following delivery methods will be implemented based on the current local conditions.
(a) Hybrid delivery
Teaching Method 1 - Lecture
Description: Mix of on-campus/on-line synchronous/asynchronous sessions
Teaching Method 2 - Tutorials
Description: Mix of on-campus/on-line synchronous/asynchronous sessions

(b) Fully online delivery and assessment
Teaching Method 1 - Lecture
Description: On-line synchronous/asynchronous lectures
Teaching Method 2 - Tutorials
Description: On-line synchronous/asynchronous sessions

(c) Standard on-campus delivery
Teaching Method 1 - Lecture
Description: Mix of on-campus/on-line synchronous/asynchronous sessions
Teaching Method 2 - Tutorials
Description: On-campus synchronous sessions


Teaching Schedule

  Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other TOTAL
Study Hours 30

  10

      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
(331) Final Exam Standard UoL penalty applies for late submission. This is an anonymous assessment. Assessment Schedule (When) :Semester 1  150 minutes.    70       
CONTINUOUS Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
(331.2) Assessment 2 Standard UoL penalty applies for late submission. This is not an anonymous assessment. Assessment Schedule (When) :1st semester  2 sets of assessment    15       
(331.1) Assessment 1 Non-standard penalty applies for late submission - This is not an anonymous assessment. Assessment Schedule (When) :Semester 1  2 sets of assessment    15       

Recommended Texts

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