3. a. Diagram given below is the example of shortest route problem. Number the nodes in an appropriate way (1) b. Write the objective function if the numbers on the arcs represent kilometers (3) c. Write the constraints for the origin and end nodes (2) d. Write the constraints for the three nodes that cone immediate after the origin node (3 +3+3) 2 12 2 2 4. 14 2
https://media.cheggcdn.com/media%2Fda3%2Fda37f73f-ca12-4c6a-8dd4-556c32d582a8%2Fimage
Expert Answer
https://d2vlcm61l7u1fs.cloudfront.net/media%2Fdef%2Fdef98c3d-c770-42fc-9e60-3649b05734cf%2Fphpt8DJuB.png
(b)
Let Yij be the set of binary integers such that Yij=1 when the arc starting from node-i to node-j is selected and Yij=0 otherwise.
i = A,B,C,D,E
j = B,C,D,E,F
Objective
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured