4. Minimal-Spanning Tree TechniqueThe following table shows the distance between nodes in a network. Draw the network.Then use the minimal-spanning tree technique to find the minimum distance required toconnect these nodes togetherFrom Node: | To Node: Distance12134332412625376456575746866.94.889

Minimum spanning tree: Graph/route containing all the vertices (nodes) with minimum number of edges…

Answered: 4. Minimal-Spanning Tree Technique The…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

(5) Consider the following linear programming model with 4 regular constraints:Maximize 3X + 5Y (a) Draw your graph in the space below:subject to: 4X + 4Y ≤ 48 (constraint #1) 4X + 3Y ≤ 50 (constraint #2) 2X + 1Y ≤ 20 (constraint #3) X ≥ 2 (constraint #4) X, Y ≥ 0 (non-negativity constraints)(a) Which of the constraints is redundant? Constraint #______.Justify by drawing a graph similar to Figure 7.14 on p.263.(b) Is point (9,3) a feasible solution? _____. Explain your answer (by analyzing each of the constraints).Constraint #1: _______________________________________________________________Constraint #2: _______________________________________________________________Constraint #3: _______________________________________________________________Constraint #4: _______________________________________________________________(c) Which of the following points yields the best solution? Underline the best solution: (7,5), (9,2), (6,6).Justify your answer (using the data from the above LP…
A coordinate system is superimposed on a map. Three existing facilities arelocated at (5, 15), (10, 20), and (6, 9). Compute both the rectilinear and theEuclidean distances separating each facility from a new facility located at (x, y) =(8, 8).
Solve the linear programming problem by the method of corners. Minimize C = 6x + 7y subject to 4x + y ≥ 42 2x + y ≥ 30 x + 3y ≥ 30 x ≥ 0, y ≥ 0 The minimum is C = at (x, y) =
The area of a triangle with sides of length a, b, and c iss(s a)(s b)(s c), where s is half the perimeter ofthe triangle. We have 60 ft of fence and want to fence atriangular-shaped area. Formulate an NLP that will enableus to maximize the fenced area.
The figure below shows the possible routes from city A to city J as well as the time (in minutes) required for a trip between each pair of cities (note that if no arc joins two cities it is not possible to travel non-stop between those two cities). A traveler wishes to find the quickest option to travel from city A to city J. What is the shortest time possible to travel from node F to node J. Multiple Choice: 200 140 110 180 160
The distance between two cities in the United States can be approximated by the following formula, where lat1 and long1 are the latitude and longitude of city 1 and lat2 and long2 are the latitude and longitude of city 2. 69 (lat1 − lat2)2 + (long1 − long2)2 Ted's daughter is getting married, and he is inviting relatives from 15 different locations in the United States. The file Wedding gives the longitude, latitude, and number of relatives in each of the 15 locations. Ted would like to find a wedding location that minimizes the demand-weighted distance, where demand is the number of relatives at each location. Assuming that the wedding can occur anywhere, find the latitude and longitude of the optimal location. (Hint: Notice that all longitude values given for this problem are negative. Make sure that you do not check the option for Make Unconstrained Variables Non-Negative in Solver. Round your answers to three decimal places.) latitude of the optimal wedding location:…
Modify the warehouse location model as suggested inModeling Issue 2. Specifically, assume that the samefour customers have the same annual shipments, butnow, there are only two possible warehouse locations,each with distances to the various customers. (Thesedistances, along with other inputs, are in the fileP07_27.xlsx.) The company can build either or bothof these warehouses. The cost to build a warehouseis $50,000. (You can assume that this cost has beenannualized. That is, the company incurs a buildingcost that is equivalent to $50,000 per year.) If onlyone warehouse is built, it will ship to all customers. However, if both warehouses are built, then the com-pany must decide which warehouse will ship to each customer. There is a traveling cost of $1 per mile.a. Develop an appropriate model to minimize totalannual cost, and then use Solver to optimize it.Is this model an NLP or an IP model (or both)?b. Use SolverTable with a single input, the traveling costper mile, to see how large…
Given the following AVL Tree: Delete the node 17 and make the tree balanced. Construct a (2,4) Tree with the values 15, 10, 5, 7, 11, 51, 89, 17, 25
A health Centre will be built to serve 7 communities. The geographical location of the communities and their population is shown in the table below. Communities A, X =2.5 (km), Y=4.5(km), Population( 000's)=2 Communities B, X =2.5 (km), Y=2.5(km), Population( 000's)=5 Communities C, X =5.5 (km), Y=4.5(km), Population( 000's)=10 Communities D, X =5 (km), Y=2(km), Population( 000's)=7 Communities E, X =8 (km), Y=5(km), Population( 000's)=10 Communities F, X =7 (km), Y=2(km), Population( 000's)=20 Communities G, X =9 (km), Y=2.5(km), Population( 000's)=14 There is a possibility of building the Centre in two communities, community C and F. Based on the Demand-Distance criterion what is your recommendation for the site of the Centre. The distances to be measured based on Rectilinear method. Based on…
Instructions: Solve using Excel Solver. Create the linear programming model and get the optimal solution to the problem. (Follow the steps and format in the photo below) 1. A company manufactures two products X1 and X2 on three machines A, B, and C. X1 requires 1 hour on machine A and 1hour on machine B and yields a revenue of Php 30. Product X2 requires 2 hours on machine A and 1 hour on machine B and 1 hour on machine C and yields revenue of PhP 50. In the coming planning period the available time of three machines A, B, and C are 2000 hours, 1500 hours and 600 hours respectively. Find the optimal product mix.
Consider the following linear programming model: maximize Z = 3x1 + 2x2 subject to : x1 +x2 ≤ 1 x1 + x2 ≥ 2 x1,x2 ≥ 0 a) Write this model in a standard (augmented) form. (i.e. Introduce slack/surplus, artificial etc.)b) Constract the initial simplex tableau and carry on your calculations to solve this model using the simplex method. Interpret your result.
Consider the followingg linear programming problem: Max 3A + 3Bst. 2A + 4B ≤ 12 6A + 4B ≤ 24 A, B ≥ 0 The point (4.0,0.0) is: a. unbounded. b. is one of the extreme points. c. the optimal solution. d. infeasible.

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Business in Action

Operations Management

ISBN:

9780135198100

Author:

BOVEE

Publisher:

PEARSON CO

Purchasing and Supply Chain Management

Operations Management

ISBN:

9781285869681

Author:

Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson

Publisher:

Cengage Learning

Production and Operations Analysis, Seventh Editi…

Operations Management

ISBN:

9781478623069

Author:

Steven Nahmias, Tava Lennon Olsen

Publisher:

Waveland Press, Inc.

SEE MORE TEXTBOOKS