| SimplexSolverBaseORToolsSolve(LinearProgrammingProblem, Boolean, IEnumerableInt32) Method |
Solves a linear programming problem using the given solver parameters.
Namespace: CenterSpace.NMath.CoreAssembly: NMath (in NMath.dll) Version: 7.4
Syntax protected void Solve(
LinearProgrammingProblem problem,
bool Minimize = false,
IEnumerable<int> integralVariableIndices = null
)
Protected Sub Solve (
problem As LinearProgrammingProblem,
Optional Minimize As Boolean = false,
Optional integralVariableIndices As IEnumerable(Of Integer) = Nothing
)
protected:
void Solve(
LinearProgrammingProblem^ problem,
bool Minimize = false,
IEnumerable<int>^ integralVariableIndices = nullptr
)
member Solve :
problem : LinearProgrammingProblem *
?Minimize : bool *
?integralVariableIndices : IEnumerable<int>
(* Defaults:
let _Minimize = defaultArg Minimize false
let _integralVariableIndices = defaultArg integralVariableIndices null
*)
-> unit
Parameters
- problem LinearProgrammingProblem
- A linear programming problem.
- Minimize Boolean (Optional)
- If true, minimize the objective, otherwise maximize the objective.
- integralVariableIndices IEnumerableInt32 (Optional)
- Indices of varibles with integral constraints.
See Also