Optimization methods: Tutorial

This page provides information about tutorials to the lectures on Optimization methods.

Tutorial conditions

Conditions for "zápočet" are:

at least 4 points from practical homeworks and
at least 40 points in total.

Students can obtain points from

3 small tests (20 points in total)
a final test (20 points)
theoretical homeworks (20 points in total)
practical homeworks (20 points in total)
activity during tutorials

General rules

Homeworks and tests must be solved independently and plagiarism is strictly forbidden.
All homeworks must be submitted before deadline. Late submissions are not accepted.
According to university regularions, students are not allowed to keep their homeworks and tests after evaluation. Students can see evaluations of their works but original papers must be given back to the teacher.

Theoretical homeworks and problem sheets

Theoretical homeworks will be given every week in problem sheets. Deadline is before next lecture. Solutions can be sent by an e-mail in the PDF format (before the lecture!) or handed a hard-copy in during the lecture. Solutions can be written by hand but then originals are required (scanned copies are rejected).

Explanations or proves are the essential parts of these theoretical homeworks. Students are expected to learn how to write mathematical proofs.

1. tutorial on 20.2.
2. tutorial on 27.2.
3. tutorial on 6.3.
4. tutorial on 13.3.
5. tutorial on 20.3.
6. tutorial on 27.3.
7. tutorial on 3.4.
8. tutorial on 10.4.
9. tutorial on 17.4.
10. tutorial on 23.4.
11. tutorial on 15.5.

Solutions of the first homeworks.

Practical homeworks

Students are expected to write a program which solves a given problem. Problems will be given during semester.

Car charging problem (deadline 22.4.2018)
Testing data:
- Small inputs for debugging.
- A collection of instances which a trivial program should solve in few minutes.
- Instances of various sizes for testing efficiency of a program.
Independence
A package for testing data.

Tests

Preliminary dates of all tests are the following.

20.3. Modelling problems using linear programming
17.4. Simplex methods
15.5. Duality and complementary slackness
22.5. Final test

Results

Results of students registered in my tutorial. Note that authentication against the university CAS is required.