http://www.emgu.com
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: 4.1.1.3497 (4.1.1.3497)
Syntaxpublic static SolveLPResult SolveLP(
Mat functionMatrix,
Mat constraintMatrix,
Mat zMatrix
)
Public Shared Function SolveLP (
functionMatrix As Mat,
constraintMatrix As Mat,
zMatrix As Mat
) As SolveLPResult
public:
static SolveLPResult SolveLP(
Mat^ functionMatrix,
Mat^ constraintMatrix,
Mat^ zMatrix
)
static member SolveLP :
functionMatrix : Mat *
constraintMatrix : Mat *
zMatrix : Mat -> SolveLPResult
Parameters
- functionMatrix
- 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. - constraintMatrix
- 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. - zMatrix
- 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:
SolveLPResultThe return codes
See Also