In rural west Texas, there are six farms (numbered 1 – 6) connected by small roads. The distances in miles between the farms are given in the following table. From Farm To Farm Distance 1 2 8 1 3 10 2 3 4 2 4 9 2 5 5 3 4 6 3 5 2 4 5 3 4 6 6 5 6 5 REQUIREMENTS: What is the minimum distance required to get from farm 1 to farm 6? A seventh farmer wants to join the group of six in Problem above. The distance of this farm is 8 miles from farm 4, 9 miles from farm 5, and 5 miles from farm 6. What is the minimum amount of cable required to connect all 7 farms?

In rural west Texas, there are six farms (numbered 1 – 6) connected by small roads. The distances in miles between the farms are given in the following table. From Farm To Farm Distance 1 2 8 1 3 10 2 3 4 2 4 9 2 5 5 3 4 6 3 5 2 4 5 3 4 6 6 5 6 5 REQUIREMENTS: What is the minimum distance required to get from farm 1 to farm 6? A seventh farmer wants to join the group of six in Problem above. The distance of this farm is 8 miles from farm 4, 9 miles from farm 5, and 5 miles from farm 6. What is the minimum amount of cable required to connect all 7 farms?

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section: Chapter Questions

Problem 45P

See similar textbooks

Similar questions

Mad Max wants to travel from New York to Dallas bythe shortest possible route. He may travel over the routesshown in Table 8. Unfortunately, the Wicked Witch canblock one road leading out of Atlanta and one road leadingout of Nashville. Mad Max will not know which roads havebeen blocked until he arrives at Atlanta or Nashville. ShouldMad Max start toward Atlanta or Nashville? Which routesshould the Wicked Witch block? Route (Miles)New York–Atlanta 800New York–Nashville 900Nashville–St. Louis 400Nashville–New Orleans 200Atlanta–St. Louis 300Atlanta–New Orleans 600St. Louis–Dallas 500New Orleans–Dallas 300
Monroe County is trying to determine where to place the county fire station. The locations of the county’s four major towns are given in Figure 31. Town 1 is at (10, 20); town 2 is at (60, 20); town 3 is at (40, 30); town 4 is at (80, 60). Town 1 averages 20 fires per year; town 2, 30 fires; town 3, 40 fires; and town 4, 25 fires. The county wants to build the fire station in a location that minimizes the average distance that a fire engine must travel to respond to a fire. Since most roads run in either an east–west or a north–south direction, we assume that the fire engine can only do the same. Thus, if the fire station were located at (30, 40) and a fire occurred at town 4, the fire engine would have to travel (80 30) (60 40) 70 miles to the fire. Use linear programming to determine where the fire station should be located. (Hint: If the fire station is to be located at the point (x, y) and there is a town at the point (a, b), define variables e, w, n, s (east, west, north,…
A plumbing repair company has 3 employees and must choose which of 3 jobs to assign each to (each employee is assigned to exactly one job and each job must have someone assigned). Each employee can perform each job, but the cost to perform any given job can vary. The following table shows the cost for each employee to perform each job. Employee A Employee B Employee C Job 1 36 45 53 Job 2 36 47 37 Job 3 42 40 36 Solve this assignment problem in Excel to find the lowest cost solution and answer the following questions: Which employee is assigned to job 1? Which employee is assigned to job 2? Which employee is assigned to job 3? What is the minimum cost to complete all three jobs?
Consider the following all-integer linear program: Max 5x1 + 8x2 s.t. 6x1 + 5x2 ≤ 28 11x1 + 5x2 ≤ 46 x1 + 2x2 ≤ 8 x1, x2 ≥ 0 and integer Find the optimal solution to the LP Relaxation. If required, round your answers to two decimal places. x1= fill in the blank 2 x2= fill in the blank 3 Optimal Solution to the LP Relaxation fill in the blank 4 Round down to find a feasible integer solution. If your answer is zero enter “0”. x1= fill in the blank 5 x2= fill in the blank 6 Feasible integer solution fill in the blank 7 Find the optimal integer solution. If your answer is zero enter “0”. x1= fill in the blank 8 x2= fill in the blank 9 Optimal Integer Solution fill in the blank 10
Consider the following all-integer linear program: Max 5x1 + 8x2 s.t. 6x1 + 5x2 ≤ 28 11x1 + 5x2 ≤ 46 x1 + 2x2 ≤ 8 x1, x2 ≥ 0 and integer Find the optimal solution to the LP Relaxation. If required, round your answers to two decimal places. x1= fill in the blank 2 x2= fill in the blank 3 Optimal Solution to the LP Relaxation fill in the blank 4 Round down to find a feasible integer solution. If your answer is zero enter “0”. x1= fill in the blank 5 x2= fill in the blank 6 Feasible integer solution fill in the blank 7 Find the optimal integer solution. If your answer is zero enter “0”. x1= fill in the blank 8 x2= fill in the blank 9 Optimal Integer Solution fill in the blank 10 Is it the same as the solution obtained in part (b) by rounding down?