# SuanShu, a Java numerical and statistical library

com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.bruteforce

## Class BruteForceIPProblem

• All Implemented Interfaces:
IPProblem, ConstrainedOptimProblem, OptimProblem

public class BruteForceIPProblem
extends IPProblemImpl1
This implementation is an integral constrained minimization problem that has enumerable integral domains. That is, the integral variables have known and bounded integral domains.
• ### Constructor Detail

• #### BruteForceIPProblem

public BruteForceIPProblem(RealScalarFunction f,
EqualityConstraints equal,
LessThanConstraints less,
BruteForceIPProblem.IntegerDomain[] integers,
double epsilon)
Construct an integral constrained minimization problem with explicit integral domains.
Parameters:
f - the objective function to be minimized
equal - the set of equality constraints. Use null if the set is empty.
less - the set of less-than-or-equal-to inequality constraints. Use null if the set is empty.
integers - the integral constraints
epsilon - a precision parameter: when a number |x| ≤ ε, it is considered 0
• #### BruteForceIPProblem

public BruteForceIPProblem(RealScalarFunction f,
BruteForceIPProblem.IntegerDomain[] integers,
double epsilon)
Construct an integral constrained minimization problem with explicit integral domains.
Parameters:
f - the objective function to be minimized
integers - the integral constraints
epsilon - a precision parameter: when a number |x| ≤ ε, it is considered 0
• ### Method Detail

• #### getIntegralConstraint

public BruteForceIPProblem.IntegerDomain getIntegralConstraint(int index)
Get the integral domain of a particular integral variable.
Parameters:
index - the index of the integral variable, counting from 1
Returns:
the integral domain