摘要: In the current chapter, we study problem of minimizing a real-valued function \(f(\boldsymbol{x})\) subject to constraints $$\displaystyle\begin{array}{rcl} g_{i}(\boldsymbol{x})& =& 0,\quad \quad 1 \leq i p \\ h_{j}(\boldsymbol{x})& & j q.\end{array}$$ All these functions share some open set U ⊂R n as their domain. Maximizing is equivalent \(-f(\boldsymbol{x})\), so there no loss generality in considering minimization. The called objective function, \(g_{i}(\boldsymbol{x})\) are equality constraints, and \(h_{j}(\boldsymbol{x})\) inequality constraints. Any point \(\boldsymbol{x} \in U\) satisfying all said be feasible.