#### My Profile

1. Inform you about time table of exam.

2. Inform you about new question papers.

3. New video tutorials information.

#### Question

Minimize : Z = 6x + 4y

Subject to the conditions:

3x + 2y ≥ 12,

x + y ≥ 5,

0 ≤ x ≤ 4,

0 ≤ y ≤ 4

#### Solution

#### Question appears in these question papers

#### Similar questions

A dealer in rural area wishes to purchase a number of sewing machines. He has only Rs 5,760 to invest and has space for at most 20 items for storage. An electronic sewing machine cost him Rs 360 and a manually operated sewing machine Rs 240. He can sell an electronic sewing machine at a profit of Rs 22 and a manually operated sewing machine at a profit of Rs 18. Assuming that he can sell all the items that he can buy, how should he invest his money in order to maximize his profit? Make it as a LPP and solve it graphically.

Find graphically, the maximum value of z = 2*x* + 5*y*, subject to constraints given below :

2x + 4y ≤ 83

x + y ≤ 6

x + y ≤ 4

x ≥ 0, y≥ 0

Minimize :Z=6x+4y

Subject to : 3x+2y ≥12

x+y ≥5

0 ≤x ≤4

0 ≤ y ≤ 4

A manufacturing company makes two types of teaching aids A and B of Mathematics for class XII. Each type of A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each type of B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available per week are 180 and 30, respectively. The company makes a profit of Rs 80 on each piece of type A and Rs 120 on each piece of type B. How many pieces of type A and type B should be manufactured per week to get maximum profit? Make it as an LPP and solve graphically. What is the maximum profit per week?

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.