National Repository of Grey Literature 13 records found  previous11 - 13  jump to record: Search took 0.01 seconds. 
Using linear programming to solve Markov decision processes
Dotlačilová, Petra ; Kořenář, Václav (advisor) ; Fábry, Jan (referee)
The aim of this bachelor thesis is to develop and describe how to solve Markov decision processes with alternatives by using the methods of linear programming. The theoretical part describes Markov decision processes. The practical part builds and describes the mathematical model of linear programming processes for Markov decision processes with alternatives. The method used for the calculation of the processes is described with the help of a simplex method. The last section of the practical part studies how the optimal solution of the linear programming is influenced by the postoptimalization changes which modify the probability and revenue properties of the processes.
Criss-cross method
Papež, Jan ; Kalčevová, Jana (advisor) ; Šmídová, Milada (referee)
This thesis describes the criss-cross method, which solves the tasks of linear programming and does not need primar or dual feasibility of the basis. At first, the single-phase simplex method, that needs primal feasibility, gets described. After that, we describe the dual simplex method, which needs dual feasibility. The criss-cross method combines both of these methods. All of mentioned methods are explained and demonstrated in several examples.
Software implementation of multiple criteria programming algorithms
Novák, Ondřej ; Jablonský, Josef (advisor) ; Kalčevová, Jana (referee)
Praktická implementace simplexové metody, metody větvení a mezí a především algoritmů spojitého vícekriteriálního rozhodování v jazyce Pascal

National Repository of Grey Literature : 13 records found   previous11 - 13  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.