for a linear programming problem and let Z = ax + by be the objective function. When Z has an optimal value (maximum or minimum), where the variables x and y are subject to constraints described ...

In this article you will find specifically for Class 12 Maths Chapter 12 Linear Programming downloadable ... and y is the number of orders for cakes. Graph the feasible region for Sameer's LPP ...