Consider the cities H, I, J, K, L, M. The costs of the possible roads between cities are given below:c(H, K) = 13c(H, L) = 14c(I, J) = 18c(I, K) = 17c(I, M) = 16c(J, K) = 15c(K, L) = 12c(K, M) = 10c(L, M) = 11What is the minimum cost to build a road system that connects all the cities?

Answered: Image /qna-images/answer/396ffbe9-75cd-47a9-9f22-8e9725ee7764.jpg

Answered: Consider the cities H, I, J, K, L, M.…

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

Suppose the order of profitability of cookies is as follows Ranking in terms of profitability Sugar Double Chocolate Chip Oatmeal Raisin White Chip Mac Nut Peanut Butter 3 4 1 5 2 Width of Cookie in Inches 4 6 4 4 4 How many total inches of horizontal display space would be used to sell Oatmeal Ralsin Cookies if the cookie display case is 24 inches across? Assume the Subw must offer at least three different kinds of cookies.
2. Minimize z - 6х, + 6х, + 8x, + 9х, subject to X, + 2xz + x3+ X4 2 3 2x, + xz + 4x3 + 9x42 8 X, 2 0, x2 2 0, x3 2 0, x,2 0.
3. 8000 tickets are sold when the price is $25 per ticket. When the price is $30, 7500 tickets are sold. Everyone at the event spends $5 on concessions. a) showing your work. Find the linear price equation for tickets and set up a table of (x,y) values b) Find the best price to maximize the total revenue.
Answer D and E only The answers to A,B, and C are given. A) Rx=4x B) The Profit Function,Px=Revenue Function,Rx-Cost Function,Cx Px=4x-300+0.1x+0.003x2Px=4x-300-0.1x-0.003x2Px=-0.003x2+3.9x-300 C)P'x=-0.006x+3.9
Q2. Pharmaceutical company producing a single product sold it through five agencies situated in different cities. All of sudden there rouse a demand for the product in another five cities that didn't agency of the company. The company is now facing the problem of deciding on how to assign the existing agencies in order to dispatch the product to needy cities in such a way that the travelling distance is minimized. The distance between the surplus and deficit cities in kilometer is given the following table. Surplus city Deficit cities Deficit cites a b d. e A1 160 130 115 190 200 B1 135 120 130 160 175 C1 140 110 125 170 185 D1 50 50 80 80 110 E1 55 35 80 80 105 Determine the optimum assignment schedule.

Recommended textbooks for you

Advanced Engineering Mathematics

Advanced Math

ISBN:

9780470458365

Author:

Erwin Kreyszig

Publisher:

Wiley, John & Sons, Incorporated

Numerical Methods for Engineers

Advanced Math

ISBN:

9780073397924

Author:

Steven C. Chapra Dr., Raymond P. Canale

Publisher:

McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…

Advanced Math

ISBN:

9781118141809

Author:

Nathan Klingbeil

Publisher:

WILEY

Advanced Engineering Mathematics

Advanced Math

ISBN:

9780470458365

Author:

Erwin Kreyszig

Publisher:

Wiley, John & Sons, Incorporated

Numerical Methods for Engineers

Advanced Math

ISBN:

9780073397924

Author:

Steven C. Chapra Dr., Raymond P. Canale

Publisher:

McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…

Advanced Math

ISBN:

9781118141809

Author:

Nathan Klingbeil

Publisher:

WILEY

Mathematics For Machine Technology

Advanced Math

ISBN:

9781337798310

Author:

Peterson, John.

Publisher:

Cengage Learning,

Basic Technical Mathematics

Advanced Math

ISBN:

9780134437705

Author:

Washington

Publisher:

PEARSON

Topology

Advanced Math

ISBN:

9780134689517

Author:

Munkres, James R.

Publisher:

Pearson,

SEE MORE TEXTBOOKS

Consider the cities H, I, J, K, L, M. The costs of the possible roads between cities are given below c(H, K) = 13 c(H, L) = 14 c(I, J) = 18 c(I, K) = 17 c(I, M) = 16 c(J, K) = 15 c(K, L) = 12 c(K, M) = 10 c(L, M) = 11 What is the minimum cost to build a road system that connects all the cities?