Let us be given a network without capacities (V, E, s, t), where (V, E) is...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
Let us be given a network without capacities (V, E, s, t), where (V, E) is a directed graph, with a source s € V (unique node with no incoming arcs) and a sink te V (unique node with no outcoming arcs). Suppose that CE R is a vector of nonnegative costs of the arcs in the network (where n is the number arcs). Dijkstra's algorithm finds a shortest st path in such network, that is, a directed st path with smallest total cost (computed as the sum of the costs of all arcs). We will first study a specialisation of the primal-dual algorithm, which is strongly related to Dijkstra's algorithm. It is known [1, Section 5.4] that to solve the problem of finding such shortest path one can write out the following linear programming problem: min c f s.t. Af + d=0, f≥ 0, where fR is the flow through the network, c ER is the vector of costs of all arcs, A is the node-arc incidence matrix, and d E R" is the vector whose coordinates are defined by di = -1, 1, 0, if i= s, if it, otherwise, (1) where m is the number of nodes. Solve the following problems: Problem 1. Formulate the dual to (1) and explain why the condition Tt = 0 can be added to the constraints. Problem 2. Assuming that a dual feasible solution with t=0 is known, consider an application of the primal-dual algorithm to (1). Which equation of the system Af + d = 0 can be excluded from the system to make the primal-dual algorithm applicable (with all other equations remaining unchanged), and why can it be excluded? Given a dual feasible, which arcs (i, j), for i, je V, correspond to the admissible columns? Formulate the restricted primal problem (RP) for (1) with one equation excluded (which you specified before), and the dual to that restricted primal problem (DRP). Let us be given a network without capacities (V, E, s, t), where (V, E) is a directed graph, with a source s € V (unique node with no incoming arcs) and a sink te V (unique node with no outcoming arcs). Suppose that CE R is a vector of nonnegative costs of the arcs in the network (where n is the number arcs). Dijkstra's algorithm finds a shortest st path in such network, that is, a directed st path with smallest total cost (computed as the sum of the costs of all arcs). We will first study a specialisation of the primal-dual algorithm, which is strongly related to Dijkstra's algorithm. It is known [1, Section 5.4] that to solve the problem of finding such shortest path one can write out the following linear programming problem: min c f s.t. Af + d=0, f≥ 0, where fR is the flow through the network, c ER is the vector of costs of all arcs, A is the node-arc incidence matrix, and d E R" is the vector whose coordinates are defined by di = -1, 1, 0, if i= s, if it, otherwise, (1) where m is the number of nodes. Solve the following problems: Problem 1. Formulate the dual to (1) and explain why the condition Tt = 0 can be added to the constraints. Problem 2. Assuming that a dual feasible solution with t=0 is known, consider an application of the primal-dual algorithm to (1). Which equation of the system Af + d = 0 can be excluded from the system to make the primal-dual algorithm applicable (with all other equations remaining unchanged), and why can it be excluded? Given a dual feasible, which arcs (i, j), for i, je V, correspond to the admissible columns? Formulate the restricted primal problem (RP) for (1) with one equation excluded (which you specified before), and the dual to that restricted primal problem (DRP).
Expert Answer:
Answer rating: 100% (QA)
Primed min of Af D f20 dual mon Ts 1 Afta j Fjcij for all Pj EE t0 Ti is unrestricted R... View the full answer
Related Book For
Discrete and Combinatorial Mathematics An Applied Introduction
ISBN: 978-0201726343
5th edition
Authors: Ralph P. Grimaldi
Posted Date:
Students also viewed these algorithms questions
-
The following additional information is available for the Dr. Ivan and Irene Incisor family from Chapters 1-5. Ivan's grandfather died and left a portfolio of municipal bonds. In 2012, they pay Ivan...
-
Planning is one of the most important management functions in any business. A front office managers first step in planning should involve determine the departments goals. Planning also includes...
-
The university administration would like to add some additional parking locations. To make everyone happy, they would like each building to be within a 5 minute walk of one set of new parking spaces...
-
1. If net profit is $47,025; depreciation is $2,200; accounts receivable increases $5,056; accounts payable increases $4,673; and inventory declines $850; what is the operating cash flow for the...
-
The following data are based on information in the 2010 annual reports of H&R Block, Inc. , and Jackson Hewitt Tax Services, Inc. Dollar amounts are in thousands. H&R Block, Inc., has subsidiaries...
-
Let x and y distinct vectors in Rn with ||x||2 = ||y||2.Define Show that (a) ||x-y||22 = 2(x-y)Tx (b) Qx = y (x-y) and Q=1-2uuT x yllz
-
The following transactions for Best Deal Tire, Co., occurred during May: Requirements 1. Journalize the transactions on the books of Best Deal Tire, Co. 2. What was Best Deal Tires gross profit for...
-
Velocity near a moving sphere, a sphere of radius R is falling in creeping flow with a terminal velocity v through a quiescent fluid of viscosity/. At what horizontal distance from the sphere does...
-
Suppose you purchase a house for $550,000 and make a down payment of 21% of the purchase price. The balance is amortized over 20 years The house mortgage agreement is subject to 3.4513% compounded...
-
Refer to Fig. 9.15, which shows three pipes inside a larger pipe. The inside pipes carry water at 200°F and the large pipe carries water at 60F. The average velocity of flow is 25.0 ft/s in each...
-
Assume the forward price of the contract is 50000 and that you have no transaction costs or other market frictions Form a portfolio that requires no investment today and will guarantee you profits at...
-
Indicate whether each account listed below is a(n) asset (A), liability (L), owner's equity (OE), revenue (R), or expense (E) account. Next to each answer, indicate whether the account's normal...
-
Describe the steps necessary to modify an income statement so that it includes comparative information.
-
How does QuickZoom help you further investigate an income statement?
-
Which of the following comparisons would be most useful to an auditor in evaluating the overall financial results of an entity's operations? a. Prior-year accounts payable to current-year accounts...
-
Debate the usefulness or otherwise of personal references when appraising salespeople for a specific position.
-
Identify a specific therapeutic plan used to address the resistance/problem behavior when it occurs in a group with a group member. In other words, how could you deal with the problem behavior...
-
Define deferred revenue. Why is it a liability?
-
Prove or disprove each of the following, where p, q, and r are any statements. (a) [(p q) r] [p (q r)]. (b) [(p (q r] [(p q) (p r)].
-
Give an example of a function f: A B and A1, A2 A for which f(A1 A2) f(A1) (A2). [Thus the inclusion in Theorem 5.2(b) may be proper.]
-
(a) Let T = (V, E) be a tree. If v V, prove that v is an articulation point of T if and only if deg(v) > 1. (b) Let G = (V, E) be a loop-free connected undirected graph with |E| 1. Prove that G has...
-
The height of Watt's governor is (a) directly proportional to the speed (b) directly proportional to the (speed) \({ }^{2}\) (c) inversely proportional to the speed (d) inversely proportional to the...
-
Consider the following statements in respect of four-bar mechanisms: 1). It is possible to have the length of one link greater than the sum of lengths of the other three links 2). If the sum of the...
-
The Fig. 87 shows a critically damped spring-mass system undergoing single degree of freedom vibrations. If \(m=5 \mathrm{~kg}\) and \(k=20 \mathrm{~N} / \mathrm{m}\), the value of viscous damping...
Study smarter with the SolutionInn App