|Constructor and Description|
Construct a pure ILP problem.
A, Aeq, b, beq, c, dimension, epsilon, f, getEqualityConstraints, getIntegerIndices, getLessThanConstraints, getNonIntegralIndices, isFree
public PureILPProblem(Vector cost, LinearGreaterThanConstraints greater, LinearLessThanConstraints less, LinearEqualityConstraints equal, BoxConstraints bounds, double epsilon)
cost- the linear objective function
greater- the greater-than-or-equal-to constraints
less- the less-than-or-equal-to constraints
equal- the equality constraints
bounds- the box constraints
epsilon- a precision parameter: when a number |x| ≤ ε, it is considered 0
Copyright © 2010-2017 Numerical Method Incorporation Limited. All Rights Reserved.