Topper Copies

MATHOCRAT has two grades of inspectors, I and II to undertake quality control inspection. At least 1,500 pieces must be inspected in an 8-hour day. Grade I inspector can check 20 pieces in an hour with an accuracy of 96%. Grade II inspector checks 14 pieces an hour with an accuracy of 92%. Wages of grade I inspector are Rs. 5 per hour while those of grade II inspector are Rs. 4 per hour. Any error made by an inspector costs Rs. 3 to the MATHOCRAT. If there are, in all, 10 grade I inspectors and 15 grade II inspectors in the MATHOCRAT, find the optimal assignment of inspectors that minimise the daily inspection cost

Aakash Om Trivedi, AIR 73, 2025

Let $x_1$ be number of grades I inspector

$x_2$ be grades II inspectors.

Now $x_1 \leq 10$, $x_2 \leq 15$ (given)

number of copies, $t_1$ $t_2$

$x_1 \times 20 \times [?] + x_2 \times 14 \times [?] \geq 1500$

(M = wages) here $t_1, t_2$ time

$M = 5x_1 \times t_1 + 4x_2 \times t_2 + 3 \times (x_1 \times 20 \times t_1) \times \frac{4}{100} + \frac{8}{100} \times (x_2 \times 20 \times t_2)$ penalty cost

Now we assume $t_1 = 8, t_2 = 8$ (max hour inspected by hired inspectors)

$\therefore M = 59.2x_1 + 70.4\, x_2$

$20x_1 + 14x_2 \geq 187.5$

$x_1 \leq 10$, $x_2 \leq 15$

[a graph of the feasible region on $x_1$-$x_2$ axes, shaded, bounded by the sloping line $20x_1+14x_2 = 187.5$ with intercepts 13.39 on the $x_2$ axis and 9.375 on the $x_1$ axis, the horizontal line $x_2 \leq 15$ and the vertical line $x_1 \leq 10$, vertices labelled A, B, C, D, E]

Now checking at endpoint,

we get $z_B = 555$

$z_A = 942.85$

and we can see $z_C > z_B$ and $z_D > z_C$, $z_E > z_A$ (using similar coordinate)

$\therefore$ $(z_B)$ is minimum

$\therefore$ $x_1 = 9.375$, $x_2 = 0$

To make integer

$x_1 = 10, x_2 = 0$