Jump to content

Nonlinear programming

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jaredwf (talk | contribs) at 17:16, 25 May 2004 (add page). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Nonlinear programming (NLP) is the process of solving a system of equalities and inequalities over a set of unknown real variables, along with an objective function to be maximized. The problem can be stated simply as:

where

If the objective function f is linear and the constrained space is a polytope, the problem is a linear programming problem.