Metody vnitřního bodu pro úlohy lineárního programování

Abstract

This thesis discusses the theory and practical implementation of algorithm for solving linear programming problems using interior point methods. In this work we focus on the problems that arise in practical implementation of algorithms for interior point methods. The ambition of this work is to find a way in which the algorithm of interior point methods gives improved efficiency in terms of solving large linear programming problems. This work partly continues on my previous bachelor thesis, which I made on the effective implementation of simplex algorithm for linear programming.