This interface represents an optimization algorithm for linear problems.
Optimization algorithms find the input point set that either {@link GoalType maximize or minimize} an objective function. In the linear case the form ofthe function is restricted to
c1x1 + ... cnxn = v
and there may be linear constraints too, of one of the forms:
- c1x1 + ... cnxn = v
- c1x1 + ... cnxn <= v
- c1x1 + ... cnxn >= v
- l1x1 + ... lnxn + lcst = r1x1 + ... rnxn + rcst
- l1x1 + ... lnxn + lcst <= r1x1 + ... rnxn + rcst
- l1x1 + ... lnxn + lcst >= r1x1 + ... rnxn + rcst
where the c
i, l
i or r
i are the coefficients of the constraints, the x
i are the coordinates of the current point and v is the value of the constraint.
@deprecated As of 3.1 (to be removed in 4.0).
@since 2.0