As we have discussed in details in Chapter V, non-linear programming deals with problems where the objective function or the constraints, or both, are non-linear. These problems are more complex to handle than those of linear programming, due to the fact that, for example, non-linear functions may lead to multiple local optima. This difficulty is also and perhaps even more so present when searching numerically for global optimum, making the development of methods even more challenging.