|
|
Analyses of apedal locomotion systems based on ferroelastomers
Kouakouo, S. ; Böhm, V. ; Zimmermann, K.
In this paper, the movement behavior of amoeboid locomotion system is investigated and the theoretical proof of the locomotion of the system is provided with the finite element method. It is shown that not only the speed of locomotion but also its direction can be influenced by the drive frequency. Depending on the drive frequency, a movement from the home position and a subsequent movement in opposite directions can be achieved. In addition, high speeds of movement can be achieved in a limited frequency range.
|
|
| |
|
|
Methods for semi-infinite programs
Peinlich, Jiří ; Grygarová, Libuše (advisor) ; Zimmermann, Karel (referee)
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.
|
|
|
Game theory and poker
Schmid, Martin ; Hladík, Milan (advisor) ; Zimmermann, Karel (referee)
This thesis introduces the basic concepts of the game theory. Necessary models and solution concepts are described. Follows the summary of the computational complexity of these concepts and corresponding algorithms. Poker is formalized as one of the game theory game models. State of the art algorithms for the ex- tensive form games are explained with the application to the Poker. The thesis also introduces the Annual Computer Poker Competition and participating pro- grams. Finally, new result about the extensive form games with many actions is presented. Keywords: Game theory, Poker, Nash equilibrium, Extensive form games
|
|
| |
|
| |
|
|
Economic applications of geometric programming
Štěpánek, Ladislav ; Dupačová, Jitka (advisor) ; Zimmermann, Karel (referee)
Geometric programming is a special case of nonlinear programming, where objective function and constraints are shaped as posynomials. In this work we introduce geometric programming and solving methods. In~last chapter we will apply the geometric programming to Cobb-Douglas production function, create a model with random demand and possible extensions of this model. Powered by TCPDF (www.tcpdf.org)
|
|
| |
|
|
Duality in multiple criteria optimization problems
Kůrka, Michal ; Grygarová, Libuše (advisor) ; Zimmermann, Karel (referee)
This diploma thesis comprises of theoretical and practical part. In the theoretical part, we present comparison of di erent approaches to duality in multiobjective programming. We focus on dual problem formulated by Bitran and generalize the assumptions of strong duality theorem for this type of problem. We show that this dual problem is a special case of concept of exact duality developed by Dolecki and that it can be viewed as a generalization of Wolfe type dual problem presented by Nehse. In the practical part, we present algorithm for generating set of weak efficient solutions of concave multiobjective maximization problem with compact convex set of feasible solutions. This algorithm is based on construction of scalarized problem to the original multiobjective problem and makes use of the properties of its dual problem. We describe implementation of this algorithm and illustrate its usage on an example.
|
|
|
Methods for solving selected vehicle routing problems and their implementation.
Drobný, Michal ; Grygarová, Libuše (advisor) ; Zimmermann, Karel (referee)
Various types of transportation issues are a common practice. The issue may be approached mainly as the distribution of products from suppliers to consumers while minimising distribution costs. The difference of real transportation issues predominantly relates to the considered restrictions, such as capacities of vehicles and orders, time windows and other special distribution restrictions. Transportation issues were already defined by F.L. Hitchcock in 1941 and since then, a wide range of stochastic and non- determinist methods providing solutions to transportation issues have been developed. Nevertheless, introducing distribution restrictions in resolving real-life problems makes it difficult for such methods to be applied. This thesis provides a compilation of the well-known determinist methods that may be used to resolve transportation issues. The methods that are appropriate for resolving real issues are discussed in more detail. The solution procedure of the selected method is demonstrated using simple examples and the results are compared with the results of other methods. An analysis of the above methods is used to design and implement new methods to resolve real transportation issues, their results being compared with the methods provided by the commercial software product.
|
guest ::
