Click or drag to resize

SimplexSolverBaseORTools Methods

The SimplexSolverBaseORTools type exposes the following members.

Methods
 NameDescription
Protected methodAddConstraints Adds the linear constraints in the given linearly constrained problem to a Google OR-tools GLOP linear model.
(Inherited from ConstrainedOptimizerORTools)
Protected methodAddVariablesAndBounds Adds the variables in the given linearly constrained problem to a Google OR-tools GLOP linear model
(Inherited from ConstrainedOptimizerORTools)
Protected methodStatic memberCheck Checks bounds and constraints.
Protected methodStatic memberCheckBounds(DoubleVector, DoubleVector) Checks validity of variable upper bounds.
Protected methodStatic memberCheckBounds(DoubleVector, DoubleVector, DoubleVector) Checks variable bounds.
Protected methodStatic memberCheckConstraints Checks constraints validity.
Protected methodSetStatus Sets the SolverResult value base on Google OR-Tools ResultStatus value.
(Inherited from ConstrainedOptimizerORTools)
Public methodSolve(LinearProgrammingProblem) Solves a linear programming problem.
Public methodSolve(MixedIntegerLinearProgrammingProblem) Solves a mixed integer linear programming problem with default solver parameters.
Public methodSolve(MixedIntegerLinearProgrammingProblem, Boolean) Solves a mixed integer linear programming problem using the given solver parameters.
Public methodSolve(DoubleVector, DoubleVector, DoubleVector) Solves a linear programming problems where the variables are constrained by the given bounds. The solution maximizes the objective function.
Protected methodSolve(LinearProgrammingProblem, Boolean, IEnumerableInt32) Solves a linear programming problem using the given solver parameters.
Public methodSolve(DoubleVector, DoubleMatrix, DoubleVector, Int32, Int32, Int32, DoubleVector, DoubleVector) Solves a linear programming problem with the given constraints and variable bounds.
Public methodSolveNonnegative(DoubleVector, DoubleVector) Solves a linear programming problem. Solution values are constrained by upper bounds and lower bounds of zero. The solution maximizes the objective function.
Public methodSolveNonnegative(DoubleVector, DoubleMatrix, DoubleVector, Int32, Int32, Int32) Solves a linear system. The solution components are constrained to be nonnegative.
Public methodSolveNonnegative(DoubleVector, DoubleMatrix, DoubleVector, Int32, Int32, Int32, DoubleVector) Solves a linear programming problem with the given constraints. The solution maximizes the objective function and its components are constrained to be nonnegative.
Top
See Also