Figure 1. Delivery Routes

Short Answer

Figure 1. Delivery Routes
-Consider the network diagram given in Figure 1. Assume that the amount on each branch is the distance in miles between the respective nodes. Also assume that it is not possible to travel from a node with a higher number to a node with a lower number. Write the constraint associated with the second node (node 2) for the 0-1 integer linear programming formulation of the shortest route problem.