Explore UCD

UCD Home >

COMP30930

Academic Year 2024/2025

Optimisation (COMP30930)

Subject:
Computer Science
College:
Science
School:
Computer Science
Level:
3 (Degree)
Credits:
5
Module Coordinator:
Dr Deepak Ajwani
Trimester:
Spring
Mode of Delivery:
On Campus
Internship Module:
No
How will I be graded?
Letter grades

Curricular information is subject to change.

This module is an introduction to basic optimisation techniques, including linear programming, integer linear programming, convex optimisation, meta-heuristics and combinatorial optimisation.

About this Module

Learning Outcomes:

On completion of this module, students should be able to:
1. Understand the basic optimisation techniques
2. Model real-world problems in terms of linear programming and integer linear programming
3. Competently apply the basic optimisation techniques to solve problems in various domains, including machine learning
4. Gain a fundamental understanding of convex optimisation and gradient-based approaches

Indicative Module Content:

Fundamentals of Optimisation
Linear Programming (Simplex Method)
Integer Programming
NP-Hardness and Approximation Algorithms
Meta-heuristics (e.g., Genetic programming, Simulated Annealing)
Combinatorial Optimisation
Convex Optimisation (including gradient-based optimisation)

Student Effort Hours:
Student Effort Type Hours
Lectures

24
Tutorial

24
Autonomous Student Learning

80
Total

128

Approaches to Teaching and Learning:
Lectures; Active/task-based learning; Enquiry & problem-based learning

Requirements, Exclusions and Recommendations

Not applicable to this module.


Module Requisites and Incompatibles
Not applicable to this module.
 

Assessment Strategy
Description Timing Component Scale Must Pass Component % of Final Grade In Module Component Repeat Offered
Assignment(Including Essay): Assignment to assess if a student is able to model a real-world problem into a LP or ILP, use a solver to solve that formulation showing an understanding of how ILPs are solved. Week 7, Week 8 Alternative linear conversion grade scale 40% No
30
 No
Assignment(Including Essay): Assignment to assess if a student is able to model a real-world problem into LP or ILP, use a solver to solve that formulation. Also, there can be some questions on convex optimisation. Week 11, Week 12 Alternative linear conversion grade scale 40% No
20
 No
Exam (In-person): An in-person end of trimester examination consisting of longer questions to test the understanding of optimisation concepts as well as short answer questions End of trimester
Duration:
1 hr(s)
 Alternative linear conversion grade scale 40% No
50
 No

Carry forward of passed components
No
 

Resit In Terminal Exam
Summer No
Please see Student Jargon Buster for more information about remediation types and timing. 

Feedback Strategy/Strategies

• Feedback individually to students, post-assessment
• Group/class feedback, post-assessment

How will my Feedback be Delivered?

Formative assessment in tutorial sessions; For the assignments, a group feedback will be provided post-assessment and an individual feedback will be posted on the Brightspace VLE later.

"Algorithms for Optimization" by Mykel J. Kochenderfer and Tim A. Wheeler (https://mitpress.mit.edu/books/algorithms-optimization)
"Understanding and Using Linear Programming" by Jiří Matoušek and Bernd Gärtner
"Combinatorial Optimization" by Papadimitriou and Steiglitz

Name Role
Mr Jiwei Zhang Tutor

Timetabling information is displayed only for guidance purposes, relates to the current Academic Year only and is subject to change.
Spring Tutorial Offering 1 Week(s) - 20, 21, 22, 23, 24, 25, 26, 29, 30, 31, 32, 33 Thurs 12:00 - 13:50
Spring Lecture Offering 1 Week(s) - 20, 21, 22, 23, 24, 25, 26, 29, 30, 31, 32, 33 Tues 13:00 - 13:50
Spring Lecture Offering 1 Week(s) - 20, 21, 22, 23, 24, 25, 26, 29, 30, 31, 32, 33 Tues 16:00 - 16:50
Print this page
Fill in the following details:
Enter the body of your query here.

From time to time UCD would like to send you further information that we feel, based on your enquiry, would be of interest to you.