Criss-cross algorithm
id:
criss-cross-algorithm-281-11855225
title:
Criss-cross algorithm
text:
In mathematical optimization, the criss-cross algorithm is any of a family of algorithms for linear programming. Variants of the criss-cross algorithm also solve more general problems with linear inequality constraints and nonlinear objective functions; there are criss-cross algorithms for linear-fractional programming problems, quadratic-programming problems, and linear complementarity problems. Like the simplex algorithm of George B. Dantzig, the criss-cross algorithm is not a polynomial-time
brand slug:
wiki
category slug:
encyclopedia
description:
Method for mathematical optimization
original url:
https://en.wikipedia.org/wiki/Criss-cross_algorithm
date created:
date modified:
2024-01-10T01:00:35Z
main entity:
{"identifier":"Q17006040","url":"https://www.wikidata.org/entity/Q17006040"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/8/89/Unitcube.svg","width":390,"height":340}
fields total:
13
integrity:
15