Browse

Constrained optimization problems are problems for which a function f (x) is to be minimized or maximized subject to constraints ? (x) . Here f : Rn ? R is called the objective function and F(x) is a Boolean-valued formula. In Mathematica the constraints ? (x) can be an arbitrary Boolean combination of equations g (x) ?0 , weak inequalities g (x) >=0, strict inequalities g(x)> 0, x is integer and x>0 statements. A point u ? Rn is said to be a global minimum of f subject to constraints F if u satisfies the constrai...