In a cattle breeding firm, it is prescribed that the food ration for one animal must contain 14, 22, and 1 unit of nutrients A, B, and C respectively. Two different kinds of fodder are available. Each unit weight of these two contains the following amounts of these three nutrients:
| Nutrient\Fodder | Fodder 1 | Fodder2 |
|---|---|---|
| Nutrient A | 2 | 1 |
| Nutrient B | 2 | 3 |
| Nutrient C | 1 | 1 |
| The cost of fodder 1 is ₹ 3 per unit and that of fodder ₹ 2 per unit. Formulate the L.P.P. to minimize the cost. |
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →Taking as units of Fodder 1 and Fodder 2, minimise cost subject to the three nutrient requirements and non-negativity.
Decision variables: Let = number of units of Fodder 1 and = number of units of Fodder 2 used in one animal's ration.
Objective function: Fodder 1 costs per unit and Fodder 2 costs per unit, so the total cost to be minimised is
Constraints (the ration must supply at least the prescribed amount of each nutrient):
…
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.