Professional Documents
Culture Documents
August 16,2021
Solution:
a. Letting the variables X1, X2, X3, and X4 denote the four different types of bikes, the linear
program for the problem may be set up as shown below. The objective is to maximize
aggregate profit under various constraints.
The problem may be easily implemented in Excel. The solution is shown on next page;
however, the Excel file is attached with this document.
In the reduced cost column, we see that the profit function for X2 will need to go beyond
(25 + 13) = $38 for this particular bike to be included in the optimal solution. As such, if
the profit margin for City Scape increases to $35, it will have no bearing. It has to go
beyond $38.
f. The dual price (shadow price) for assembly hours is positive ($8 per hour) since we
observe that the assembly time constraint is fully used up. Again, this information may
be extracted from the sensitivity report; this is shown below:
Constraints
Shado Constrai Allowabl Allowabl
Final w nt e e
Valu
Cell Name e Price R.H. Side Increase Decrease
$G$2
4 Space 375 0 500 1E+30 125
g. In the table above, we see that there is a negative shadow price associated with the
demand constraint; that is, if we add one more to the inventory the optimal profit will
reduce by $10. So, if we were to add another five bikes, the total profit will reduce by 5 x
$10 = $50.
h. Clearly, the resource that yields a positive impact is the assembly hours. We may increase
the assembly time to as much as 1,325 hours.