Pro-Carpet company manufactures carpets in Northwest Indiana and delivers them to warehouses and retail outlets. The network diagram is given in the figure below shows the possible routes and distances from the carpet plant in Valparaiso to the various warehouses or retail outlets. 12 13 15 10 На V= Valparaiso, P=Portage. G=Gary, HaHammond, Hi-Highland, M = Merilville, L= Lansing Assuming the edges are (V_P. V_M, P_M. P_Ha. M_Ha. P_G. Ha_G, G_HI. Ha_HI, H_L Ha_L) The objective function for the shortest route from the carpet plant in Valparaiso to the retail outlet in Lansing is:

Fundamentals Of Construction Estimating
4th Edition
ISBN:9781337399395
Author:Pratt, David J.
Publisher:Pratt, David J.
Chapter3: Measuring Quantities Generally
Section: Chapter Questions
Problem 6RQ: In what order are dimensions entered onto the takeoff?
icon
Related questions
Question
Pro-Carpet company manufactures carpets in Northwest Indiana and delivers them to warehouses and retail outlets. The network diagram is given in the figure below
shows the possible routes and distances from the carpet plant in Valparaiso to the various warehouses or retail outlets.
12
13
6
15
20
10
M
На
V= Valparaiso, P=Portage, G=Gary, Ha=Hammond, Hi=Highland, M = Merillville, L= Lansing
Assuming the edges are (V_P. V_M, P_M, P_Ha, M_Ha, P_G. Ha_G, G_HI, Ha_Hi, Hi_L, Ha_L}
The objective function for the shortest route from the carpet plant in Valparaiso to the retail outlet in Lansing is:
o a Lije Edges dis * I4j
Where d is the distance between node i and j, and rij is integer variable
o b. EijcEdges
Where dij is the distance between node i and j, and rij is binary variable
dij Tij
Oc.
none of the mentioned
od EijcEdges Tij
Where rij is integer variable
oe Eijc Edges 13
Where ry is binary variable
Transcribed Image Text:Pro-Carpet company manufactures carpets in Northwest Indiana and delivers them to warehouses and retail outlets. The network diagram is given in the figure below shows the possible routes and distances from the carpet plant in Valparaiso to the various warehouses or retail outlets. 12 13 6 15 20 10 M На V= Valparaiso, P=Portage, G=Gary, Ha=Hammond, Hi=Highland, M = Merillville, L= Lansing Assuming the edges are (V_P. V_M, P_M, P_Ha, M_Ha, P_G. Ha_G, G_HI, Ha_Hi, Hi_L, Ha_L} The objective function for the shortest route from the carpet plant in Valparaiso to the retail outlet in Lansing is: o a Lije Edges dis * I4j Where d is the distance between node i and j, and rij is integer variable o b. EijcEdges Where dij is the distance between node i and j, and rij is binary variable dij Tij Oc. none of the mentioned od EijcEdges Tij Where rij is integer variable oe Eijc Edges 13 Where ry is binary variable
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Building codes
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, civil-engineering and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Fundamentals Of Construction Estimating
Fundamentals Of Construction Estimating
Civil Engineering
ISBN:
9781337399395
Author:
Pratt, David J.
Publisher:
Cengage,