Q13 of 118 Page 30

Amit’s mathematics teacher has given him three long lists of problems with the instruction to submit not more than 100 of them (correctly solved) for credit. The problem in the first set are worth 5 points each, those in the second set are worth 4 points each, and those in the third set are worth 6 points each. Amit knows from experience that he requires on the average 3 minutes to solve a 5 point problem, 2 minutes to solve a 4 point problem, and 4 minutes to solve a 6 point problem. Because he has other subjects to worry about, he cannot afford to devote more than hours altogether to his mathematics assignment. Moreover, the first two sets of problems involve numerical calculations and he knows that he cannot stand more than hours work on this type of problem. Under these circumstances, how many problems in each of these categories shall he do in order to get maximum possible credit for his efforts? Formulate this as a LPP.


Let he should solve x, y, z questions from set I, II and III respectively.


Given, each question from set I, II, III earn 5, 4, 6 points respectively, so x questions of set I, y questions of set II and z questions of set III earn 5x, 4y and 6z points, let total point credit be U


So, U = 5x + 4y + 6z


Given, each question of set I, II and III require 3, 2 and 4 minutes respectively, so, x questions of set I, y questions of set II and z questions of set III require 3x, 2y and 4z minutes respectively but given that total time to devote in all three sets is


hours = 210 minutes and first two sets is hours = 150 minutes


So,


3x + 2y + 4z 210 (First constraint)


3x + 2y 150 (Second constraint)


Given, total number of questions cannot exceed 100


So, x + y + z 100 (Third constraint)


Hence, mathematical formulation of LPP is


Find x and y which


maximize U = 5x + 4y + 6z


Subject to constraint,


3x + 2y + 4z 210


3x + 2y 150


x + y + z 100


x, y, z 0 [Since number of questions to solve from each set


cannot be less than zero.]


More from this chapter

All 118 →
11

Two tailors A and B earn Rs 150 and Rs 200 per day respectively. A can stitch 6 shirts and 4 pants per day while B can stitch 10 shirts and 4 pants per day. Form a linear programming problem to minimize the labour cost to produce at least 60 shirts and 32 pants.

12

An airline agrees to charter planes for a group. The group needs at least 160 first class seats and at least 300 tourist class seats. The airlines must use at least two of its model 314 planes which have 20 first class and 30 tourist class seats. The airline will also use some of its model 535 planes which have 20 first class seats and 60 tourist class seats. Each flight of a model 314 plane costs the company Rs 100, 000 and each flight of a model 535 plane costs Rs 150, 000. How many of each type of plane should be used to minimize the flight cost? Formulate this as a LPP.

14

A farmer has a 100 - acre farm. He can sell the tomatoes, lettuce, or radishes he can raise. The price he can obtain is Rs 1 per kilogram for tomatoes, Rs 0.75 a head for lettuce and Rs 2 per kilogram for radishes. The average yield per acre is 2000 kgs for radishes, 3000 heads of lettuce and 1000 kilograms of radishes. Fertilizer is available at Rs 0.50 per kg and the amount required per acre is 100 kgs each for tomatoes and lettuce and 50 kilograms for radishes. Labour required for sowing, cultivating and harvesting per acre is 5 man - days for tomatoes and radishes and 6 man – days for lettuce. A total of 400 man - days of labour are available at ₹ 20 per man - day. Formulate this problem as a LPP to maximize the farmer’s total profit.

15

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 Rs 400 and each small van is Rs 200. Not more than Rs 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.