Mathematical Models in Economy
Code  Completion  Credits  Range  Language 

11Y1MM  KZ  2  2P+0C  Czech 
 Course guarantor:
 Lecturer:
 Tutor:
 Supervisor:
 Department of Applied Mathematics
 Synopsis:

The goal of the course is to teach selected methods of linear programming, with theoretical procedures applicable for individual tasks and their program implementation. The outcom of the course is the ability to implement and solve basic tasks from the queue theory, graph theory and both free and constrained optimization.
 Requirements:

Probability, basic knowledge of algebra and mathematical analysis.
 Syllabus of lectures:
 Syllabus of tutorials:
 Study Objective:

The goal of the course is to teach selected methods of linear programming, with theoretical procedures applicable for individual tasks and their program implementation. The outcom of the course is the ability to implement and solve basic tasks from the queue theory, graph theory and both free and constrained optimization.
 Study materials:

Study materials provided on web FD
D. P. Bertsekas: Network optimization  continuous and discrete models. Athena Scientific, 1998
Gary Chartrand: Introductory graph theory. Dover publications, Inc. New York, 1985
 Note:
 Further information:
 No timetable has been prepared for this course
 The course is a part of the following study plans: