Class PureILPProblem
- java.lang.Object
-
- dev.nm.solver.multivariate.constrained.integer.linear.problem.ILPProblemImpl1
-
- dev.nm.solver.multivariate.constrained.integer.linear.problem.PureILPProblem
-
- All Implemented Interfaces:
LPProblem
,IPProblem
,ILPProblem
,ConstrainedOptimProblem
,OptimProblem
public class PureILPProblem extends ILPProblemImpl1
This is a pure integer linear programming problem, in which all variables are integral.
-
-
Constructor Summary
Constructors Constructor Description PureILPProblem(Vector cost, LinearGreaterThanConstraints greater, LinearLessThanConstraints less, LinearEqualityConstraints equal, BoxConstraints bounds, double epsilon)
Construct a pure ILP problem.
-
Method Summary
-
Methods inherited from class dev.nm.solver.multivariate.constrained.integer.linear.problem.ILPProblemImpl1
A, Aeq, b, beq, c, dimension, epsilon, f, getEqualityConstraints, getIntegerIndices, getLessThanConstraints, getNonIntegralIndices, isFree
-
-
-
-
Constructor Detail
-
PureILPProblem
public PureILPProblem(Vector cost, LinearGreaterThanConstraints greater, LinearLessThanConstraints less, LinearEqualityConstraints equal, BoxConstraints bounds, double epsilon)
Construct a pure ILP problem.- Parameters:
cost
- the linear objective functiongreater
- the greater-than-or-equal-to constraintsless
- the less-than-or-equal-to constraintsequal
- the equality constraintsbounds
- the box constraintsepsilon
- a precision parameter: when a number |x| ≤ ε, it is considered 0
-
-