Linear ProgrammingClass 12 Mathematics Case Study Questions

13 Questions
Generated by KedovoAI
Case 1 of 13
Case Study6 marks

Artisan Furniture Production

An artisan furniture maker produces two types of items: chairs and tables. The production process involves two main stages: cutting and finishing. To make a chair, it requires 1 hour of cutting and 1 hour of finishing. To make a table, it requires 2 hours of cutting and 1 hour of finishing. The workshop has a maximum of 12 hours of cutting time and 9 hours of finishing time available per day. The profit from selling one chair is ₹100, and the profit from selling one table is ₹180. The artisan wants to determine the number of chairs and tables to produce daily to maximize the total profit, assuming all items produced are sold.
Questions on this case
1
If xx is the number of chairs and yy is the number of tables produced, which of the following inequalities represents the constraint on cutting time?
(1 mark)MCQ
2
What is the objective function for maximizing the profit?
(1 mark)MCQ
3
The feasible region is defined by the constraints x+2y≤12x + 2y \leq 12, x+y≤9x + y \leq 9, x≥0x \geq 0, and y≥0y \geq 0. Determine the corner points of this feasible region.
(2 marks)
4
Calculate the total profit at each corner point of the feasible region.
(1 mark)
5
To achieve the maximum profit, how many chairs and tables should the artisan produce, and what is the maximum profit?
(1 mark)