Use Solver to find the optimal solution to the given integer programming problem.
Consider the same operating room discussed in the Solver example in the chapter. Suppose that instead of maximizing profit from surgeries, our objective is to minimize the cost incurred due to surgeries. As before, we denote the number of major surgeries scheduled in a week using decision variable s1, the number of minor surgeries scheduled in a week using decision variable s2, and the number of elective surgeries scheduled in a week using decision variable s3.
The relevant data for each type of surgery is:
|
Surgery Type
|
Cost
|
Operating Room Time
|
Labor Hours
|
|
Major (s1)
|
$5,500
|
4 hours
|
15
|
|
Minor (s.2)
|
$31000
|
0.5 hour
|
10
|
|
Elective (s3)
|
$4,000
|
2 hours
|
12
|
In addition, for this problem we will assume the facility has only one operating room, which is available 60 hours per week, and the facility has a total of 500 labor hours a week that can be devoted to surgeries.
Prior to using Solver, you may want to formulate your problem (i.e., clearly identify decision variables, objective function, and constraints).