Question: = Problem 3. In the given a direct network N = (V, A) with arc cost (or length) Cij > 0 for arc (i,j) E

= Problem 3. In the given a direct network N =

= Problem 3. In the given a direct network N = (V, A) with arc cost (or length) Cij > 0 for arc (i,j) E A, Identify a shortest path from the source node s to the sink node t. Let Lij E {0,1} be a binary variable to decide whether an arc is included in the shortest path or not (this one can be relaxed to tij > 0 as explained in class). This general shortest path problem can be formulated as min Cijlij (ij)EA s.t. Xij- Iji = = 1, 0, -1, =s Vi EV\{s, t} i=t j:(ij) EA j:(ji)EA = Xij > 0, Vi,j) E A Find the dual of this LP problem. Hint: Use the idea learned in finding the dual of maximum flow

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!