|
Usage of dynamic programming for proposing aircraft movements on an airport.
Uvíra, Jakub ; Grygarová, Libuše (referee) ; Zimmermann, Karel (advisor)
In this work we deal with the suggestion of the algorithm for the optimization of the sequences of the aeroplanes during the start from the airport. The dynamic programming and the linear programming been applying. Algorithms are suggested in such a way that its implementation would be possible for the quick use and that would be using the most information which have been already created. In first half of the work we cover with the task of the dynamic programming. The second half is about the linear programming which solves the conditions in which the task of the dynamic programming cannot be involved. The algorithms for creating this works are described here to be consequently solved by the help of the optimizing software.
|
|
Methods for semi-infinite programs
Peinlich, Jiří ; Zimmermann, Karel (referee) ; Grygarová, Libuše (advisor)
The aim of this work is to give an overview of methods for solving linear semi-infinite programming problems. The work also discusses various types of cutting plane method for sdemi-infinite programming problems. The work involves implementation of two types of this method in programming language Octave and the behavior of these methods is shown on examples.
|
| |
| |
| |
| |
|
Interval linear programming
Vranka, Miroslav ; Grygarová, Libuše (advisor) ; Zimmermann, Karel (referee)
Interval linear programming means miner x, M for c E c, where M == {X E IRn; Ax == b, X > O, A E A, b E b }, A C ]Rmxn, b C JRm, c C IRn, A, b, c are intervals. The first part of the master thesis introduce a new approach to interval linear programming, defining always bounded set of feasible solutions of a linear programming problem and studying its properties. The main result of this part demonstrates that the modified set of feasible solutions varies "continuously" with the entries in the matrix A and in the vector b. The second part studies the solution function continuity for an interval linear programming problem. Powered by TCPDF (www.tcpdf.org)
|