Purchase Solution

Path- Distance (Shortest Route)

Not what you're looking for?

Ask Custom Question

Consider the following shortest-route problem involving seven cities. The distances between the cities are given below. Draw the network model for this problem and formulate the LP for finding the shortest route from City 1 to City 7

Path Distance
1 to 2 6
1 to 3 10
1 to 4 7
2 to 3 4
2 to 5 5
3 to 4 5
3 to 5 2
3 to 6 4
4 to 6 8
5 to 7 7
6 to 7 5

Purchase this Solution
Solution Summary

Path- Distance (Shortest Route)

Purchase this Solution
Free BrainMass Quizzes
Measures of Central Tendency

This quiz evaluates the students understanding of the measures of central tendency seen in statistics. This quiz is specifically designed to incorporate the measures of central tendency as they relate to psychological research.

Measures of Central Tendency

Tests knowledge of the three main measures of central tendency, including some simple calculation questions.

Know Your Statistical Concepts

Each question is a choice-summary multiple choice question that presents you with a statistical concept and then 4 numbered statements. You must decide which (if any) of the numbered statements is/are true as they relate to the statistical concept.

Terms and Definitions for Statistics

This quiz covers basic terms and definitions of statistics.

View More Free Quizzes
Related BrainMass Solutions

  • Shortest Path and Maximal Flow Problem

    The last distance at the ending node will be the distance of the shortest route. The distances placed in the boxes by each node are the shortest route to this node.

  • Quantative Analysis Network models: Shortest route technique

    The route O - A is the shortest path instead of O - B - A to the node "A". The route O - A - B is the shortest route to the node "B" instead of O - B from the origin "O". The nearest nodes to "B" are "D" and "E". But at "D" we get a tie.

  • Spanning tree technique

    The last distance at the ending node will be the distance of the shortest route. You should note that the distance placed in the box by each node is the shortest route to this node.

  • minimal-spanning tree, maximal-flow, shortest route techniqu

    Shortest route technique offers an advantage of finding shortest route or path through which a person or item can travel from one place to another place. This technique is fruitful in minimizing time and total distance traveled by a person or item.

  • Some problems on network models

    Node Shortest Distance Route 2 1-2 50 3 1-3 100 4 1-2-5 110 5 1-3-4 180 6 1-3-6 165 7 1-2-5-6 260 8 1-3-4-6 380 Shortest route is 1-3-6 with total distance of 165. 3.

  • Network Flow for Different Models

    The shortest route is 1-3-7 and total distance is 340 feet.

  • Determining Shortest Route

    The following network show the different connecting trails and the distance of each connecting branch in miles. Determine the shortest path from node 1 in North Georgia to node 13 in Virginia and indicate the total mileage of the trail.

  • Given the following network, what is the shortest route?

    Therefore, from the above, the shortest route is 1  4  6  7 And the total distance on the shortest route is = 18 + 3 + 3 = 24 Km. The expert determines the shortest route given a network.

  • Determining Minimum and Shortest Paths: Example Problem

    In each case, list a path providing the minimum value. See attached graph. (a). Shortest-path distance from C to D (b). Shortest-path distance from E to B (c). Shortest-path distance from C to F (d). Minimum path from C to D. (e).

View More Related Solutions