The Non-linear Case
In non-linear programming, the constraints are not necessarily linear. Nonetheless, many of the same principles apply.
To ensure that the global maximum of a non-linear problem can be identified easily, the problem formulation often requires that the functions be convex and have compact lower level sets.
This is the significance of the Karush–Kuhn–Tucker conditions. They provide necessary conditions for identifying local optima of non-linear programming problems. There are additional conditions (constraint qualifications) that are necessary so that it will be possible to define the direction to an optimal solution. An optimal solution is one that is a local optimum, but possibly not a global optimum.
Read more about this topic: Duality (optimization)
Famous quotes containing the word case:
“[The boss] asked me if I was not interested in a change in my life. I answered that one can never change lives, that in any case all lives were the same, and that I was not at all unhappy with mine.”
—Albert Camus (1913–1960)