Linear Programming

Linear Programming Examples:

Step1. Identify the unknowns in the given LPP. Denote then by x & y.
Step2. Formulate the aim function in terms of x & y. be sure whether it is to be maximized or
minimized.

Step3. Translate all the constraints in the kind of linear inequations.
Step4. Solve these in equations simultaneously. Mark the common area by shaded region. This is the

feasible region .
Step5. Find the coordinates of all the vertices of the feasible region
Step6. Find the worth of the aim function at each vertex of the feasible region.
Step7. Find the values of x & y for which the aim function

z = ax + by has maximum or maximum value

To know more:

Bar Graphs

Ogive graph