Úloha lineárního programování

Abstract

This thesis deals with optimization problems without constraints and with constraints, as well as with linear programming problems in general, including methods of their solution. Among these methods, the interior point method and the simplex algorithm are discussed. This paper then concludes with examples of the use of optimization on transportation problems. Specifically, this is the problem of time coordination of connections at interchanges and the problem of~vehicle circulations.