Linear and Discrete Optimization
| Code | School | Level | Credits | Semesters |
| COMP4130 | School of Computer Science | 4 | 20 | Autumn China |
- Code
- COMP4130
- School
- School of Computer Science
- Level
- 4
- Credits
- 20
- Semesters
- Autumn China
Summary
The module provides an entry point to computational optimization techniques, particularly for modelling and solving linear and discrete optimization problems like diet optimization, network flows, task assignment, scheduling, bin-packing, travelling salesmen, facility location, vehicle routing and related problems.
Optimization sits at the interface of computer science and mathematics. Optimization is considered one of the key techniques within the broad spectrum of artificial intelligence methods. Optimization focuses on making decisions instead of predicting or identifying patterns. Optimization is also one of the most important areas within operations research (OR), which is a discipline that uses modelling techniques, analytics and computational methods to solve complex problems in industry and business.
In this module, you will learn to interpret and develop algebraic models for a variety of real-world linear and discrete optimization problems to then use powerful optimization software (linear, integer and mixed-integer solvers) to produce a solution. The module covers topics such as linear programming, integer programming, combinatorial optimization, modelling and optimization software, multi-objective optimization, simplex method, and branch and bound method among others. Optimization technology is ubiquitous in today's world, for applications in logistics, finance, manufacturing, workforce planning, product selection, healthcare, and any other area where the limited resources must be used efficiently. Optimization enables prescriptive analytics to support and automate decision-making.
Target Students
Available to Level 3 and 4 students in the School of Computer Science. This module is not available to students not listed above without explicit approval from the module convenor(s). This module is part of the Artificial Intelligence, Modelling and Optimisation theme in the School of Computer Science.
Classes
- One 2-hour workshop each week for 11 weeks
- One 2-hour lecture each week for 11 weeks
- One 1-hour computing each week for 11 weeks
Assessment
- 70% Coursework 1
- 30% Examsys in Person (2-hour): Examsys in Person
Assessed by end of autumn semester
Educational Aims
To develop an understanding of linear and discrete optimization, one of the most important areas within artificial intelligence and operations research.To develop the skills for modelling a range of optimization problems in business and industry using mathematical programming models.To implement those models using algebraic and spreadsheet optimization solvers to obtain solutions to the corresponding optimization problem.To develop skills for identifying, analysing, modelling and solving real-world linear and discrete optimization problems.Learning Outcomes
Knowledge and Understanding
Fundamental concepts of linear and discrete optimization from the computer science and mathematical perspectives.
Algebraic models for linear and discrete optimization problems.
Post-optimality analysis and multi-objective optimization.
Simplex method and Branch and Bound method.
Intellectual Skills
Analytical methods to identify components of optimization problems.
Developing algebraic and spreadsheet models of optimization problems.
Reasoning and evaluation of solutions to optimization models.
Professional Practical Skills
Use of algebraic and spreadsheet optimization software to solve optimization problems in a range of application domains.
Critical evaluation of computer optimization models and their solutions.
Application of optimization as an AI technique for decision-making.
Transferable Skills
Critical thinking
Problem solving
Communication skills
Computational and mathematical skills.