1.A nonlinear optimization problem any optimization problem in which at : 1825493
1.A nonlinear optimization problem is any optimization problem in which at least one term in the objective function or a constraint is nonlinear.
2.A function is quadratic if its nonlinear terms have a power of 4.
3.Nonlinear programming algorithms are more complex than linear programming algorithms.
4.Many linear programming algorithms such as the simplex method optimize by examining only the extreme points of the feasible region.
5.Nonlinear optimization problems can have only one local optimal solution.
6.A feasible solution is a global optimum if there are no other feasible solutions with a better objective function value in the immediate neighborhood.
7.A feasible solution is a global optimum if there are no other feasible points with a better objective function value in the feasible region.
8.For a typical nonlinear problem, duals price are relatively insensitive to small changes in right-hand side values.
9.The interpretation of the dual price for nonlinear models is different than the interpretation of the dual price for linear models.
10.In the case of functions with multiple local optima, most nonlinear optimization software methods can get stuck and terminate at a local optimum.