In mathematics, **nonlinear programming** (**NLP**) is the process of solving a system of equalities and inequalities, collectively termed constraints, over a set of unknown real variables, along with an objective function to be maximized or minimized, where some of the constraints or the objective function are nonlinear.

Read more about Nonlinear Programming: Applicability, The General Non-linear Optimization Problem (NLO), Possible Solutions, Methods For Solving The Problem

### Other articles related to "nonlinear programming, programming":

**Nonlinear Programming**

...

**Nonlinear programming**— the most general optimization problem in the usual framework Special cases of

**nonlinear programming**See Linear

**programming**and Convex optimization above ...

... and an approximation to the optimal-control problem through the use of

**nonlinear programming**that allows solution by numerical procedures ... The optimal control problem is an infinite dimensional problem while the

**nonlinear programming**approach approximates the problem by a finite dimensional problem ... The

**nonlinear programming**methods such as BFGS and SQP may be used to solve the finite dimensional problem ...

### Famous quotes containing the word programming:

“If there is a price to pay for the privilege of spending the early years of child rearing in the driver’s seat, it is our reluctance, our inability, to tolerate being demoted to the backseat. Spurred by our success in *programming* our children during the preschool years, we may find it difficult to forgo in later states the level of control that once afforded us so much satisfaction.”

—Melinda M. Marshall (20th century)