Let x be the number of Type A souvenirs, and let y be the number of Type B souvenirs to be made. Then
the profit in dollars will be P = x + 1.2y, which is the objective function to be maximized.
Next, we need to set up the constraints. On Machine I, there are at most 180 minutes available, and each
Type A souvenir uses 2 minutes and each Type B souvenir uses 1 minutes.
So the total amount of time on
Machine I is given by 2x+y and cannot be greater than 180 minutes, so 2x+y ≤ 180 is our first constraint.
Similarly for Machine II, the amount of time is x + 3y and cannot exceed 300 minutes, so x + 3y ≤ 300 is
our second constraint.
Lastly, we cannot make negative numbers of souvenirs, so x ≥ 0 and y ≥ 0 are also
constraints.
In total, we need to maximize P = x + 1.2y subject to the constraints
2x + y ≤ 180
x + 3y ≤ 300
x ≥ 0, y ≥ 0