Topper Copies

Formulating as a linear programming problem the cutting of 30 cm and 60 cm sheets into 15 cm, 21 cm and 27 cm sheets

Aryan Yadav, AIR 31, 2025

From one 30cm sheet we can get:

- 2 15cm sheets, wastage = 0, $x_1$ - 1 21cm sheet, wastage = 9, $x_2$ - 1 27cm sheet, wastage = 3, $x_3$

From one 60cm sheet:

- 4 15cm sheets, waste = 0, $x_4$ - 2 15cm, 1 21cm, waste = 9, $x_5$ - 2 15cm, 1 27cm, waste = 3, $x_6$ - 1 15cm, 2 21cm, waste = 3, $x_7$ - 1 21cm, 1 27cm, waste = 12, $x_8$

No. of 15cm sheets $= 2x_1 + 4x_4 + 2x_5 + 2x_6 + x_7$

No. of 21cm sheets $= x_2 + x_5 + 2x_7 + x_8$

No. of 27cm sheets $= x_3 + x_6 + x_8$

Wastage $= 9x_2 + 3x_3 + 9x_5 + 3x_6 + 3x_7 + 12x_8$

LPP is:

Min $9x_2 + 3x_3 + 9x_5 + 3x_6 + 3x_7 + 12x_8$

subject to

$2x_1 + 4x_4 + 2x_5 + 2x_6 + x_7 \geq 400$

$x_2 + x_5 + 2x_7 + x_8 \geq 200$

$x_3 + x_6 + x_8 \geq 300$

$x_1, x_2, x_3, x_4, x_5, x_6, x_7, x_8 \geq 0$