Course Details
Applications of mathematical methods in economics
Academic Year 2023/24
DA67 course is part of 12 study plans
D-P-C-SI (N) / PST Winter Semester 2nd year
D-P-C-SI (N) / FMI Winter Semester 2nd year
D-P-C-SI (N) / KDS Winter Semester 2nd year
D-P-C-SI (N) / MGS Winter Semester 2nd year
D-P-C-SI (N) / VHS Winter Semester 2nd year
D-K-C-SI (N) / VHS Winter Semester 2nd year
D-K-C-SI (N) / MGS Winter Semester 2nd year
D-K-C-SI (N) / PST Winter Semester 2nd year
D-K-C-SI (N) / FMI Winter Semester 2nd year
D-K-C-SI (N) / KDS Winter Semester 2nd year
D-K-C-GK / GAK Winter Semester 2nd year
D-K-E-SI (N) / PST Winter Semester 2nd year
Finding the cheapest spanning tree of a graph.
Finding the shortest path in a graph.
Determining the maximum flow in a network.
NP-complete problems.
Travelling salesman problem.
Linear programming.
Transport prpoblem.
Integer programming.
Basics of the theory of games.
Course Guarantor
Institute
Objective
Syllabus
2. Basics of graph theory II.
3. Finding the minimum soanning tree in a graph.
4. Finding the shortest path in a graph.
5. Determining a maximum flow in a network I.
6. Determining a maximum flow in a network II.
7. NP-complete problems.
8. Travelling salesman problem.
9. Travelling salesman problem, heuristic methods.
10. Linear programming, theoretical basis.
11. Simplex metoda.
12. Integer programming.
13. Matrix games, solutions in mixed strategies.
Prerequisites
Language of instruction
Czech
Credits
10 credits
Semester
Forms and criteria of assessment
Specification of controlled instruction, the form of instruction, and the form of compensation of the absences
Offered to foreign students
Course on BUT site
Lecture
13 weeks, 3 hours/week, elective
Syllabus