Match List-I with List-II
| List-I | List-II | ||
|---|---|---|---|
| Situation | Type of linear programming problem | ||
| (A) | Choosing the quantities of two foods so that a mixture has at least the required nutrients at the least cost | (I) | Transportation problem |
| (B) | Deciding how many units of two products to make with limited machine hours and raw material, to earn the maximum profit | (II) | Diet problem |
| (C) | Sending goods from two factories to three depots so that supply and demand are met at the least total cost | (III) | Assignment problem |
| (D) | Choosing employees for the jobs of a task, each person working on only one job, so that the task is finished within the deadline | (IV) | Manufacturing problem |
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → (A)-(II), (B)-(IV), (C)-(I), (D)-(III)
Each situation is one of the standard types of linear programming problems.
(A) Choosing the quantities of two foods so that a mixture has at least the required nutrients at the least cost
This matches (II) Diet problem: the nutrient needs give “at least” constraints, and the cost is minimised.
(B) Deciding how many units of two products to make with limited machine hours and raw material, to earn the maximum profit
This matches (IV) Manufacturing problem: limited resources give the constraints, and the profit is maximised.
(C) Sending goods from two factories to three depots so that supply and demand are met at the least total cost
This matches (I) Transportation problem: the supply and demand give the constraints, and the transport cost is minimised.
(D) Choosing employees for the jobs of a task, each person working on only one job, so that the task is finished within the deadline
This matches (III) Assignment problem: people are assigned to jobs, one job per person.