Question

In: Operations Management

A manager is applying the Transportation Model of linear programming to solve an aggregate planning problem....

A manager is applying the Transportation Model of linear programming to solve an aggregate planning problem. Demand in period 1 is 100 units, and in period 2, demand is 150 units. The manager has 125 hours of regular employment available for $10/hour each period. In addition, 50 hours of overtime are available for $15/hour each period. Holding costs are $2 per unit each period. a. How many hours of regular employment should be used in period 1? (Assume demand must be met in both periods 1 and 2 for the lowest possible cost and that production is 1 unit per hour.) [Blank1] 65 125 100 50 150

the answer is NOT supposed to be 125. please show all your work on excel

Solutions

Expert Solution

Regular hours aviable for production = 125 hours

Regualr capacity = 125 Units per period (As every uint takes 1 hour per unit)

Price for regualr production =$10

Price for using over time for production =$15

Inv Holdin charges = $2

Case 1:

we production will be done as per requirement of particular period

Period 1 Period 2
Demand 100 150
Production 100 150

Total cost for period 1= 100 *10 = $1000

Total cost for period 2= 125 *10 + 25 *15 = 1250 +375 =1625

Note: Here for over time produciton of 25 units more than the regular capacity the unit price for production is $15

Total cost = $1000+$1625 =$2625

The above planning is classic example when chase strategy of agrregate planning is used.

Case 2:

In Level planning of aggregate planning in every month the production will be same

Total demand = demand for period 1+ demand for period 2 = 100 +150 =250 Units

Level productioin = Total demand/ No of periods = 250/2 = 125 Units

Here we can produce 125 units every month

Period 1 Period 2
Demand 100 150
Production 125 125
Ending Inventory 25 0
regular production cost ($10) 1250 1250
Inv Holding costs ($2) 50 0
Overtime costs ($15) 0 0

Here the total cost fro period 1= 1250 +50 =$1300

For period 2 = $1250

Total cost = 1300 +1250 =$2550

Here the ideal plan for production is level strategy (Case 2) which is cost saving.

Here coming back to question the actual requriement for production is 125 units, And we can have the monthly regular time for production is also 125 Hrs.

Hence here the answer to the question is 125 hrs is utilised in period 1

Please like the answer, Thank you


Related Solutions

Consider the following transportation problem. Formulate this problem as a linear programming model and solve it...
Consider the following transportation problem. Formulate this problem as a linear programming model and solve it using the MS Excel Solver tool. Shipment Costs ($), Supply, and Demand: Destinations Sources 1 2 3 Supply A 6 9 100 130 B 12 3 5 70 C 4 8 11 100 Demand 80 110 60 (4 points) Volume Shipped from Source A __________ (4 points) Volume Shipped from Source B __________ (4 points) Volume Shipped from Source C __________ (3 points) Minimum...
Solve this linear programming (LP) problem using the transportation method. Find the optimal transportation plan and...
Solve this linear programming (LP) problem using the transportation method. Find the optimal transportation plan and the minimum cost. (Leave no cells blank - be certain to enter "0" wherever required. Omit the "$" sign in your response.) Minimize 8x11 + 2x12 + 5x13 + 2x21 + x22 + 3x23 + 7x31 + 2x32 + 6x33 Subject to x11 + x12 + x13 = 90 x21 + x22 + x23 = 105 x31 + x32 + x33 = 105 x11...
Define a linear programming model and its components. Discuss which 3 properties a planning problem needs...
Define a linear programming model and its components. Discuss which 3 properties a planning problem needs to meet to be modeled as an LP? Define the feasible set and its corner points. Explain how one can find the combinations of the decision variables corresponding to the corner points. How one can use the corner points to find the optimal solution? Define special situations: unbounded feasible set, infeasibility, alternate solutions, redundant constraints. Discuss what do these situations imply for the manager's...
Solve the linear programming problem by the method of corners. Find the minimum and maximum of...
Solve the linear programming problem by the method of corners. Find the minimum and maximum of P = 4x + 2y subject to 3x + 5y ≥ 20 3x + y ≤ 16 −2x + y ≤ 1 x ≥ 0, y ≥ 0. The minimum is P =   at (x, y) = The maximum is P =   at (x, y) =
Aggregate Demand II: Applying the IS - LM Model- End of Chapter Problem   Use the...
Aggregate Demand II: Applying the IS - LM Model- End of Chapter Problem   Use the IS-LM model to predict the short-run effects of each of the following shocks on income, the interest rate, consumption, and investment. In each case, explain what the Fed should do to keep income at its initial level.   For each of these four shocks, (1) shift the appropriate curve in the IS-IM graph to reflect how the economy will respond to the shock; (2)...
Solve the linear programming problem by the method of corners. Maximize P = 5x + 6y    ...
Solve the linear programming problem by the method of corners. Maximize P = 5x + 6y     subject to   x + y ≤ 10 3x + y ≥ 12 −2x + 3y ≥ 8 x ≥ 0, y ≥ 0  
Solve the linear programming problem by the method of corners. Minimize C = 2x + 5y    ...
Solve the linear programming problem by the method of corners. Minimize C = 2x + 5y     subject to   4x + y ≥ 38 2x + y  ≥ 30 x + 3y  ≥ 30 x ≥ 0, y ≥ 0  
Use the method of this section to solve the linear programming problem. Minimize   C = 2x...
Use the method of this section to solve the linear programming problem. Minimize   C = 2x − 3y + 6z subject to   −x + 2y − z ≤ 9 x − 2y + 2z ≤ 10 2x + 4y − 3z ≤ 12 x ≥ 0, y ≥ 0, z ≥ 0   The minimum is C =   at (x, y, z) =    .
Use the simplex method to solve the linear programming problem. The maximum is ___ when x1=...
Use the simplex method to solve the linear programming problem. The maximum is ___ when x1= ___ and x2=___ a.) Maximize : z= 24x1+2x2 Subject to: 6x1+3x2<=10, x1+4x2<=3 With: x1>=0, x2>=0 b.) Maximize: z=2x1+7x2 Subject to: 5x1+x2<=70, 7x1+2x2<=90, x1+x2<=80 With: x1,x2>=0 c.) Maximize: z=x1+2x2+x3+5x4 Subject to: x1+3x2+x3+x4<=55, 4x+x2+3x3+x4<=109 With: x1>=0, x2>- 0, x3>=0, x4>=0 d.) Maximize: z=4x1+7x2 Subject to: x1-4x2<=35 , 4x1-3x2<=21 With: x1>=0, x2>=0
Solve the linear programming problem by the method of corners. Maximize P = 3x + 6y    ...
Solve the linear programming problem by the method of corners. Maximize P = 3x + 6y     subject to   x + y ≤ 10 3x + y ≥ 12 −2x + 3y ≥ 13 x ≥ 0, y ≥ 0   The maximum is P = ? at (x, y) = ( ? ),
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT