Criss-Cross Method

A standard form of the linear programming problem of maximizing a linear function over a convex polyhedron is to maximize c·x subject to mx<=b and x>=0, where m is a given s×d matrix, c and b are given d-vector and s-vectors, respectively. The Criss-cross method always finds a polyhedron vertex solution if an optimal solution exists.

See also

Convex Polyhedron, Linear Programming, Polyhedron Vertex

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Criss-Cross Method." From MathWorld--A Wolfram Web Resource.

Subject classifications