Tentalabbet

TAOP89 · 8 credits · Basic level (G2F) · Matematik, Tillämpad matematik

Optimisation for IT

Active · next start HT 2026

61%

passed the latest ordinary exam

TEN1 · 28 Oct 2025 · 31 students

72%

passed the ordinary exams, all sittings over the last 5 years

TEN1 · 152 students

79%

Harder than 79% of courses at basic level

Compared with 874 courses at the same level, ordinary exams over the last three academic years. 59 students.

Part of 1 programme

Exam

TEN1 Written examination

  • 5
  • 4
  • 3
  • U

Ordinary exams

72% passed · 152 students

  • 61%31
  • 61%28
  • 72%32
  • 81%27
  • 82%34

Re-exams

31% passed · 29 students

  • 14%7
  • 0%5
  • 43%7
  • 50%10
  • Pass the re-exam: 31% (29 students), compared with 72% (152 students) on the ordinary exam
  • Get 4 or 5: 25% (181 students)
Show small sittings (5)

Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.

  • 50%4
  • 50%4
  • 33%3
  • 33%3
  • 75%4

Other modules

Partial exams, hand-ins and labs. They are not part of the figures at the top.

Hand-in or lab

LAB1 Lab work

  • G

Main rounds

100% passed · 97 students

  • 100%17
  • 100%20
  • 100%23
  • 100%18
  • 100%19

Later rounds

100% passed · 5 students

  • 100%5
  • Pass a later round: 100% (5 students), compared with 100% (97 students) on the ordinary exam
Show small sittings (24)

Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.

  • 100%1
  • 100%2
  • 100%2
  • 100%2
  • 100%2
  • 100%1
  • 100%1
  • 100%4
  • 100%2
  • 100%1
  • 100%1
  • 100%1
  • 100%1
  • 100%2
  • 100%1
  • 100%2
  • 100%2
  • 100%1
  • 100%3
  • 100%1
  • 100%1
  • 100%1
  • 100%3
  • 100%2

Other module

BAS1 Work in PBL group

  • G

Main rounds

100% passed · 156 students

  • 100%28
  • 100%32
  • 100%31
  • 100%31
  • 100%34

Later rounds

No sittings with at least 5 students.

    About the course

    Aim

    After the course, the student should

    1) in mathematical modeling and the use of software to solve optimization problems be able to:

    • (M1) identify optimization issues and formulate mathematical models for common optimization problems;
    • (M2) combine knowledge in modeling optimization problems, use of optimization software and programming to solve a given optimization problem, and conduct a plausibility assessment and analysis of the results
    • (M3) apply optimization theory to problems in sustainable development and analyze the results;

    2) in solution methods and theory be able to:use basic concepts and theorems and select and apply appropriate methods to solve and analyze optimization problems

    • (M4) that are modeled with continuous decision variables and
    • (M5) that are modeled with discrete decision variables or in the form of networks, and
    • (M6) develop heuristics for structured optimization problems, and within the framework of what is described by the course content; as part of (M4), (M5) and (M6) clearly report calculations and reasoning, and make simple plausibility assessments of the results.

    3) within the framework of PBL group work:

    • (M7) independently and in a group be able to identify learning needs in relation to given problems related to the semester's courses and
    • (M8) collaborate with colleagues both in learning and in problem solving, and lead technical problem solving situations linked to the semester's areas.

    Content

    Introduction to optimization, problem formulation, graphical solution, computational complexity, problem complexity.

    The simplex method, linear duality and sensitivity analysis. Basic graph theory and overview of different optimization problems in graphs.

    Models and methods for finding minimal spanning tree, minimum cost traveling salesman tour, minimum cost postman tour, shortest path, minimum cost assignment, minimum cost flow and maximal flow.

    Methods for integer programming, especially branch-and-bound, cutting planes and dynamic programming. Heuristics for hard combinatorial optimization problems.

    Examples on applications that concern different aspects within sustainable development, for instance concerning a scenario that is common for several courses.

    Examiner
    Björn Morén
    Scheduled hours
    68 h
    Main field of study
    Matematik, Tillämpad matematik
    Syllabus on Studieinfo ↗