A standard form of the Linear Programming problem of maximizing a linear function over a Convex Polyhedron
is to maximize
subject to
and
, where *m* is
a given matrix, and are given -vector and -vectors, respectively. The Criss-cross
method always finds a Vertex solution if an optimal solution exists.

© 1996-9

1999-05-25