Management Information Systems (MBA)

The description of the content of the course is as follows: Lesson 1: Network Analysis (Graph Theory) Lesson 2: Applications of Network Analysis (Part 1), shortest path problem, minimum spanning tree problem Lesson 3: Applications of Network Analysis (Part 2), minimum spanning tree problem, maximum flow problem Lesson 4: Project Management Lesson 5: Project management under uncertainty Lesson 6: Project compression Lesson 7: Introduction to Decision Theory - Decision trees Lesson 8: Games with full and incomplete information Lesson 9: Solving games with of two players In the end, two lectures are performed in which the concepts analyzed during the semester are summarized and revision exercises are solved.

Objectives

Students at the end of the course will have acquired basic and specialized knowledge about the following: shortest path problem minimum spanning tree problem maximum flow problem project management with the method PERT / CPM project management under uncertainty with the method PERT / CPM compression of projects decision trees complete and incomplete information games two player games (zero and non-zero-sum) They will also be able to solve exercises on the above issues.

Prerequisites

There aren't any.

Syllabus

The course consists of three modules: The first topic deals with Network Analysis problems (shortest path, minimum spanning tree, maximum flow). The second theme deals with the problem of Project Management and its solution by the method PERT / CPM. The third module deals with key issues of Decision Making Theory and Game Theory.