Question: consider the LP for finding the shortest-route path from node 1 to node 7. Bidirectional arrows indicate that travel is possible both ways. Let Xij
consider the LP for finding the shortest-route path from node 1 to node 7. Bidirectional arrows indicate that travel is possible both ways. Let Xij =1 of the route from node i to node j is tajen and 0 otherwise.
which of the following represents the constraint for node 6?

x36+x67=0x36+x67=1x36x67x63=0x36x67=1x36x67=0
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
