Editing Nonlinear programming (section)

{{Short description|Solution process for some optimization problems}}
In [[mathematics]], '''nonlinear programming''' ('''NLP''') is the process of solving an [[optimization problem]] where some of the constraints are not [[Linear inequality|linear equalities]] or the objective function is not a [[linear function]]. An [[optimization problem]] is one of calculation of the extrema (maxima, minima or stationary points) of an [[objective function]] over a set of unknown [[Function of a real variable|real variables]] and conditional to the satisfaction of a [[Simultaneous equations|system]] of [[equation|equalities]] and [[inequality (mathematics)|inequalities]], collectively termed [[Constraint (mathematics)|constraints]]. It is the sub-field of [[mathematical optimization]] that deals with problems that are not linear.