342-0961/01 – Optimization Methods Principles (POM)

Gurantor departmentInstitute of TransportCredits10
Subject guarantordoc. Ing. Dušan Teichmann, Ph.D.Subject version guarantordoc. Ing. Dušan Teichmann, Ph.D.
Study levelpostgraduateRequirementChoice-compulsory type B
YearSemesterwinter + summer
Study languageCzech
Year of introduction2019/2020Year of cancellation
Intended for the facultiesFSIntended for study typesDoctoral
Instruction secured by
LoginNameTuitorTeacher giving lectures
TEI72 doc. Ing. Dušan Teichmann, Ph.D.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Examination 25+0
Part-time Examination 25+0

Subject aims expressed by acquired skills and competences

Course deals with detail problematics of optimization methods based on a mathematical programming including post-optimization analysis too.

Teaching methods

Individual consultations
Other activities


Course includes linear programming methods with one and more criteria, fuzzy linear programming methods, nonlinear programming methods, dynamic programming methods, compromis, composit and goal programming methods.

Compulsory literature:

BELLMANN, R., E.: Applied Dynamic programming. Princeton University Press, 2016. ISBN 978-06-916-2542-3 JONES, D.; TAMIZ, M.: Practical Goal Programming. London: Springer, 2010. ISBN 978-1-4419-5770-2 KAUR, J.; KUMAR, A.: An Introduction to Fuzzy Linear Programming Problems. Springer, 2016. ISBN 978-3-319-31274-3 SINHA, S., M.: Mathematical Programming - Theory and Methods. Elsevier, 2005. ISBN 978-00-805-3593-7 SHIMIZU, K.; ISHIZUKA, Y.; JONATHAN, F.: Nondifferentiable and Two-Level Mathematical Programming. Springer, 1997. ISBN 978-1-4615-6305-1

Recommended literature:

APT, K., R.: Principles of Constraint Programming. Cambridge University Press, 2003. ISBN 978-05-211-2549-9 FAIGLE, U.; KERN, W.; STILL, G.: Algorithmic Principles of Mathematical Programming. Springer, 2002. ISBN 978-14-020-0852-8 NOVÁK, V.; PERFILIEVA, I.; MOČKOŘ, J.: Mathematical Principles of Fuzzy Logic. Boston: Kluwer Academic Publishers, 1999. ISBN 978-1-4615-5217-8

Way of continuous check of knowledge in the course of semester

Oral examination.


Other requirements

Semestral project on the defined topic and its presentation before examiner.


Subject has no prerequisities.


Subject has no co-requisities.

Subject syllabus:

1. Linear programming methods for solving problems with one objective value 2. Fuzzy lineární programování. 3. Linear programming methods for solving problems with more objective values. 4.-5. Nonlinear programming methods with one objective value. 6. Transformation nonlinear models methods. 7. Two-level mathematical programming methods. 8. Dynamic programming methods. 9. Compromis programming methods. 10. Constraint Programming. 11. Goal programming methods.

Conditions for subject completion

Full-time form (validity from: 2019/2020 Winter semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of points
Examination Examination  
Mandatory attendence parzicipation:

Show history

Occurrence in study plans

Academic yearProgrammeField of studySpec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2021/2022 (P1041D040006) Transport Systems P Czech Ostrava Choice-compulsory type B study plan
2021/2022 (P1041D040006) Transport Systems K Czech Ostrava Choice-compulsory type B study plan
2020/2021 (P1041D040006) Transport Systems P Czech Ostrava Choice-compulsory type B study plan
2020/2021 (P1041D040006) Transport Systems K Czech Ostrava Choice-compulsory type B study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner