Constraints may be of the following types:
Bound constraints - a cuboid is carved from the domain of the objective function:
Linear constraints can be linear equations and linear one or two-sided inequalities.
Example 6.3. Linear equation constraints
from biz.sc.math.opt.constraint import * lineq = LinearEquation([[1,1,2],[1,-1,3]], [2,3])
Example 6.4. One-sided linear inequality constraints - left-hand sides smaller than the right-hand sides
from biz.sc.math.opt.constraint import * linineq1 = LinearInequality([[1,1,2],[1,-1,3]], [2,3])
The above is equivalent to
from biz.sc.math.opt.constraint import * linineq1 = LinearInequality([[1,1,2],[1,-1,3]], [2,3], TRUE)
The set of constraints is represented as an ArrayList. All constraints are elements of the list.