OBJECTIVES OF THE COURSE: The subject of the course to gain knowledge in students about principles and methods for solving optimality problems including linear, quadratic and nonlinear programming, graphical methods for finding minimal route, maximal flow or other problems from the graph theory, Markov chains and queuing systems. After the course the students will be able to use its knowledge in solving real technical or economic problems as for finding the optimal solution as for its analyzing.
COURSE DESCRIPTIONS: The main topics concern: Liner programming: Models Building; Graphical Representation, Simplex method, Simplex method with integer variables, Simplex method with artificial basis, etc. Transportation problems: Methods for looking for an initial solution and optimal solution. Graph theory: Minimal spanning tree, Shortest route finding, Maximal flow problem. Markov chains, Queuing Systems. Solving optimality problems with MS Excel and Lingo.
