Answer:
Labour hours constraint : 2a + 2b + 3c ≤ 150
Explanation:
<em>Linear programming is a mathematical model that is used to solve a problem when a firm wants to maximize profit in the midst of multiple resource constraints.</em>
The following steps should be followed:
<em>Step 1: Define the variables</em>
a= the units of product Anchor
b= the units of product Bearing
c= the units of product Casting
<em>Step 2: Define the constraints:</em>
The constraints represent the limitations which could be resource; in this case machine hours and direct labour hours. Since the constraint in focus is labour hours , so we only consider it.
Subject
Constraints: Labour hours : 2a + 2b + 3c ≤ 150
Non-negativity constraints a, b , c ≥ 0
Since the total available labour hours is 150 hours then the total consumption hours can either be equal to or less than 150, but can never be higher than 150.
The labour hours constraint is represented by 2a + 2b + 3c ≤ 150
