Interaktivní solver pro simplexovou metodu s vizualizací postupu řešení a volbou algoritmických variant

Linear programming is a discipline of applied mathematics that is widely used in various economic disciplines. A key algorithm connected to this branch is the simplex method. The main objective of this thesis is to create a learning tool that, given a linear optimization problem, generates a detailed description of its solution and thus facilitates the learning process. Analysis, design and implementation of the given software were carried out as part of this thesis as well as subsequent testing. Final application allows the user to input an LP problem and, after selecting a specific variant of a simplex algorithm, displays a detailed list of steps that were performed in order to obtain the solution. The application also allows the user to verify the input entered in the MPS format. If valid, it is subsequently transformed into the inequality form of the problem. The result is an educational application that allows for simple backtracking of errors during manual calculations, which provides insight into the underlying procedures utilized in linear programming and eases understanding of the MPS format. Proposed solution enhances the effectiveness of study process and contributes to a comprehensive overview of the internal structures of the elementary variations of the simplex method.