Merlin Park Hospital has 4 scan machines and 4 patients to scan. Each machine must beassigned to complete 1 scan. Each patient must be scanned only once by 1 machine. The timerequired for each machine to scan each patient is provided in the table below.Time (minutes)Patient 1 Patient 2 Patient 3 Patient 4Machine 142152421Machine 2361815Machine 32124927Machine 4121830(i) Present the detailed network representation of the scan assignment problem.

Find the Network representation below:

Answered: Merlin Park Hospital has 4 scan…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter4: Linear Programming Models

Section: Chapter Questions

Problem 107P

See similar textbooks

Similar questions

The Hamilton County Local Government has eight sectors which need fire protection. Adequate Fire protection can be provided in each sector either by building a fire station in that sector, or by building a fire station in another sector which is no more than a 12-minute drive away. The time to drive between the centers of each pair of sectors is given in the following table. (Because of one-way streets and left turns the times are not symmetric.) The cost to build a fire station is the same in each sector. Formulate an integer programming model to choose which sectors should have their own fire station. Solve the model by using Excel Solver.
The network below shows the flows possible between pairs of six locations. A graph with 6 nodes and 13 directed arcs is shown. Node 1 is connected to node 2 by arc of value 17, to node 3 by arc of value 19, and to node 5 by arc of value 9. Node 2 is connected to node 3 by arc of value 8 and to node 4 by arc of value 14. Node 3 is connected to node 2 by arc of value 5, to node 4 by arc of value 9, to node 5 by arc of value 7, and to node 6 by arc of value 24. Node 4 is connected to node 3 by arc of value 9 and to node 6 by arc of value 13. Node 5 is connected to node 3 by arc of value 7 and to node 6 by arc of value 11. Node 6 has no directed arcs directed to other nodes. Formulate an LP to find the maximal flow possible from node 1 to node 6. (Let xij represent the flow from node i to node j. Enter your maximum flows as a comma-separated list of inequalities.) Max s.t.Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows…
Please use excel for this problem A furniture manufacturer produces two types of tables – country and contemporary – using three types of machines. The time required to produce the tables on each machine is given in the following table: Machine Country Contemporary Total Machine Time Available Per Week Router 3.5 4.0 1,000 Sander 4.5 6.5 2,000 Polisher 3.0 2.0 1,500 Country tables sell for $395 and contemporary tables sell for $515. Management has determined that at least 25% of the tables made should be country and at least 38% should be contemporary. How many of each type of table should the company manufacture if it wants to maximize its revenue? Formulate an LP model for this problem Create the spreadsheet model and use Solver to solve the problem.
Airline Scheduling. Alpha Airline wishes to schedule no more than one flight out of a given airport to each of the following cities: C, D, L, and N. The available departure slots are 8 a.m., 10 a.m., and 12 noon. Alpha leases the airplanes at the cost of $5000 before and including 10 a.m. and $3000 after 10 a.m., and is able to lease at most two per departure slot. Also, if a flight leaves for location N in a time slot, there must be a flight leaving for location L in the same time slot. The expected profit (in $1000) contribution before rental costs per flight is shown in the table below. Time Slot 8 10 12 C 10 6 6 D 9 10 9 L 14 11 10 N 18 15 10 a) Formulate an integer linear program model that can be used to find the profit-maximizing schedule. Define your decision variables as Xij = 1 if a flight to destination i occurs in time slot j and Xij = 0 otherwise; and Yj = number of airplanes rented for time slot j. Write the objective function and all the constraints. b)…
A firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced in the plants must be shipped to satisfy the demand of 3 customers. Customer 1 requires 75 units per day, customer 2 requires 100 units per day, and customer 3 requires 175 units per day. The shipping costs for each possible route are shown in the table below: Shipping Costs Customer per unit Plant 1 2 3 A $ 25 $ 35 $ 15 B $ 20 $ 30 $ 40 C $ 40 $ 35 $ 20 D $ 15 $ 20 $ 25 The firm needs to satisfy all demand each day, but would like to minimize the total costs. The firm’s problem falls within which classification? Multiple Choice Cost-benefit-trade-off Assignment problems Transshipment problems Transportation problems Resource-allocation
A firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced in the plants must be shipped to satisfy the demand of 3 customers. Customer 1 requires 75 units per day, customer 2 requires 100 units per day, and customer 3 requires 175 units per day. The shipping costs for each possible route are shown in the table below: Shipping Costs Customer per unit Plant 1 2 3 A $ 25 $ 35 $ 15 B $ 20 $ 30 $ 40 C $ 40 $ 35 $ 20 D $ 15 $ 20 $ 25 The firm needs to satisfy all demand each day, but would like to minimize the total costs. Which of the following constraints is unnecessary for this problem (xi,j is the number of widgets shipped from factory i to customer j)? A firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced…
XYZ Corporation operates two plants, each of which has a capacity of 140 units per day. Each day, XYZ must ship their product to each of four customers. Customers A, B, and C each have a demand of 11 units per day while customer D has a demand of 247 units per day. The cost of shipping one unit of each product from each of the two plants to each of the customers is shown in the table below. Customer A Customer B Customer C Customer D Plant 1 12 18 21 10 Plant 2 16 14 18 20 How many units should XYZ ship from each plant to each customer? Customer A Customer B Customer C Customer D Plant 1 Plant 2 What is the least XYZ will spend on shipping each day?
Winkler Furniture manufactures two different types of china cabinets: a French Provincial model and a Danish Modern model. Each cabinet produced must go through three departments: carpentry, painting, and finishing. The table on this page contains all relevant information concerning production times per cabinet produced and production capacities for each operation per day, along with net revenue per unit produced. The firm has a contract with an Indiana distributor to produce a minimum of 300 of each cabinet per week (or 60 cabinets per day). Owner Bob Winkler would like to determine a product mix to maximize his daily revenue.Use Solver to solve the problem. You need to have one Excel sheet with the problem setup and another sheet with Solver solution
The town of Lexington purchases gasoline from three vendors to fuel its fleet of municipal vehicles. Each vendor delivers gasoline in 6,000 gallon quantities. Since vendors must deliver the fuel, a transportation fee (based on the distance the vendor must travel) is added to each delivery. The number of deliveries required by each location, the cost of supplying a truckload of gasoline to each location from each vendor, and the number of truckloads each vendor can deliver are provided below: PoliceStation FireStation BusDepot PublicWorksGarage Deliveries(truckloads)available Vendor A Vendor B Vendor C Deliveries(truckloads)required $500 $350 $400 12 $525 $425 $375 2 $550 $450 $625 18 $600 $575 $475 6 20 14 10 Assuming that the price per gallon of fuel is the same for each vendor, develop a linear programming model that minimizes the total transportation fee that Lexington must pay for supplying all of its facilities’ fuel needs.
Transeast Airlines flies planes on the following route:L.A.–Houston–N.Y.–Miami–L.A. The length (in miles) ofeach segment of this trip is as follows: L.A.–Houston, 1,500miles; Houston–N.Y., 1,700 miles; N.Y.–Miami, 1,300miles; Miami–L.A., 2,700 miles. At each stop, the planemay purchase up to 10,000 gallons of fuel. The price of fuelat each city is as follows: L.A., 88¢; Houston, 15¢; N.Y.,$1.05; Miami, 95¢. The plane’s fuel tank can hold at most12,000 gallons. To allow for the possibility of circling overa landing site, we require that the ending fuel level for eachleg of the flight be at least 600 gallons. The number ofgallons used per mile on each leg of the flight is1 (average fuel level on leg of flight/2,000)Review Problems 123To simplify matters, assume that the average fuel level onany leg of the flight isFormulate an LP that can be used to minimize the fuel costincurred in completing the schedule
Amy Zeng, owner ofZeng's Restaurant Distributions,supplies nonperishable goods to restaurants around the metroarea. She stores all the goods in a storage area with a single dockand one aisle. The goods are divided into five categories accordingto the following table. The table indicates the number of tripsper month to store or retrieve items in each category, as well asthe number of storage blocks taken up by each. The following picture of the storage area provides an identificationnumber for each of the 16 storage blocks. For each item category,indicate into which blocks it should be stored.
Use SIMPLEX METHOD to solve the following problem A manufacturer makes two products, each requiring time on two different machines. Each unit of product 1 requires 3/4 hour of machine 1, and 1/4 hour on machine 2; each unit of product 2 requires 1/4 hour on machine 1, and 1/3 hour on machine 2. Machine 1 is available for 12 hours each day, and Machine 2, 10 hours. The unit profit on Products 1 and 2 are 50 pesos and 60 pesos, respectively. Determine the optimal combination of the products that will maximize profit.

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS