A firm has to transport at least 1200 packages daily using large vans which carry 200 packages each and small vans which can take 80 packages each. The cost of engaging each large van is ₹400 and each small van is ₹200. Not more than ₹3000 is to be spent daily on the job and the number of large vans cannot exceed the number of small vans. Formulate this problem as a LPP given that the objective is to minimize cost.

Asked by Sakshi | 1 year ago | 63

Let the number of large vans and small vans used for transporting the packages be x and y, respectively.

It is given that the cost of engaging each large van is ₹400 and each small van is ₹200.

Cost of engaging x large vans = ₹400x

Cost of engaging y small vans = ₹200y

Let Z be the total cost of engaging x large vans and y small vans.

∴ Z = ₹(400x + 200y)

The firm has to transport at least 1200 packages daily using large vans which carry 200 packages each and small vans which can take 80 packages each.

∴ Number of packages transported by x large vehicles + Number of packages transported by y small vehicles ≥ 1200

⇒ 200x + 80y ≥ 1200

Not more than ₹3000 is to be spent daily on the transportation.

∴ 400x + 200y ≤ 3000

Also, the number of large vans cannot exceed the number of small vans.

∴ x ≤ y

Thus, the linear programming problem of the given problem is

Minimise Z = ₹(400x + 200y)

Subject to constraints

200x + 80y ≥ 1200

400x + 200y ≤ 3000

x ≤ y

x ≥ 0, y ≥ 0

Minimize Z = 2x + 4y

Subject to

x+y≥8

x+4y≥12

x≥3, y≥2

Maximize Z = 7x + 10y

Subject to

x+y≤30000

y≤12000

x≥6000

x≥y

x, y≥0

Maximize Z = 10x + 6y

Subject to

3x+y≤122x+5y≤34 x, y≥0

Maximize Z = 15x + 10y

Subject to

3x+2y≤802x+3y≤70 x, y≥0