MULTI VARIABLE OPTIMIZATION WITH CONSTRAINTS
ABSTRACT
It has been proved that in non linear programming, there are five methods of solving multi variable optimization with constraints.
In this project, the usefulness of some of these methods (Kuhn – Tucker conditions and the Lagrange multipliers) as regards quadratic programming is unveiled.
Also, we found out how the other methods are used in solving constrained optimizations and all these are supported with examples to aid better understanding.
