This is an integer programming problem, but it can be solved by linear programming methods in this case.
The objective is to maximize 2x + 3y where x is the number of economy packages produced and y is the number of superior packages produced.
The constraints are:
x ≥ 0
y ≥ 0
4x + 8y ≤ 1792 (the limit on component A)
10x + 2y ≤ 1600 (the limit in component B)
The optimum value is one of the vertices on the boundaries. If you check all 4, you will find that the mix that maximizes profit is x = 128 and y = 160, resulting in a profit of $736.