Diet of sick person must contain atleast 4000 units of vitamins, 50 units of minerals and…
Mathematics · Class 12 · CBSE — Linear Programming
Diet of sick person must contain atleast 4000 units of vitamins, 50 units of minerals and 2500 calories. Two foods F1 and F2 cost ` 50 and ` 75 per unit respectively. Each unit of food F1 contains 200 unit of vitamins, 2 units of minerals and 40 calories, whereas each unit of food F2 contains 100 units of vitamins, 3 units of minerals and 35 calories. Formulate the above problem as LPP to fulfill sick person's requirements at minimum cost.
- Minimize Z = 50x + 75y
Subject to 200x + 100y ≥ 4000,2x + 3y ≥ 50, 40x + 35y ≥ 2500, x ≥ 0, y ≥ 0 - Minimize Z = 50x + 75y
Subject to 200x + 100y ≥ 4000,2x + 3y ≥ 50, 40x + 35y ≤ 2500, x ≥ 0, y ≥ 0 - Minimize Z = 50x + 75y
Subject to 200x + 100y ≥ 4000,2x + 3y ≤ 50, 40x + 35y ≥ 2500, x ≥ 0, y ≥ 0 - Minimize Z = 50x + 75y
Subject to 200x + 100y ≥ 4000,2x + 3y ≤ 50, 40x + 35y ≤ 2500, x ≥ 0, y ≥ 0
Answer
(A) Minimize Z = 50 x + 75 y Subject to 200 x + 100 y ≥ 4000,2 x + 3 y ≥ 50, 40 x + 35 y ≥ 2500, x ≥ 0, y ≥ 0
Sign up free on Edukali to view the step-by-step worked solution and practice thousands of similar questions.
Related practice questions
- Region represented by x ≥ 0 y ≥ 0 is
- Shamali wants to invest ` 50,000 in saving certificates and PPF. She wants to invest atleast ` 15, 000 in…
- If a motorcyclist rides at a speed of 50 km/hr, he has to spend ` 2 per km on petrol. If he rides at a faster…
- A company has factories located at each of the two places P and Q . From these locations, a certain commodity…
- A manufacturer produces two types of steel trunks. He has two machines A and B . The type P of the trunk…
- A brick manufacturer has two depots A and B , with stocks of 30000 and 20000 bricks respectively. He receives…
- Maximize Z = 10 x 1 + 25 x 2 , subject to 0 ≤ x 1 ≤ 3, 0 ≤ x 2 ≤ 3, x 1 + x 2 ≤ 5
- The feasible region for a LPP is shown shaded in the figure. Let Z = 3 x – 4 y be the objective function…
More Linear Programming questions · Browse all practice questions