All Matches

Solution Library

Expert Answer

Textbooks

Search Textbook questions, tutors and Books

Oops, something went wrong!

Change your search query and then try again

Result Not Found

Books FREE
Tutors
Study Help
Hire a Tutor
AI Study Help New

Search
Sign In
Register

study help
business
an introduction to management science

Questions and Answers of An Introduction to Management Science

=e. Would your answers in parts a and c definitely remain valid if both the advertising budget and planning budget were increased by $100,000 each?
=f. If only $100,000 can be added to either the advertising budget or the planning budget, where should it be added to do the most good?
=g. If $100,000 must be removed from either the advertising budget or the planning budget, from which budget should it be removed to do the least harm?
=E*5.16. Follow the instructions of Problem 5.15 for the continuation of the Super Grain Corp. case study as presented in Section 3.4 including the spreadsheet in Figure 3.7 showing its formulation
=E*5.17. Consider the Union Airways problem presented in Section 3.3, including the spreadsheet in Figure 3.5 showing its formulation and optimal solution.Management now is considering increasing the
=a. Which of the numbers in the rightmost column of Table 3.5 can be increased without increasing total cost? In each case, indicate how much it can be increased (if it is the only one being changed)
=b. For each of the other numbers, how much would the total cost increase per increase of 1 in the number?For each answer, indicate how much the number can be increased (if it is the only one being
=c. Do your answers in part b definitely remain valid if all the numbers considered in part b are simultaneously increased by 1?
=d. Do your answers in part b definitely remain valid if all 10 numbers are simultaneously increased by 1?
=e. How far can all 10 numbers be simultaneously increased by the same amount before your answers
=in part b may no longer be valid?
=6.16. One of Speedy Airlines’s flights is about to take off from Seattle for a nonstop flight to London. There is some flexibility in choosing the precise route to be taken, depending upon
=6.15.* At a small but growing airport, the local airline company is purchasing a new tractor for a tractor-trailer train to bring luggage to and from the airplanes. A new mechanized luggage system
=e. If each number in the table represented your time(in minutes) for driving your car from one town to the next, would the answer in part c now give your minimum-time route?
=d. If each number in the table represented your cost(in dollars) for driving your car from one town to the next, would the answer in part c now give your minimum-cost route?
=c. Use part b to identify your shortest route.
=a. Formulate a network model for this problem as a shortest path problem by drawing a network where nodes represent towns, links represent roads, and numbers indicate the length of each link in
=6.14. You need to take a trip by car to another town that you have never visited before. Therefore, you are studying a map to determine the shortest route to your destination. Depending on which
=E*6.13. Reconsider the Littletown Fire Department problem presented in Section 6.4 and depicted in Figure 6.11. Due to maintenance work on the one-mile road between nodes A and B, a detour currently
=E*d. Formulate and solve a spreadsheet model for this problem.
=c. Use the distribution network from part b to formulate a network model for Texago’s problem as a variant of a maximum flow problem.
=b. Redraw this distribution network by lining up all the nodes representing oil fields in one column, all the nodes representing refineries in a second column, and all the nodes representing
=a. Draw a rough map that shows the location of Texago’s oil fields, refineries, and distribution centers. Add arrows to show the flow of crude oil and then petroleum products through this
=6.11. The Texago Corporation has four oil fields, four refineries, and four distribution centers in the locations identified in the next tables. A major strike involving the transportation
=a. Formulate this problem as a maximum flow problem by identifying a source, a sink, and the transshipment nodes, and then drawing the complete network that shows the capacity of each arc.
=6.10. The diagram depicts a system of aqueducts that originate at three rivers (nodes R1, R2, and R3) and terminate at a major city (node T), where the other nodes are junction points in the
=6.7. Consider the maximum flow problem formulated in Figures 6.7 and 6.8 for the BMZ case study. Redraw Figure 6.7 and insert the optimal shipping quantities (cells D4:D12 in Figure 6.8) in
=f. Add the total shipping costs obtained in parts b and e.Compare this sum with the total shipping cost obtained in part c of Problem 6.5 (as given in the back of the book).
=E*e. Formulate and solve a spreadsheet model for the problem formulated in part d.
=d. Repeat part a for the distribution center in Seattle by using the network drawn in part c.
=c. For the distribution center in Seattle, draw its distribution network emanating from the Berlin factory at node BE.
=E*b. Formulate and solve a spreadsheet model for the problem formulated in part a.
=a. For the distribution center in Los Angeles, formulate a network model for this problem as a minimumcost flow problem by inserting all the necessary data into the distribution network shown in
=a. What plays the role of distances in interpreting this problem to be a shortest path problem?
=6.6. Reconsider Problem 6.5. Suppose now that, for administrative convenience, management has decided that all 130 units per month needed at the distribution center in Los Angeles must come from
=c. What is the total shipping cost for this optimal solution?
=a. Formulate a network model for this problem as a minimum-cost flow problem by inserting all the necessary data into the distribution network shown in Figure 6.9. (Use the format depicted in Figure
=6.5.* Consider Figure 6.9 (in Section 6.3), which depicts the BMZ Co. distribution network from its factories in Stuttgart and Berlin to the distribution centers in both Los Angeles and Seattle.This
=E*c. Formulate and solve a spreadsheet model for the company’s problem.
=b. This problem is only a variant of a minimum-cost flow problem because the supply from each vendor is a maximum of 10 rather than a fixed amount of 10. However, it can be converted to a
=a. Draw a network that depicts the company’s supply network. Identify the supply nodes, transshipment nodes, and demand nodes in this network.
=6.4. The Audiofile Company produces boomboxes. However, management has decided to subcontract out the production of the speakers needed for the boomboxes. Three vendors are available to supply the
=E*c. Formulate and solve a spreadsheet model for this problem.
=b. Formulate a network model for this problem as a minimum-cost flow problem by inserting all the necessary data into the network drawn in part a.(Use the format depicted in Figure 6.3 to display
=a. Draw a network that depicts the company’s distribution network. Identify the supply nodes, transshipment nodes, and demand nodes in this network.
=6.3. The Makonsel Company is a fully integrated company that both produces goods and sells them at its retail outlets. After production, the goods are stored in the company’s two warehouses until
=E*b. Formulate and solve a spreadsheet model for this problem.
=6.2.* Consider the transportation problem having the following dataa. Formulate a network model for this problem as a minimum-cost flow problem by drawing a network similar to Figure 6.3.
=6.1. Read the referenced article that fully describes the management science study summarized in the application vignette presented in Section 6.1. Briefly describe how the model for the
=b. WBC would like to expand the capacity of the network so it can handle the peak requirement of 35 GB/s from the Olympics site (A) to the home studios (G). WBC can increase the capacity of each
=a. By utilizing the entire computer network, what is the maximum bandwidth available (in GB/s) for transmission from the general site of the Olympic Games (node A) to the home studios (node G)? Set
=c to find the feasible combination of flights that maximizes the total profit. Does this change the number of airplanes that fly overnight to another city?
=d. Richard now is considering having each of the four airplanes carry freight instead of flying empty if it flies overnight to another city to be ready to start a flight from there the next morning.
=c. Now repeat part a under the more realistic assumption that there is a minimum turnaround time of 30 minutes on the ground for unloading and loading passengers between the arrival of a flight and
=b. Richard is considering leasing additional airplanes to achieve economies of scale. The leasing cost of each one again would be $30,000 per day. Perform what-if analysis to determine whether it
=a. To simplify the analysis, assume for now that there is virtually no turnaround time between flights so the next flight can begin as soon as the current flight ends. (If an immediate next flight
=e. Jake realizes that his analysis is incomplete because he has not included all aspects that might influence his planned currency exchanges. Describe other factors that Jake should examine before
=d. In response to the World Trade Organization’s mandate forbidding transaction limits, the Indonesian government introduces a new tax to protect its currency that leads to a 500 percent
=c. The World Trade Organization forbids transaction limits because they promote protectionism. If no transaction limits exist, what method should Jake use to convert the Asian holdings from the
=b. Which currency transactions must Jake perform to convert the investments from yens, rupiahs, and ringgits into U.S.dollars to ensure that Grant Hill Associates has the maximum dollar amount after
=a. Formulate Jake’s problem as a minimum-cost flow problem, and draw the network for his problem. Identify the supply and demand nodes for the network.
=d. Once the president releases the number of planes, ships, and trucks that will travel between the United States and the Maximum Number From To of Airplanes Boston Berlin 300 Boston Istanbul 500
=Each Russian city has contacted Washington to communicate the number of troops and supplies the city needs at a minimum for reinforcement. After analyzing the requests, General Lankletter has
=The president knows that Congress will not authorize significant spending for another country’s war, especially when voters have paid so much attention to decreasing the national debt. He
=c. The president encounters only one problem with his first plan: He has to sell the military deployment to Congress.Under the War Powers Act, the president is required to consult with Congress
=The president has been given the information in the next table about the length of the available routes between cities.Given the distance and the speed of the transportation used between each pair
=b. Moscow and Washington do not know when Commander Votachev will launch his next attack. Leaders from the two countries therefore have agreed that troops should reach each of the three strategic
=a. Draw a network showing the different routes troops and supplies may take to reach the Russian Federation from the United States.
=5. What is the objective for Sarah’s shortest path problem?
=2. What is the distinction between an arc and a link?
=3. What are the two equivalent ways in which the total amount of flow from the source to the sink can be measured?
=2. What are the source and the sink for a maximum flow problem? For each, in what direction do all their arcs point?
=1. How does the objective of a maximum flow problem differ from that for a minimum-cost flow problem?
=3. What is the objective of the resulting maximum flow problem?
=2. When formulating this problem in network terms, what is flowing through BMZ’s distribution network? From where to where?
=1. What is the current crisis facing the BMZ Co.?
=8. Name five important categories of network optimization problems that turn out to be special types of minimum-cost flow problems.
=7. What are a few typical kinds of applications of minimum-cost flow problems?
=6. What is the name of the streamlined version of the simplex method that is designed to solve minimum-cost flow problems very efficiently?
=5. What is the integer solutions property for minimum-cost flow problems?
=4. What property is necessary for a minimum-cost flow problem to have feasible solutions?
=3. What is the usual objective for a minimum-cost flow problem?
=2. What is meant by the capacity of an arc?
=1. Name and describe the three kinds of nodes in a minimum-cost flow problem.
=5. Formulate and solve a spreadsheet model for a minimum-cost flow problem, a maximum flow problem, or a shortest path problem from a description of the problem
=4. Identify several categories of network optimization problems that are special types of minimum-cost flow problems.
=3. Identify some areas of application for these types of problems.
=2. Describe the characteristics of minimum-cost flow problems, maximum flow problems, and shortest path problems.
=1. Formulate network models for various types of network optimization problems.
In Problem 44 in Chapter 6, KanTech Corporation ships electronic components in containers from seaports in Europe to U.S. ports, from which the containers are transported by truck or rail to inland
Suppose in Problem 37 that the processing cost per unit at each plant is different because of different machinery, workers’ abilities, overhead, and so on, according to the following table:Stage 1
The National Express Parcel Service has established various truck and air routes around the country over which it ships parcels. The holiday season is approaching, which means a dramatic increase in
A new stadium complex is being planned for Denver, and the Denver traffic engineer is attempting to determine whether the city streets between the stadium complex and the interstate highway can
Given the following network, with the indicated flow capacities of each branch, determine the maximum flow from source node 1 to destination node 6 and the flow along each branch:1 4 6 52 38 10 52 3
Determine the minimal spanning tree for the network in Problem 1.
Solve Problem 33 from Chapter 5 to determine the shortest route for the “Weekend Rider” bus service from Tech to DC that will also result in at least 30 passengers.
A new police car costs the Bay City Police Department $26,000. The annual maintenance cost for a car depends on the age of the car at the beginning of the year. (All cars accumulate approximately the
From 1840 to 1850, more than 12,000 pioneers migrated west in wagon trains. It was typically about a 2,000-mile journey, and pioneers averaged about 10 miles per day. One pioneer family, the Smiths,
In 1862, during the second year of the Civil War, General Thomas J. “Stonewall” Jackson fought a brilliant military campaign in the Shenandoah Valley in Virginia. One of his victories was at the
George is camped deep in the jungle, and he wants to make his way back to the coast and civilization.Each of the paths he can take through the jungle has obstacles that can delay him, including

Showing 1200 - 1300 of 2377

First
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
Last

Services

Sitemap
Fun
Definitions
Become Tutor
Study Help Categories
Recent Questions
Expert Questions

Company Info

Security
Copyrights
Privacy Policy
Terms & Conditions
SolutionInn Fee
Scholarship

Get In Touch

About Us
Contact Us
Career
Jobs
FAQ
Campus Ambassador

Secure Payment

Download Our App

© 2024 SolutionInn. All Rights Reserved