Question

In: Operations Management

Developing a workforce schedule (using Linear Programming to model and solve this problem) A local bank...

  1. Developing a workforce schedule (using Linear Programming to model and solve this problem)

A local bank needs the minimum number of employees needed for each day of the week listed in the following table. If a staff is hired, his/her schedule will be working 5 consecutive days and take two days off. The bank operates seven days a week.

Day of the Week

M

T

W

TH

F

Sa

Su

Number of staff needed

4

5

5

3

5

2

3

So how will you help the bank hire the staffs?

Solutions

Expert Solution

Xi is the number of employee starting to work on day i

The representaion

Min Z = x1+x2+x3+x4+x5+x6+x7

Subject to

x1+x4+x5+x6+x7>=4

x1+x2+X5+x6+x7>=5

x1+x2+x3+x6+x7>=5

x1+x2+x3+x4+x7>=3

x1+x2+x3+x4+x5>=5

x2+x3+x4+x5+x6>=2

x3+x4+x5+X6+x7>=3

Solving this in solver

Please rate me

thanks


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...
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...
Solve the following linear programming problem using the dual simplex method: max ? = −?1 −...
Solve the following linear programming problem using the dual simplex method: max ? = −?1 − 2?2 s.t. −2?1 + 7?2 ≤ 6 −3?1 + ?2 ≤ −1 9?1 − 4?2 ≤ 6 ?1 − ?2 ≤ 1 7?1 − 3?2 ≤ 6 −5?1 + 2?2 ≤ −3 ?1,?2 ≥ 0
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...
Solve the given linear programming problem using the simplex method. If no optimal solution exists, indicate...
Solve the given linear programming problem using the simplex method. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. (Enter EMPTY if the feasible region is empty and UNBOUNDED if the objective function is unbounded.) Minimize c = x + y + z + w subject to x + y ≥ 80 x + z ≥ 60 x + y − w ≤ 50 y + z − w ≤ 50...
Solve the following linear programming problem using Solver. Be sure to write in your optimal solution...
Solve the following linear programming problem using Solver. Be sure to write in your optimal solution below the problem. Max Z = 20X1 + 30X2 + 25X3 + 32X4 s.t. 4X1 + 8X2 + 5X3 + 6X4 ≤ 40 X1 + X2 ≥ 3 (X1 + X2) ≤ (X3 + X4) ?1 ?2 ≥ 3 2 X1 = __________ X2 = ___________ X3 = ___________ X4 = ___________ Z = ____________
Solve the following linear programming problem using Solver. Be sure to write in your optimal solution...
Solve the following linear programming problem using Solver. Be sure to write in your optimal solution below the problem. Max Z = 20X1 + 30X2 + 25X3 + 32X4 s.t. 4X1 + 8X2 + 5X3 + 6X4 ≤ 40 X1 + X2 ≥ 3 (X1 + X2) ≤ (X3 + X4) x1/x2 ≥ 3/2 X1 = __________X2 = ___________X3 = ___________X4 = ___________Z = ____________
QUESTION 1: Solve the linear programming model given below using the simplex method. Write the primal...
QUESTION 1: Solve the linear programming model given below using the simplex method. Write the primal and dual results from the optimal table you obtained. MAX Z = 10?1 + 20?2 + 5?3 6?1 + 7?2 + 12?3 ≥ 560 5?1 − 3?2 +   x3 ≤ 100 2000?1 + 1000?2 + 1000?3 ≤ 62298 ?1,?2,?3 ≥ 0 IMPORTANT REMINDER ABOUT THE QUESTION SOLUTION: NEW ORDER CALCULATIONS SHOULD BE WRITTEN DETAILED WHEN CREATING THE SYMPLEX TABLES. WHEN THE CALCULATIONS ARE SHOWED AND...
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) =
Solve the following linear integer programming model using the Cutting Plane method. Show all relevant work...
Solve the following linear integer programming model using the Cutting Plane method. Show all relevant work in your solution report. Maximize Z = x1 + x2 Subject to 3x1 + 2x2 < 5 x2 < 2 x1, x2 > 0 and integer.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT