Optimization methods: Tutorial
This page provides information about tutorials to the lectures on Optimization methods.Tutorial conditions
A student must obtain at least 55 points to pass this tutorial and to obtain "zápočet". Points can be gained from tests (30 points in total), practical homeworks (30 points) and theoretical homeworks (40 points).Tests
There will be two tests during semester.Practical homeworks
Students are expected to write a program which solves a given problem. Problems will be given during semester.Theoretical homeworks
Theoretical homeworks will be given every week in problem sheets. Deadlines are next tutorials. Solutions can be sent by an e-mail in the PDF format (before the tutorial!) or handed a hard-copy in during the tutorial. 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.
General rules
- Homeworks and tests must be solved independently and plagiarism is strictly forbidden.
Problem sheets with homeworks
- 1. tutorial on 25.2.
- 2. tutorial on 3.3.
- 3. tutorial on 10.3.
- 4. tutorial on 17.3.
- 5. tutorial on 24.3.
- 6. tutorial on 31.3.
- 7. tutorial on 7.4.
- 8. tutorial on 14.4.
- 9. tutorial on 21.4.
- 10. tutorial on 28.4.
- 11. tutorial on 5.5.
- 12. tutorial on 12.5.
- 13. tutorial on 19.5.
Practical homeworks
- Squares (the first deadline 10.4.2016, the second deadline 24.4.2016)
- Graph without oriented cycles (deadline 8.5.2016)
Test
- 14.5.
- Solve an LP problem using simplex method
- Model a given problem using LP
- Prove a statement about linear, affine and convex spaces
- 26.5.
- Solve an LP problem using two-step simplex method (with the auxiliary problem to find a feasible basis)
- Write a dual and complementary slackness conditions for a given LP problem
- Prove two statements