This preview shows page 1. Sign up to view the full content.
Unformatted text preview: onsider a network with n directed arcs. The ﬂow through arc k is denoted
xk and can be positive, negative, or zero. The ﬂow vector x must satisfy the network constraint
Ax = b where A is the node-arc incidence matrix and b is the external ﬂow supplied to the nodes.
Each arc has a positive capacity or width yk . The quantity |xk |/yk is the ﬂow density in arc k .
The cost of the ﬂow in arc k depends on the ﬂow density and the width of the arc, and is given by
yk φk (|xk |/yk ), where φk is convex and nondecreasing on R+ .
(a) Deﬁne f (y, b) as the optimal value of the network ﬂow optimization problem
k=1 subject to yk φk (|xk |/yk ) Ax = b with variable x, for given values of the arc widths y ≻ 0 and external ﬂows b. Is f a convex
function (jointly in y , b)? Carefully explain your answer.
(b) Suppose b is a discrete random vector with possible values b(1) , . . . , b(m) . The probability that
b = b(j ) is πj . Consider the problem of sizing the network (selecting the arc widths yk ) so that 132 the expected cost is minimized:
minimize g (y ) + E f (y, b). (42) The variable is y . Here g is a convex function, representing the ins...
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.
- Fall '13
- The Aeneid