Practical Management Science 5th Edition - Test Bank Instant Download - Complete Test Bank With Answers Sample Questions Are Posted Below 1. Problems which deal with the direct distribution of products from supply locations to demand locations are called: a. transportation problems b. assignment problems c. network problems …
$19.99
Practical Management Science 5th Edition – Test Bank
Instant Download – Complete Test Bank With Answers
Sample Questions Are Posted Below
1. Problems which deal with the direct distribution of products from supply locations to demand locations are called:
|
2. The objective in transportation problems is typically to:
|
3. A particularly useful Excel function in the formulation of transportation problems is the:
|
4. The decision variables in transportation problems are:
|
5. For all routes with positive flows in an optimized transportation problem, the reduced cost will be:
|
6. The network model representation of the transportation problem has the following advantage relative to the special case of a simple transportation model:
|
7. In a typical network model representation of the transportation problem, the nodes indicate
|
8. In a minimum cost network flow model, the flow balance constraint for each supply node has the form
|
9. In an assignment model of machines to jobs, the machines are analogous to which of the following in a transportation problem?
|
10. Which of the following is not an example of a condition that a more complex logistics model might include?
|
11. The graphical representation of a network in an optimization problem can be an aid in the development of a spreadsheet model.
|
12. It is useful to model network problems by listing all of the arcs and their corresponding flows in one long, comprehensive list.
|
13. In transportation problems, shipments between supply points or between demand points are possible.
|
14. In transportation problems, the three sets of input numbers that are required are capacities, demands and flows.
|
15. In network models of transportation problems, arcs represent the routes for getting a product from one node to another.
|
16. In an optimized shipping plan, most of the shipments occur on the low-cost routes, but this is not always the case.
|
17. Transshipment points are locations where goods neither originate nor end up, but goods are allowed to enter such points to be shipped out to their eventual destinations.
|
18. The flow balance constraint for each transshipment node in a network flow model has the form Flow in = Flow out.
|
19. A typical shortest path problem is a special case of the general network flow model.
|
20. The cost of an arc in a shortest path problem is equal to the distance of the arc.
|
| Exhibit 5-1 Sinclair Plastics operates two chemical plants which produce polyethylene; the Ohio Valley plant which can produce up to 10,000 tons per month and the Lakeview plant which can produce up to 7,000 tons per month. Sinclair sells its polyethylene to three different auto manufacturing plants, Grand Rapids (demand = 3000 tons per month), Blue Ridge (demand = 5000 tons per month), and Sunset (demand = 4000 tons per month). The costs of shipping between the respective plants is shown in the table below:
|
21. Refer to Exhibit 5-1. Formulate (write out algebraically) an LP transportation model to help Sinclair minimize its shipping costs.
|
|||||||||||||||||||||||||||||||||||||
22. Refer to Exhibit 5-1. Implement the LP model in Solver and obtain the optimal shipping plan. What is the optimized cost?
|
23. Refer to Exhibit 5-1. Suppose the Lakeview plant was required to run at capacity. How much more would the shipping plan cost Sinclair?
|
24. Refer to Exhibit 5-1. Suppose the shipping capacity between any two plants was limited to 2500 tons per month. Design and implement a network flow version of this model in Solver and obtain the optimal shipping plan. How much more would the shipping plan cost Sinclair in that case?
|
| Exhibit 5-2 A small engineering firm employs one civil engineer, two engineering technicians, and one summer intern. The types of projects the firm does includes surveys (typically 7 per month), designs (5 per month), and construction project plans (four per month). The times, in hours, required for each employee to complete teach type of project are shown below. Based on their capabilities and time spent on travel and administrative tasks, the engineer, tech 1, tech 2, and intern can handle 5, 4, 4, and 3 projects per month, respectively.
|
25. Refer to Exhibit 5-2. Implement a LP model in Solver and determine the optimal monthly assignment plan for the firm. What is the total number of hours that will be assigned to projects each month?
|
26. Refer to Exhibit 5-2. Suppose Tech 2 will not be available during the next month. Keeping the same number of design and construction plan projects, how many survey projects would the firm be able to do? What would be the revised assignment plan in that case?
|
27. Refer to Exhibit 5-2. Based on their salaries, the engineer, tech 1, tech 2, and intern earn $90, $65, $65, and $45 per hourly, respectively. Change the firm’s objective function to minimize staff costs and find the optimal assignment plan. Does it change from the base case?
|
| Exhibit 5-3 Steve the auto parts salesman is trying to navigate his way between the rural west Texas towns of Jonestown and Upland. The possible routes for this trip are shown below, along with the mileage along each route. |
28. Refer to Exhibit 5-3. What general type of LP model can be applied to this problem? What modifications to the general type are required for this problem?
|
29. Refer to Exhibit 5-3. Implement the appropriate model in Solver and determine the shortest path for Steve. How many total miles will he travel on his trip?
|
30. Refer to Exhibit 5-3. Suppose the roads leading into and out of Krickburg are unpaved, so Steve would only be able to travel half of his usual 60 mile/hour speed on those routes. Modify the model to account for this condition. Would the shortest path change from the base case solution?
|
Original price was: $30.00.$20.00Current price is: $20.00.
Original price was: $30.00.$20.00Current price is: $20.00.
Original price was: $30.00.$20.00Current price is: $20.00.
Original price was: $30.00.$20.00Current price is: $20.00.
Original price was: $30.00.$20.00Current price is: $20.00.
Original price was: $30.00.$20.00Current price is: $20.00.
