Click or drag to resize
CvInvokeSolveLP Method
Solve given (non-integer) linear programming problem using the Simplex Algorithm (Simplex Method). What we mean here by “linear programming problem” (or LP problem, for short) can be formulated as: Maximize c x subject to: Ax <= b and x >= 0

Namespace: Emgu.CV
Assembly: Emgu.CV.World (in Emgu.CV.World.dll) Version: (
public static SolveLPResult SolveLP(
	Mat functionMatrix,
	Mat constraintMatrix,
	Mat zMatrix


Type: Emgu.CVMat
This row-vector corresponds to c in the LP problem formulation (see above). It should contain 32- or 64-bit floating point numbers. As a convenience, column-vector may be also submitted, in the latter case it is understood to correspond to c^T.
Type: Emgu.CVMat
m-by-n+1 matrix, whose rightmost column corresponds to b in formulation above and the remaining to A. It should containt 32- or 64-bit floating point numbers.
Type: Emgu.CVMat
The solution will be returned here as a column-vector - it corresponds to c in the formulation above. It will contain 64-bit floating point numbers.

Return Value

Type: SolveLPResult
The return codes
See Also