Adds a linear constraint of `less than type' to the multidimensional optimization problem being considered.
For an optimization problem in n-dimensional space, you are able
add the following linear constraint:coeff0 * x0 + coeff1 * x1 + ..... + coeffn-1 * xn-1 <= greaterThanValue,
where coeffi, is the coefficient of the coordinate variable
xi and greaterThanValue is just a constant.
In order to pass this linear constraint as parameters to this method you need to set:
{ coeff0, coeff0, ..., coeffn-1}greaterThanValueEasySolver Class | WebCab.COM.Math.Optimization Namespace | Very similar method except allow the addition of `greater than' linear constraints to multidimensional optimization problems. | Adds equality constraints to multidimensional optimization problem being considered. | Adds lower bound constraints to a multidimensional optimization problem being considered. | Adds lower bound constraints to a multidimensional optimization problem being considered. | Removes all the constraints which have been set for a multidimensional optimization problem being considered.