Q.A person makes two types of gift items A and B requires the services of a cutter and a finisher. Gift item A requires 4 hours of cutter's time and 2 hours of finisher's time. B requires 2 hours of cutter's time and 4 hours of finisher's time. The cutter and finisher have 208 hours and 152 hours available times respectively every month. The profit of one gift item of type A is Rs.75/- and on gift item B is Rs.125/-. Assuming that the person can sell all the gift items produced, determine how many gift items of each type should he make every month to obtain the best returns?

The chapter proves (without proof, as a stated theorem) that when the objective function of an L.P.P. attains its optimum (maximum or minimum) value over a convex-polygon feasible region, that optimum is always attained at one of the polygon's vertices (corner points) — this is the Corner-Point or Convex-Polygon Theorem, and it is what makes the graphical method possible: instead of checking every point of an infinite region, only the (finitely many) vertices need to be checked. The Corner-Point Method proceeds in five steps: (1) convert every constraint's inequation into its boundary equation and draw the line; (2) shade the half-plane each constraint demands and locate the region common to all of them — the feasible region; (3) find every vertex of this feasible region, either by reading intercepts directly off the graph or, more reliably, by solving each relevant pair of boundary-line equations simultaneously; (4) evaluate the objective function $z$ at every vertex f …