Consider a company making a single product. The estimated demand for the product for the [?] four months are 1000, 800, 1200, 900 respectively. The company has a regular time capacity of 800 per month and an over time capacity of 200 [?] month. The cost of regular time production is Rs20 per unit and the cost of over time production is R[?] per unit. The company can carry inventory to the next month and the holding cost is 3/unit/mo[?] The demand has to be met every month. Formulate a linear programming problem for the ab[?] situation.
Akshit Bhardwaj, AIR 12, 2025
Let $x_1, x_2, x_3$ & $x_4$ be the number of units produced in Months 1,2,3 & 4
Since demand has to be met every month
$x_1 \geq 1000$
$x_1 + x_2 \geq 1800$
$x_1 + x_2 + x_3 \geq 3000$
$x_1 + x_2 + x_3 + x_4 = 3900$ [No reason to produce extra in last month]
$x_1, x_2, x_3, x_4 \geq 0$
Clearly from this $x_1, x_2, x_3, x_4 \geq 800$ for optimality
=> Cost of production is
$C_1 = 20\times 800 + 25(x_1 - 800) + 20\times 800 + 25(x_2 - 800) + 20\times 800 + 25(x_3 - 800) + 20\times 800 + 25(x_4 - 800)$
$= 25x_1 + 25x_2 + 25x_3 + 25x_4 - 16000$
$C_2$ = Cost of holding
$= (n_1 - 1000)\times 3 + (n_1+n_2 - 1800)\times 3 + (n_1+n_2+n_3 - 3000)\times 3$
Now we have the following inequalities
$n_1 \geq 1000$
$n_1+n_2+n_3 \geq 1000$
$n_1 \leq 1000$
$n_2 \leq 1000$
$n_3 \leq 1000$
$\Rightarrow$ $n_1 = n_3 = n_2 = 1000$
$\rightarrow$ $n_4 = 100$
LPP: Min $C_1 + C_2 = 34n_1 + 31n_2 + 25n_3 - 33400$
Subject to
$n_1 \geq 1000$
$n_1+n_2 \geq 1800$
$n_1+n_2+n_3 \geq 3000$
$n_1+n_2+n_3+n_4 = 3900$
$n_1, n_2, n_3, n_4 \geq 0$