Porovnání simplexové metody a její modifikace

The aim of this thesis is to compare simplex method used for solving linear programmingproblems to one of its modifications called modified simplex method. The comparison focuses on the solution time especially. Own solver, capable of solving randomly generatedlinear programming problems using both...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Bartoň, Jan
Format:	Dissertation
Sprache:	cze
Schlagworte:	doba výpočtu linear programming lineární programování modified simplex method modifikovaná simplexová metoda simplex method simplexová metoda solution time
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!