If its unclear, you can also check the book, operations Research: An introduction , 8th edition by
Fantastic news! We've Found the answer you've been seeking!
Question:
If it’s unclear, you can also check the book, operations Research: An introduction , 8th edition by Hamdy. A . Taha. From page 240- 242
Transcribed Image Text:
Example 6.2-1 1 Midwest TV Cable Company is in the process of providing cable service to five new housing development areas. Figure 6.6 depicts possible TV linkages among the five areas. The cable miles are shown on each arc. Determine the most economical cable network. The algorithm starts at node 1 (any other node will do as well), which gives C₁ = {1}, C₁ = {2, 3, 4, 5, 6} The iterations of the algorithm are summarized in Figure 6.7. The thin arcs provide all the candi- date links between C and C. The thick branches represent the permanent links between the nodes of the connected set C, and the dashed branch represents the new (permanent) link added at each iteration. For example, in iteration 1, branch (1, 2) is the shortest link (= 1 mile) among all the candidate branches from node 1 to nodes 2, 3, 4, 5, and 6 of the unconnected set C₁. Hence, link (1,2) is made permanent and j = 2, which yields C₂=(1,2), (3,4,5,6) The solution is given by the minimal spanning tree shown in iteration 6 of Figure 6.7. The resulting minimum cable miles needed to provide the desired cable service are 1+3+ 4+3+5= 16 miles. TORA Moment You can use TORA to generate the iterations of the minimal spanning tree. From Main menu, select Network models Minimal spanning tree. Next, from SOLVE/ MODIFY menu, select Solve problem Go to output screen. In the output screen, select a Starting node then use Next iteration or All iterations to generate the succes- sive iterations. You can restart the iterations by selecting a new Starting Node. File toraEx6.2-1.txt gives TORA's data for Example 6.2-1. 242 Chapter 6 Network Models SE 1100 LA 1300 2000 FIGURE 6.8 Network for Problem 3, Set 6.2a (DE) 2600 1400 2000 1000 780 900 2 9 (CH) Iteration 1 1300 3 Iteration 3 Iteration 5 E 6.7 on iterations for Midwest TV Company 800 2 10 ww 200 DO 5 (NY) 5 C₁ 6.2 Minimal Spanning Tree Algorithm 241 S 3 Iteration 2 Iteration 4 LEM SET 6.2A Solve Example 6.2-1 starting at node 5 (instead of node 1), and show that the algorithm produces the same solution. 3 Determine the minimal spanning tree of the network of Example 6.2-1 under each of the following separate conditions: (a) Nodes 5 and 6 are linked by a 2-mile cable. (b) Nodes 2 and 5 cannot be linked. (c) Nodes 2 and 6 are linked by a 4-mile cable. 3 Iteration 6 (Minimal spanning tree) Alternate links 5 C₁ (d) The cable between nodes 1 and 2 is 8 miles long. (e) Nodes 3 and 5 are linked by a 2-mile cable. (f) Node 2 cannot be linked directly to nodes 3 and 5. 3. In intermodal transportation, loaded truck trailers are shipped between railroad terminals on special flatbed carts. Figure 6.8 shows the location of the main railroad terminals in the United States and the existing railroad tracks. The objective is to decide which tracks should be "revitalized" to handle the intermodal traffic. In particular, the Los Angeles (LA) terminal must be linked directly to Chicago (CH) to accommodate expected heavy traffic. Other than that, all the remaining terminals can be linked, directly or indirectly, such that the total length (in miles) of the selected tracks is minimized. Determine the seg- ments of the railroad tracks that must be included in the revitalization program. 4. Figure 6.9 gives the mileage of the feasible links connecting nine offshore natural gas wellheads with an inshore delivery point. Because wellhead 1 is the closest to shore, it is equipped with sufficient pumping and storage capacity to pump the output of the remain- ing eight wells to the delivery point. Determine the minimum pipeline network that links the wellheads to the delivery point. Example 6.2-1 1 Midwest TV Cable Company is in the process of providing cable service to five new housing development areas. Figure 6.6 depicts possible TV linkages among the five areas. The cable miles are shown on each arc. Determine the most economical cable network. The algorithm starts at node 1 (any other node will do as well), which gives C₁ = {1}, C₁ = {2, 3, 4, 5, 6} The iterations of the algorithm are summarized in Figure 6.7. The thin arcs provide all the candi- date links between C and C. The thick branches represent the permanent links between the nodes of the connected set C, and the dashed branch represents the new (permanent) link added at each iteration. For example, in iteration 1, branch (1, 2) is the shortest link (= 1 mile) among all the candidate branches from node 1 to nodes 2, 3, 4, 5, and 6 of the unconnected set C₁. Hence, link (1,2) is made permanent and j = 2, which yields C₂=(1,2), (3,4,5,6) The solution is given by the minimal spanning tree shown in iteration 6 of Figure 6.7. The resulting minimum cable miles needed to provide the desired cable service are 1+3+ 4+3+5= 16 miles. TORA Moment You can use TORA to generate the iterations of the minimal spanning tree. From Main menu, select Network models Minimal spanning tree. Next, from SOLVE/ MODIFY menu, select Solve problem Go to output screen. In the output screen, select a Starting node then use Next iteration or All iterations to generate the succes- sive iterations. You can restart the iterations by selecting a new Starting Node. File toraEx6.2-1.txt gives TORA's data for Example 6.2-1. 242 Chapter 6 Network Models SE 1100 LA 1300 2000 FIGURE 6.8 Network for Problem 3, Set 6.2a (DE) 2600 1400 2000 1000 780 900 2 9 (CH) Iteration 1 1300 3 Iteration 3 Iteration 5 E 6.7 on iterations for Midwest TV Company 800 2 10 ww 200 DO 5 (NY) 5 C₁ 6.2 Minimal Spanning Tree Algorithm 241 S 3 Iteration 2 Iteration 4 LEM SET 6.2A Solve Example 6.2-1 starting at node 5 (instead of node 1), and show that the algorithm produces the same solution. 3 Determine the minimal spanning tree of the network of Example 6.2-1 under each of the following separate conditions: (a) Nodes 5 and 6 are linked by a 2-mile cable. (b) Nodes 2 and 5 cannot be linked. (c) Nodes 2 and 6 are linked by a 4-mile cable. 3 Iteration 6 (Minimal spanning tree) Alternate links 5 C₁ (d) The cable between nodes 1 and 2 is 8 miles long. (e) Nodes 3 and 5 are linked by a 2-mile cable. (f) Node 2 cannot be linked directly to nodes 3 and 5. 3. In intermodal transportation, loaded truck trailers are shipped between railroad terminals on special flatbed carts. Figure 6.8 shows the location of the main railroad terminals in the United States and the existing railroad tracks. The objective is to decide which tracks should be "revitalized" to handle the intermodal traffic. In particular, the Los Angeles (LA) terminal must be linked directly to Chicago (CH) to accommodate expected heavy traffic. Other than that, all the remaining terminals can be linked, directly or indirectly, such that the total length (in miles) of the selected tracks is minimized. Determine the seg- ments of the railroad tracks that must be included in the revitalization program. 4. Figure 6.9 gives the mileage of the feasible links connecting nine offshore natural gas wellheads with an inshore delivery point. Because wellhead 1 is the closest to shore, it is equipped with sufficient pumping and storage capacity to pump the output of the remain- ing eight wells to the delivery point. Determine the minimum pipeline network that links the wellheads to the delivery point.
Expert Answer:
Related Book For
Differential Equations and Linear Algebra
ISBN: 978-0131860612
2nd edition
Authors: Jerry Farlow, James E. Hall, Jean Marie McDill, Beverly H. West
Posted Date:
Students also viewed these mathematics questions
-
For each of problem answer the following question a. Does picard's theorem apply to the given IVP Explain b. If your answer to part (a) is yes, is there a largest rectangle for which picard's...
-
Write a regular expression for a string literal defined as follows: - Starts and ends with a double quote symbol. - Can contain any number of characters that are not a " or a \. - Can also contain...
-
Net Income before Income Tax (do not consider comprehensive income) Total of Depreciation Expense (including Amortization) Property, Plant, and Equipment (net book value) Earnings per Share Current...
-
Migration is a popular strategy among many species. Monarch butterflies migrate between the Sierra Madre mountains in Mexico and many locations across the USA and Canada. Answer the following...
-
For the data in Exercise 13, determine the first principal component?
-
Problem Statement: The aim of this case study is to propose a daily capacity level and level of resourcing required for Q2 & Q3 2023. The proposed daily capacity level should achieve the highest...
-
The following data are for Huang Wong Ping Retail Outlet Stores. The account balances (in thousands) are for 2017. 1. Compute (a) the cost of goods purchased and (b) the cost of goods sold. 2....
-
The general ledger of Red Storm Cleaners at January 1, 2015, includes the following account balances: The following is a summary of the transactions for the year: a. Sales of services, $60,000, of...
-
Making Decisions with Confidence Intervals Assume you work for Kimberly Clark Corporation, the makers of Kleenex. The job you are presently working on requires you to decide how many Kleenexes are to...
-
Hemming Company reported the following current-year purchases and sales for its only product. Date Activities January 11 Beginning inventory. January 10 Sales March 14 March 151 July 30 October 5...
-
CHAPTER 4: CONSOLIDATION - INTERCOMPANY PROFIT PROBLEM 4-5 On January 1, 2022, Pet Company purchased 80% of the shares of Sam Company for P1,000,000. The shareholders' equity of Sam Company on that...
-
How are customer service and employee empowerment intertwined? Consider what customer service is as well as employee empowerment. Give an example of a company that does both well.
-
Assume we are in the year 2010. In 2008, John started working for Tictac Inc.This year the company decided to offer all its employees a defined benefit plan.The DB plan offers a pension of 1.4% of...
-
Are there situations in which employee empowerment would hurt rather than improve quality and why would this occur? Data: https://asq.org/quality-resources/employee-empowerment
-
Assume Highline Company has just paid an annual dividend of $1.07. Analysts are predicting an 10.8% per year growth rate in earnings over the next five years. After then, Highline's earnings are...
-
6. Rewrite the following BNF grammar using the form of EBNF. Make the resulting grammar as short as possible (fewest rules). Note: It is possible to replace all eight BNF rules with a single EBNF...
-
Prepare journal entries to record each of the following sales transactions of a merchandising company. The company uses a perpetual inventory system and the gross method. Apr. Apr. Apr. 1 Sold...
-
The registrar of a college with a population of N = 4,000 full-time students is asked by the president to conduct a survey to measure satisfaction with the quality of life on campus. The following...
-
Higher Order Des: Find the solutions for the following higher order equations. Remember that for each repetition of a root, a term with an additional factor of t must be included. If a factorization...
-
The linear transformation T: R3 R2 is defined by Where a. Determine the vectors in R3 that maps to the zero vector in R2. b. Find the vectors in R3 that T maps to [I, I] in R2. c. Describe the image...
-
An Overdamped Spring The solution of the differential equation for an overdamped vibration has the form x(t) = c1et1 + c2er1t , with both c1 and c2 nonzero? (a) Show that x(t) is zero at most once....
-
A change in chromosome structure that does not involve a change in the total amount of genetic material is a. a deletion. b. a duplication. c. an inversion. d. none of the above.
-
The term endopolyploidy refers to the phenomenon of having a. too many chromosomes. b. extra chromosomes inside the cell nucleus. c. extra sets of chromosomes in certain cells of the body. d. extra...
-
During transduction involving a P1 phage, a. any small fragment of the bacterial chromosome may be transferred to another bacterium by a new phage. b. only a specific fragment of DNA may be...
Study smarter with the SolutionInn App