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.
Subjects
free text keywords: lineární programování; criss-cross method; linear programming; simplex method; simplexová metoda; metoda criss-cross