 | Bounded |
Abstract class for representing a problem with bounded variables.
Inheritance HierarchySystemObject
CenterSpace.NMath.CoreBoundedVariableProblem
CenterSpace.NMath.CoreLinearConstrainedProblem
CenterSpace.NMath.CoreNonlinearProgrammingProblem
CenterSpace.NMath.CoreBoundedVariableProblem
CenterSpace.NMath.CoreLinearConstrainedProblem
CenterSpace.NMath.CoreNonlinearProgrammingProblem
Namespace: CenterSpace.NMath.Core
Assembly: NMath (in NMath.dll) Version: 7.4
SyntaxThe BoundedVariableProblem type exposes the following members.
Constructors| Name | Description | |
|---|---|---|
 | BoundedVariableProblem | Constructs a BoundedVariableProblem with not bounds. |
| BoundedVariableProblem(BoundedVariableProblem) | Copy constructor. |
Properties| Name | Description | |
|---|---|---|
 | NumVariables | Gets the number of variables in the problem. |
| VariableBounds | Gets and sets variable bounds for the problem. |
Methods| Name | Description | |
|---|---|---|
| AddBounds(Int32, Double, Double) | Adds upper and lower bound constraints to a variable. |
| AddBounds(Int32, Double, Double, Double) | Adds upper and lower bound constraints to a variable. |
| AddLowerBound(Int32, Double) | Adds an lower bound constraint on the variable at the given index. |
| AddLowerBound(Int32, Double, Double) | Adds an lower bound constraint on the variable at the given index. |
| AddUpperBound(Int32, Double) | Adds an upper bound constraint on the variable at the given index. |
| AddUpperBound(Int32, Double, Double) | Adds an upper bound constraint on the variable at the given index. |
 | BoundsToConstraints | Constructs a list of linear constraints representing the bounds in the given VariableBounds instance. |
 | CheckVariableIndex | Checks that the given variable index is valid. |
| PointIsFeasible(DoubleVector) | Function for determining the feasibility of a give point. A point x is feasible if it satisfies all the constraints of the problem. |
| PointIsFeasible(DoubleVector, Double) | Function for determining the feasibility of a give point. A point x is feasible if it satisfies all the constraints of the problem within a specified tolerance. |
Fields| Name | Description | |
|---|---|---|
 | variableBounds_ | Map containing variable bounds. Key is the variable ID, the value is the bounds. |
See Also