|
|
GRETL – Software for econometric courses support
Jindrová, Věra ; Sekničková, Jana (advisor) ; Školuda, Václav (referee)
The bachelor thesis aims to create a comprehensible user's manual for econometric software GRETL in the Czech language. It begins with the introduction of software GRETL and then acquaints the reader with a range of possible uses of the software when working with data. Thesis briefly describes the main characteristics of the possible linear regression model, such as multicollinearity, autocorrelation and heteroscedasticity, including possible testing in the particular software and evaluation of specific tests. The key part deals with defining and specifying data for their subsequent analysis in the software, compilation of a model, estimates of parameters of an econometric model using the least squares method, the weighted least squares method and the generalized least squares method. Furthermore, the thesis deals with hypotheses testing and confidence interval estimations, and also shows how to create and edit graphs in GRETL and explains each menu item in detail. All steps are supported by a graphical supplement and specific examples.
|
|
|
The multiple knapsack problem in use
Procházková, Lucie ; Sekničková, Jana (advisor) ; Suchánková, Tereza (referee)
In the area of integer linear programming problems is placed the knapsack problem, including its modifications. Among them is the multiple knapsack problem which is the subject of this thesis. In connection with the interpretation of results is necessary to extend the knapsack problem to integer conditions that are most often transformed into a bivalent conditions. This greatly increases the computational complexity of these tasks. Despite the fact that solutions exist for the exact algorithms, often in the calculation of some large problems can not be used. Approximate and sufficiently accurate results can be achieved by using heuristics and other techniques that have been created for this purpose. Subchapters in the first part further describe the variation of the knapsack problem, in the second part subchapters followed, and present some possible use in practice.
|
|
|
Postoptimization analysis in parametric programming
Ten, Anastassiya ; Sekničková, Jana (advisor) ; Skočdopolová, Veronika (referee)
This bachelor thesis deals with postoptimality analysis of parametric programming problems. Parametric programming problem is problem, where some of the coefficients are not constant but depend on one or several parameters. Postoptimality analysis explores intervals of stability of coefficients in an initial solution and impact of additional changes in the assignment of the problem. Mentioned theory explains main terms and methods, which were illustrated on practical examples.
|
|
|
Selected methods for solving integer programming problems
Picková, Veronika ; Sekničková, Jana (advisor) ; Charvát, Karel (referee)
This final thesis work is dealing with the problems of mixed integer linear programming and their possible methods of solving. The reader will be introduced to the issues of integer programming in the first part of the work. There follow the different methods of solving in the second part, concretely the possibility of solving without the integer constraints and rounding the solution, the branch and bound method and the Gomory's method. The purpose of this work is to inform the reader about the Benders decomposing algorithm. Decomposing methods divide the original problem into two parts: a part with the constraints of integrity and a part without them. All of the explained methods are supported by illustrative examples. The third part of this thesis is the application of used methods to a concrete problem.
|
|
|
Generalized assignment problem
Kocourková, Markéta ; Sekničková, Jana (advisor) ; Nečas, Dalibor (referee)
The generalized assignment problem is a topic of this thesis. The knapsack problem in general belongs to among classical operation research problems and belongs to the category of integer linear programming. It is very often formulated as a binary problem or 0-1. There are several types of knapsack problems which are described in this thesis. Some of the knapsack problems are so large and although exist exact algorithms for finding optimal solution, heuristics are rather used. They are not so exact but they find solution much earlier. Therefore some of the knapsack problems belong to NP-hard problems. This thesis is focused on one type particularly, the generalized assignment problem, which is demonstrated on practical example how the problem can be used.
|
|
|
IZAR - Uživatelská příručka
Ivanytska, Vitaliya ; Sekničková, Jana (advisor) ; Kuncová, Martina (referee)
The goal of this paper is to explore a newly designed software support for solving multi-criteria decision-making problems -- IZAR, as well as to create a comprehensible manual for a common user interested in decision-making theory. IZAR is currently in a development stage; nevertheless, its available versions are already being used by operations research students. The first two sections of this thesis are focused on a brief introduction of all the solutions methods used in the current version of IZAR, while the third section is a practical user guide that includes examples of the problems and a comparative summary of different ways of their solution reached by the means of IZAR.
|
|
|
Behavior of supranational banks in dependence on economic development
Bárta, Karel ; Sekničková, Jana (advisor) ; Zouhar, Jan (referee)
The goals of this bachelor thesis are to find a connection between granted credits by supranational banks in dependence on economic development in the bank's native country, if possible to identify events with influence on the bank's behavior and to evaluate known macroeconomic relations on available data and attempt to explain occurring discrepancies. A mathematical model has been created in order to describe the observed dependence.
|
|
|
Network flows and their software support
Zdražil, Jan ; Sekničková, Jana (advisor) ; Chlapek, Dušan (referee)
This thesis deals with the maximum flow problem in network. First part describes and explains basic terms of graph theory, which gives theoretical base for following text. Next part is dedicated to algorithms that may be used to solve a maximum flow problem. Each described algorithm contains a brief history, general notation and a practical example. The next very important part of the thesis is in specific computer science applications such as computer vision and web mining. As an essential part of the thesis is developed software in programming language Java, which allows user to compare the implemented algorithms and to solve large network flows problems.
|
|
|
Decision situations in tournament poker
Preibisch, Jan ; Sekničková, Jana (advisor) ; Dlouhý, Martin (referee)
This thesis deals with factors which are important for making decisions in the game of poker. The goal is to find a way to improve players chances of success in this game. The first two chapters describe the rules of poker and the basics and presumptions of the game theory The following chapters analyze some mathematical models and assumptions for applying these models in the game. These models should find the optimal solution for individuals in decision making situations. It can be considered a static situation, where the behavior of each player is predetermined and the decision maker tries to find an appropriate strategy. It is also can be considered a dynamic situation, when all players react to each other, which heads to equilibrium solution. As a consequence of rising popularity of poker tournaments many strategy books have appeared, as well as analytic software. Nevertheless, it is and probably will remain impossible to solve all decision situations which can occur. A very important factor of success are some gamblers attitude, experience and mental skills. Mathematical knowledge, however, will become more and more important. This thesis will help to understand the basic of mathematic models and their application in poker game.
|
|
|
The demographic development of the European Union
Dotlačilová, Petra ; Langhamrová, Jitka (advisor) ; Sekničková, Jana (referee)
The aim of this Master's thesis is to describe the past and future demographic development of selected EU countries. The second aim is to utilize methods for multicriteria evaluation of alternatives in the demography. The last aim is to describe methods used to extrapolate mortality curves. The theoretical part describes demographic indicators, methods used to extrapolate mortality curves and computational processes for methods for multicriteria evaluation of alternatives. The practical part includes the computation of demographic indicators and describes the progress of the indicators in the future. The methods for multicriteria evaluation of alternatives are used for ranking selected EU countries according to the demographic indicators. The last part of the thesis includes the application of methods used for extrapolating mortality curves and compares the achieved results with the actual progress.
|
guest ::
