|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
Nutritional problem – horse nutrition
Svatoň, Jindřich ; Skočdopolová, Veronika (advisor) ; Šindelářová, Irena (referee)
This work deals with the composition of daily feeding ration for different types of horses. The objective is to create a specific feeding ratio consisting of various horses feed at minimum costs and meeting requirements for nutritional conditions. Several other recommendations that cannot be overlooked in horse nutrition are also considered. The age of the horse, the weight in adulthood, the horse's workload, and an annual period is taken into account of this work. Daily feeding ration is composed and solved by linear programming, the optimal solution is found by using MS Excel 2007 solver. The solution of this task is to create a model that can be applied in practice.
|
|
|
The Optimalization of diet composition with the use of goal programming
Hrubá, Lucie ; Skočdopolová, Veronika (advisor) ; Kuncová, Martina (referee)
The nutritive problem is characteristic task for linear programming whose role is to propose daily dose of nutrients in nourishment. The goal is to set up balanced menu for the individual person. Goal programming is used in case when is not necessary to have exact restricted conditions. The conditions are set up so final value is getting closer to assigned value that is target value. In this work will be goal programming utilized for model modification of the nutritive problem. For the nutritive problem is possible to use goal programming so particular limitation of nutrients level in nourishment will not be restricted rigorously in a form of inequalities, but so that final value is getting closer either from the top or from the bellow target value. Firstly will be created the model for linear programming with minimum costs following the model with goal programming and after that comparison will be done.
|
|
|
Optimalization of labor force in a Family Hotel
Balšánková, Tereza ; Skočdopolová, Veronika (advisor) ; Šindelářová, Irena (referee)
Primary objective of this bachelor thesis "Optimalization of laber force in a Family Hotel" is to solve the linear task of optimalization of the work force in the family hotel Balkan utilizing the Hungarian method and sub-sequently using the optimalization system LINGO. For optimalization is used the modification of assignment problem, which belongs to typical tasks of linear programing, so called distribution task. Theoretical part of this thesis describes not only linear programming itself, yet it is just focused to distrubution methods. In the practical part the task is treated by both of the above mentioned ways. The objective is to create the schedule of assignments of the given position to the concrete person at certain day. The secondary objective of the bachelor thesis is to compare the results of the solution of both methods and evaluate which variant is more suitable in this case.
|
|
|
The choir’s tour planning - an application of travelling salesman problem
Marešová, Iva ; Skočdopolová, Veronika (advisor) ; Šindelářová, Irena (referee)
This thesis deals with planning a journey for a choir's tour by means of different methods of mathematical modelling. The first approach is the application of a travelling salesman problem. The study aims to find the shortest closed cycle which will give us an optimal solution. In the case which is solved in this thesis the model of the travelling salesman problem is partly modified because our goal is to choose only half of all the places which are the most effective for us. The thesis focuses on the application of those methods which give us only an approximate solution, particularly the method of the nearest neighbour and the method of change replacement. The first part of the thesis is devoted to the theory dealing with linear programming, distribution problems, heuristic methods and computer programmes for optimization. In the next part the discussed methods are applied to the concrete case in which the journey for the tour is planned. At the end of this thesis there are mentioned modifications which could be solved in this type of problems.
|
guest ::
