Question: (a) Formulate and solve a linear programming model for this make-or-buy application. (Let FM = number of frames manufactured, FP = number of frames purchased,

(a)
Formulate and solve a linear programming model for this make-or-buy application. (Let FM = number of frames manufactured, FP = number of frames purchased, SM = number of supports manufactured, SP = number of supports purchased, TM = number of straps manufactured, and TP = number of straps purchased. Express time in minutes per unit.)
Min = ___
Cutting constraint = ___
Milling constraint = ___
Shaping constraint = ___
Frame constraint = ___
Support constraint = ___
Strap constraint = __
FM, FP, SM, SP, TM, TP 0
How many of each component should be manufactured and how many should be purchased? (Round your answers to the nearest whole number.)
(FM, FP, SM, SP, TM, TP) = ___
(b)
What is the total cost (in $) of the manufacturing and purchasing plan?
$ = ____
(c)
How many hours of production time are used in each department? (Round your answers to two decimal places.)
Cutting ___ hrs
Milling ___ hrs
Shaping ___ hrs
(d)
How much (in $) should Frandec be willing to pay for an additional hour of time in the shaping department?
$ = ___
(e)
Another manufacturer has offered to sell frames to Frandec for $45 each. Could Frandec improve its position by pursuing this opportunity? Why or why not? (Round your answer to three decimal places.)
---Select--- Yes No . The reduced cost of ____ indicates that the solution ---Select--- can cannot be improved.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
