Q1Advanced Engineering Mathematics

In a Linear Programming Problem (LPP), both the objective function to be optimized and all the constraints are strictly linear equations or inequalities (e.g., $z=c_1{x}_1+c_2{x}_2$). All decision variables have a power of 1.

In a Non-Linear Programming Problem (NLPP), either the objective function, at least one of the constraints, or both are non-linear functions of the decision variables (e.g., $z=x_1^2+x_2$, or $x_1{x}_2\le 4$). This makes solving them significantly more complex.