Criss-cross algorithm: Difference between revisions

Revision as of 00:36, 22 March 2011

Revision as of 00:39, 22 March 2011

Line 1:

In [[mathematical optimization]], the '''criss-cross algorithm''' denotes a family of [[algorithm]]s for [[linear programming]]. Variants of the criss-cross algorithm also solve more general problems with [[linear programming|linear inequality constraints]] and [[nonlinear programming|nonlinear]] [[objective function]]s; there are criss-cross algorithms for [[linear-fractional programming]] problems,<ref name="LF99Hyperbolic">{{harvtxt|Illés|Szirmai|Terlaky|1999}}</ref> [[quadratic programming|quadratic-programming]] problemsmproblems, and [[linear complementarity problem]]s.<ref name="FukudaTerlaky" > {{harvtxt|Fukuda|Terlaky|1997}} </ref>

==Comparison with the simplex algorithm of Dantzig==