In the basic power ow optimization problem we choose

Info iconThis preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: ation problem minimize nλmax (L(W ) + diag(x)) subject to 1T x = 0, with variable x ∈ Rn . Express this problem as an SDP. (d) Derive an alternative expression for f (W ), by taking the dual of the SDP in part 3. Show that the dual SDP is equivalent to the following problem: maximize i≤ j subject pi wij pi − pj 2 = 1, 2 2 i = 1, . . . , n, with variables pi ∈ Rn , i = 1, . . . , n. In this problem we place n points pi on the unit sphere in Rn in such a way that the weighted sum of their squared pair-wise distances is maximized. 15.3 Utility versus latency trade-off in a network. We consider a network with m edges, labeled 1, . . . , m, and n flows, labeled 1, . . . , n. Each flow has an associated nonnegative flow rate fj ; each edge or link has an associated positive capacity ci . Each flow passes over a fixed set of links (its route); the total traffic ti on link i is the sum of the flow rates over all flows that pass through link i. The flow routes are described by a routing matrix R ∈ Rm×n , de...
View Full Document

This note was uploaded on 09/10/2013 for the course C 231 taught by Professor F.borrelli during the Fall '13 term at University of California, Berkeley.

Ask a homework question - tutors are online