A workshop manufactures two products

MATHEMATICS · Multi-part · CBSE · Mathematics · Linear Programming · Linear Programming

Problem

A workshop manufactures two products, AA and BB. Each unit of product AA requires 22 hours of machine time and 11 hour of skilled labour, while each unit of product BB requires 11 hour of machine time and 22 hours of skilled labour. Weekly availability is limited to 4040 hours of machine time and 3636 hours of skilled labour. The management also decides that the combined weekly output must be at least mm units, where mm is a non-negative integer determined by market demand. (i) Taking xx and yy to denote the weekly numbers of units of AA and BB respectively, write all the linear inequalities that express the above restrictions. (ii) For m=18m = 18, sketch the region consisting of all feasible production plans and state whether it is bounded or unbounded. (iii) Find the range of values of mm for which at least one feasible production plan exists. Explain your reasoning clearly.

Related theory

Browse the problem library