The j. mehta company’s production manager is planning for a series of

The J. Mehta Firm's manufacturing supervisor is planning for a sequence of 1-month manufacturing durations for chrome steel sinks. The demand for the subsequent Four months is as follows:
DEMAND FOR
MONTH STAINLESS STEEL SINKS
1 ……………………………… 130
2 ……………………………… 160
three ……………………………… 290
Four ……………………………… 150
The Mehta agency can usually produce 80 chrome steel sinks in a month. That is achieved throughout common manufacturing hours at a value of $100 per sink. If demand in any 1 month can't be happy by common manufacturing, the manufacturing supervisor has three different decisions: (1) He can produce as much as 50 extra sinks per thirty days in extra time however at a value of $150 per sink; (2) He should buy a restricted variety of sinks from a pleasant competitor for resale (the utmost variety of exterior purchases over the Four-month interval is 400 sinks, at a value of $200 every); (three) He can fill the demand from his on-hand stock. The stock carrying value is $20 per sink per thirty days. Again orders usually are not permitted. Stock available at first of month 1 is 40 sinks.
1. Formulate algebraically the Linear Programming (LP) mannequin for the above “manufacturing scheduling” downside. Outline the choice variables, goal operate, and constraints.
2. Formulate this similar linear programming downside on a spreadsheet and SOLVE utilizing Excel solver (Present a printout of the corresponding “Excel Spreadsheet” and the “Reply Report”).