|
|
|
||
Last update: doc. Mgr. Jan Kynčl, Ph.D. (25.01.2018)
|
|
||
Last update: doc. Andreas Emil Feldmann, Dr. (14.02.2018)
For the English version of the tutorial:
The tutorial will feature two quizzes, one midterm quiz on the topic of discrete optimization and one final quiz on the topic of continuous optimization. You need to obtain 60% of the total points of both quizzes to obtain the credit for the tutorial. |
|
||
Last update: prof. Mgr. Milan Hladík, Ph.D. (30.09.2021)
Electronic textbook (for the continuous part):
https://kam.mff.cuni.cz/~hladik/DSO/text_dso_en.pdf
Further references:
M.S. Bazaraa, H.D. Sherali, C.M. Shetty: Nonlinear Programming, Wiley, New Jersey, 2006. S. Boyd, L. Vandenberghe: Convex Optimization, Cambridge University Press, 2009. W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, A. Schrijver. Combinatorial Optimization. Wiley, New York, 1998. |
|
||
Last update: prof. Mgr. Milan Hladík, Ph.D. (28.04.2020)
For the English version of the lecture:
To participate in the exam of the lecture you need to obtain the credit for the tutorial. The exam is semi-oral, and you have three tries.
In exceptional situations, the exam can have a distance form. |
|
||
Last update: doc. Andreas Emil Feldmann, Dr. (14.02.2018)
Fundamentals of discrete optimization:
Fundamentals of continuous optimization:
|