Solve the following linear programming problem graphically:
Minimise Z = 3x + 2y
subject to the constraints x + y ≥ 8, 3x + 5 y ≤ 15, x ≥ 0, y ≥ 0
Solve the following linear programming problem graphically:
Minimise Z = x + y
subject to the constraints x - y ≤ - 1, - x + y ≤ 0, x, y ≥ 0.
We are to maximise
Z = x + y subject to the constraints x - y ≤ - 1, - x + y ≤ 0, x, y ≥ 0
Consider a set of rectangular cartesian axes OXY in the plane.
It is clear that any point which satisfies x ≥ 0, y ≥ 0 lies in the first quadrant.
Let us draw the graph of
x - y = - 1
For x = 0, - y = - 1 ⇒ y = 1
For y = 0, x = - 1
∴ line x - y = 1 meets OX in A (- 1, 0) and OY in B (0, 1)
Again we draw the graph of - x + y = 0
For x = 0, y = 0
For y = 0, x = 0
∴ line - x + y = 0 passes through O (0, 0).
Since feasible region satisfies all the constraints
∴ in this case, feasible region is empty
∴ there exists no solution to the given linear programming problem.
A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time and 3 hours of craftman’s time in its making while a cricket bat takes 3 hours of machine time and 1 hour of craftman’s time. In a day, the factory has the availability of not more than 42 hours of machine time and 24 hours of craftman’s time.
(i) What number of rackets and bats must be made if the factory is to work at full capacity?
(ii) If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively, find the maximum profit of the factory when it works at full capacity.
If a young man rides his motor - cycle at 25 km per hour, he has to spend Rs. 2 per km on petrol ; if he rides it at a faster speed of 40 km per hour, the petrol cost increases to Rs. 5 per km. He has Rs. 100 to spend on petrol and wishes to find what is the maximum distance he can travel within one hour. Express this as a linear programming problem and then solve it.
A firm is engaged in producing two products A and B. Each unit of product A requires two kg of raw material and four labour hours for processing whereas each unit of product B requires three kg of raw material and three hours of labour, of the same type. Every week, the firm has an availability of 60 kg of raw material and 96 labour hours. One unit of product A sold yields Rs. 40 and one unit of product B sold gives Rs. 35 as profit.
Formulate this problem as linear programming problem to determine as to how many units of each of the products should be produced per week so that the firm can earn the maximum profit. Assume that there is no marketing constraints so that all that is produced can be sold.