Revision as of 00:40, 22 March 2011 edit Kiefer.Wolfowitz (talk \| contribs) 39,688 edits →Summary: <ref name="LF99Hyperbolic"/> ← Previous edit		Revision as of 00:42, 22 March 2011 edit undo Kiefer.Wolfowitz (talk \| contribs) 39,688 edits →Summary: It is not a polynomial-time algorithm, however. Researchers have extended the criss-cross algorithm for many optimization-problems, including linear-fractional programming.<ref name="LF99Hyperbolic"/> The criss-cross algorithm can solve Next edit →
Line 15: ==Summary== The criss-cross algorithm is a simply stated algorithm for linear ~~program of great theoretical interest~~programming. It was the second earliest fully combinatorial algorithm for linear programming; unlike the first algorithm for oriented matroids by Todd, the criss-cross algorithm does not cycle on nonrealizable oriented-oriented matroid problems. It is not a polynomial-time algorithm, however. Researchers have extended the criss-cross algorithm for many optimization-problems, including linear-fractional programming.<ref name="LF99Hyperbolic"/> The criss-cross algorithm can solve quadratic programming problems and linear complementarity problems in the setting of oriented matroids~~. It is not a polynomial time algorithm for linear programming, however~~. ==See also==

Criss-cross algorithm: Difference between revisions