A retired person wants to invest an amount of Rs. 50, 000. His broker recommends investing in two type of bonds ‘A’ and ‘B’ yielding 10% and 9% return respectively on the invested amount. He decides to invest at least Rs. 20,000 in bond ‘A’ and at least Rs. 10,000 in bond ‘B’. He also wants to invest at least as much in bond ‘A’ as in bond ‘B’. Solve this linear programming problem graphically to maximise his returns.

A small firm manufactures necklaces and bracelets. The total number of necklaces and bracelets that it can handle per day is at most 24. It takes one hour to make a bracelet and half an hour to make a necklace. The maximum number of hours available per day is 16. If the profit on a necklace is ` 100 and that on a bracelet is ` 300. Formulate on L.P.P. for finding how many of each should be produced daily to maximize the profit? It is being given that at least one of each must be produced.

Solve the following L.P.P. graphically :
Minimise Z = 5x + 10y
Subject to x + 2y ≤ 120
Constraints x + y ≥ 60
x – 2y ≥ 0
and x, y ≥ 0

The line L₁: y = x = 0 and L₂: 2x + y = 0 intersect the line L₃: y + 2 = 0 at P and Q respectively. The bisectorof the acute angle between L₁ and L₂ intersects L₃ at R.
Statement-1: The ratio PR: RQ equals 2√2:√5
Statement-2: In any triangle, the bisector of an angle divides the triangle into two similar triangles.