A factory makes two types of biscuits B 1 and B 2 that cost ` 145 and ` 160 per kg…
Mathematics · Class 12 · CBSE — Linear Programming
A factory makes two types of biscuits B1 and B2 that cost ` 145 and ` 160 per kg respectively. The minimum quantities of flour, sugar and butter to be ordered for the factory are 600 kg, 400 kg and 250 kg respectively to make the biscuits.
B1 requires 700 gms of flour, 200 gms of sugar and 100 gms of butter to prepare 1 kg of biscuits. B2 requires 600 gms of flour, 300 gms of sugar and
200 gms of butter to prepare 1 kg of biscuits. Formulate the above LPP to minimize the cost.
B1 requires 700 gms of flour, 200 gms of sugar and 100 gms of butter to prepare 1 kg of biscuits. B2 requires 600 gms of flour, 300 gms of sugar and
200 gms of butter to prepare 1 kg of biscuits. Formulate the above LPP to minimize the cost.
- Minimize Z = 145x + 160y
Subject to, 0.7x + 0.6y ≥ 600, 0.2x + 0.3y ≤ 400,0.1x + 0.2y ≥ 250x, y ≥ 0 - Minimize Z = 145x + 160y
Subject to, 0.7x + 0.6y ≥ 600, 0.2x + 0.3y ≥ 400,0.1x + 0.2y ≤ 250x, y ≥ 0 - Minimize Z = 145x + 160y
Subject to, 0.7x + 0.6y ≥ 600, 0.2x + 0.3y ≥ 400,0.1x + 0.2y ≥ 250x, y ≥ 0 - Minimize Z = 145x + 160y
Subject to, 0.7x + 0.6y ≥ 600, 0.2x + 0.3y ≤ 400,0.1x + 0.2y ≤ 250x, y ≥ 0
Answer
(C) Minimize Z = 145 x + 160 y Subject to, 0.7 x + 0.6 y ≥ 600, 0.2 x + 0.3 y ≥ 400,0.1 x + 0.2 y ≥ 250 x , y ≥ 0
Sign up free on Edukali to view the step-by-step worked solution and practice thousands of similar questions.
Related practice questions
- The objective function Z = 4 x + 3 y can be minimum subjected to the constraints 3 x + 4 y ≤ 24, 8 x + 6 y ≤…
- Solution set of the inequality x ≥ 0 is
- The optimal value of the objective function is attained at the points
- Z =20 x 1 + 20 x 2 , subject to x 1 ≥ 0, x 2 ≥ 0, x 1 + 2 x 2 ≥ 8, 3 x 1 + 2 x 2 ≥ 15, 5 x 1 + 2 x 2 ≥ 20 The…
- A printing company prints two types of magazine A and B . The company earn ` 20 and ` 30 on each copy of…
- Kellogg is a new cereal formed of a mixture of bran and rice that contains at least 88 grams of protein and…
- Maximize Z = 3 x + 5 y , subject to x + 4 y ≤ 24, 3 x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0
- A brick manufacturer has two depots A and B , with stocks of 30000 and 20000 bricks respectively. He receives…
More Linear Programming questions · Browse all practice questions