Interface to a linear programming solver object.
More...
|
| int | LinSolveRaw (int n, ref double[,] a, int m, ref double[,] b) |
| | Linear equation solver, given matrix a(n+1, n+1) and m vectors in the matrix form b(m+1,n+1), the solver returns the inverse matrix of a in a and the solution of a * x = b[i] in the vectors b[i] respectively. The return values are OK = 0, OPTI_ERROR_NOT_LICENSED = -1, OPTI_ERROR_SINGULAR_MATRIX1 = -2, OPTI_ERROR_SINGULAR_MATRIX2 = -3.
|
| int | SimplexRaw (int n, ref double[,] a, int m, int m1, int m2, int m3, ref double[] x) |
| | Simplex raw algorithm, n is the number of unknowns x[i], m the number of constraints, m1 the "smaller or equal than", m2 the "greater or equal than" and m3 the "equal" constraints. The optimal values x[i] >= 0 are given as result. The matrix a has to be set up as tableau (m+3, n+2) with maximization objective first and m1, m2, m3 next in this order. The return values are OK = 0, OPTI_ERROR_NOT_LICENSED = -1, OPTI_ERROR_UNBOUNDED_OBJECTIVE_FUNCTION = -2, OPTI_ERROR_NO_SOLUTION_STATISFY_CONSTRAINTS = -3, OPTI_ERROR_BAD_INPUT_CONSTRAINTS_COUNT = -4, OPTI_ERROR_BAD_INPUT_TABLEAU = -5.
|
|
| string | LicenseKey [get, set] |
| | To input a Developer or Developer Deploy license string, when read the hardware or software license is stated.
|
Interface to a linear programming solver object.
◆ LinSolveRaw()
| int SiMoLP.ILP.LinSolveRaw |
( |
int | n, |
|
|
ref double | a[,], |
|
|
int | m, |
|
|
ref double | b[,] ) |
Linear equation solver, given matrix a(n+1, n+1) and m vectors in the matrix form b(m+1,n+1), the solver returns the inverse matrix of a in a and the solution of a * x = b[i] in the vectors b[i] respectively. The return values are OK = 0, OPTI_ERROR_NOT_LICENSED = -1, OPTI_ERROR_SINGULAR_MATRIX1 = -2, OPTI_ERROR_SINGULAR_MATRIX2 = -3.
◆ SimplexRaw()
| int SiMoLP.ILP.SimplexRaw |
( |
int | n, |
|
|
ref double | a[,], |
|
|
int | m, |
|
|
int | m1, |
|
|
int | m2, |
|
|
int | m3, |
|
|
ref double[] | x ) |
Simplex raw algorithm, n is the number of unknowns x[i], m the number of constraints, m1 the "smaller or equal than", m2 the "greater or equal than" and m3 the "equal" constraints. The optimal values x[i] >= 0 are given as result. The matrix a has to be set up as tableau (m+3, n+2) with maximization objective first and m1, m2, m3 next in this order. The return values are OK = 0, OPTI_ERROR_NOT_LICENSED = -1, OPTI_ERROR_UNBOUNDED_OBJECTIVE_FUNCTION = -2, OPTI_ERROR_NO_SOLUTION_STATISFY_CONSTRAINTS = -3, OPTI_ERROR_BAD_INPUT_CONSTRAINTS_COUNT = -4, OPTI_ERROR_BAD_INPUT_TABLEAU = -5.
◆ LicenseKey
| string SiMoLP.ILP.LicenseKey |
|
getset |
To input a Developer or Developer Deploy license string, when read the hardware or software license is stated.