In the previous chapters, we have studied linear programming problems. For an LPP, our objective is to maximize or minimize a linear function subject to the linear constraints. But in many cases:
Such an optimization problem is called a non linear programming problem (NLPP). In this chapter, we discuss techniques to solve NLPP’s.
A general non-linear programming problem can be expressed as follows:
Max or Min Z = f(x1, x2, ... xn)
Here, we have to evaluate the values of the decision variables ...