{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

ps9_ee550_fall08

ps9_ee550_fall08 - UNIVERSITY OF SOUTHERN CALIFORNIA FALL...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
UNIVERSITY OF SOUTHERN CALIFORNIA, FALL 2008 1 EE 550: Problem Set 9 (Extra Credit) Due: Monday Dec. 1, 2008 I. MULTI-COMMODITY FLOW Draw a feasible set of flows for the routing problem of sending 13 units of data from node 1 to node 4 over the network in Fig. 1 (i.e., λ 14 = 13 ). All links are bidirectional as in class, with symmetric link capacities as shown. Your solution must satisfy the additional constraint that the sum flow over any link is strictly less than the capacity of the link. 1 4 6 5 3 2 4 12 7 2 9 6 3 5 λ 14 Fig. 1. A multi-node networks. II. OPTIMIZATION NOTE In class we considered the following problem: Minimize: N i =1 φ i ( x i ) Subject to: 0 x i C i for all i ∈ { 1 ,...,N } N i =1 x i = λ Suppose that the φ i ( x ) functions are differentiable. We found that an optimal solution ( x * 1 ,...,x * N ) must satisfy the following derivative matching conditions. 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 2

ps9_ee550_fall08 - UNIVERSITY OF SOUTHERN CALIFORNIA FALL...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon bookmark
Ask a homework question - tutors are online