I am just beginning to read about the use of "Concave Programming" methods and use of the Karush-Kuhn-Tucker conditions to identify the maximum value of a non-linear objective function subject to inequality constraints.
The examples I have seen in the text I have at hand, all involve only linear constraints. Is this method equally applicable to situations where not only are there multiple constraints, but where one or more of those constraints are non-linear ?