A furniture dealer deals only two items viz., tables and chairs. He has to invest Rs.10,000/- and a space to store atmost 60 pieces. A table cost him Rs.500/– and a chair Rs.200/–. He can sell all the items that he buys. He is getting a profit of Rs.50 per table and Rs.15 per chair. Formulate this problem as an LPP, so as to maximize the profit.

A dietician wishes to mix two types of food F₁ and F₂ in such a way that the vitamin contents of the mixture contains atleast 6 units of vitamin A and 9 units of vitamin B. Food F₁ costs Rs.50 per kg and F₂ costs Rs 70 per kg. Food F₁ contains 4 units per kg of vitamin A and 6 units per kg of vitamin B while food F₂ contains 5 units per kg of vitamin A and 3 units per kg of vitamin B. Formulate the above problem as a linear programming problem to minimize the cost of mixture.

A company produces two types of pens A and B. Pen A is of superior quality and pen B is of lower quality. Profits on pens A and B are Rs. 5 and Rs. 3 per pen respectively. Raw materials required for each pen A is twice as that of pen B. The supply of raw material is sufficient only for 1000 pens per day. Pen A requires a special clip and only 400 such clips are available per day. For pen B, only 700 clips are available per day. Formulate this problem as a linear programming problem.

Draw a network diagram for the project whose activities and their predecessor relationships are given below:

A firm manufactures two products A and B on which the profits earned per unit are Rs. 3 and Rs. 4 respectively. Each product is processed on two machines M₁ and M₂. Product A requires one minute of processing time on M₁ and two minutes on M₂, While B requires one minute on M₁ and one minute on M₂. Machine M₁ is available for not more than 7 hrs 30 minutes while M₂ is available for 10 hrs during any working day. Formulate this problem as a linear programming problem to maximize the profit.