public class ILPNode extends java.lang.Object implements BBNode
ILPBranchAndBound to solve an Integer Linear Programming problem.| Constructor and Description |
|---|
ILPNode(ILPProblem problem)
Construct a BB node and associate it with an ILP problem.
|
| Modifier and Type | Method and Description |
|---|---|
java.util.List<ILPNode> |
branching()
Get the children of this node by using the branching operation.
|
int |
dimension()
Get the number of variables.
|
RealScalarFunction |
f()
Get the objective function.
|
EqualityConstraints |
getEqualityConstraints()
Get the equality constraints, hi(x) = 0
|
LessThanConstraints |
getLessThanConstraints()
Get the less-than-or-equal-to constraints, gi(x) ≤ 0
|
boolean |
isCandidate()
Check if this node is a possible solution to the original problem, e.g., not pruned.
|
ImmutableVector |
solution()
the solution to the sub-problem associated with this node
|
java.lang.String |
toString() |
double |
value()
the value of this node
|
public ILPNode(ILPProblem problem)
problem - an ILP problempublic ImmutableVector solution()
BBNodepublic double value()
BBNodepublic boolean isCandidate()
BBNodeisCandidate in interface BBNodetrue if this node is a possible solution to the original problempublic java.util.List<ILPNode> branching()
public LessThanConstraints getLessThanConstraints()
ConstrainedOptimProblemgetLessThanConstraints in interface ConstrainedOptimProblempublic EqualityConstraints getEqualityConstraints()
ConstrainedOptimProblemgetEqualityConstraints in interface ConstrainedOptimProblempublic int dimension()
OptimProblemdimension in interface OptimProblempublic RealScalarFunction f()
OptimProblemf in interface OptimProblempublic java.lang.String toString()
toString in class java.lang.Object