Question: (a) Formulate the problem as an LPP by considering decision variables Xij = 1 if i j is in the shortest path and zero otherwise.

(a) Formulate the problem as an LPP by considering decision variables Xij = 1 if i j is in the shortest path and zero otherwise. ( Keep your formulation such that every variable has a positive coefficient in one constraint (for source node) and a negative coefficient in another (for sink node). )

(b) Write the dual to part (b) considering all Xij 0

(a) Formulate the problem as an LPP by

1. A person located in City l wants to reach City 5. Figure shows the network, connecting the cities along with the time taken to travel. The problem is to determine the path that takes the shortest time to travel from City 1 to City 5. (2 7 8 5 4 5 1 6 3 10 3 (a) Formulate the problem as an LPP by considering decision variables Xij = 1 if i- j is in the shortest path and zero otherwise. (Keep your formulation such that every variable has a positive coefficient in one constraint (for source node) and a negative coefficient in another (for sink node). ) (b) Write the dual to part (b) considering all Xij > 0

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!