bv_cvxbook_extra_exercises

If you introduce new variables or transform the

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: explain. Clearly give the objective and inequality constraint functions, explaining why they are convex if it is not obvious. If your problem involves equality constraints, give them explicitly. Carry out your method on the specific instance with n = 4, and data Atot = 10000, α = (10−5 , 10−2 , 10−2 , 10−2 ), M = (0.1, 5, 10, 10), max = (40, 40, 40, 20). A Give the optimal gains, and the optimal dynamic range. 11.4 Blending existing circuit designs. In circuit design, we must select the widths of a set of n components, given by the vector w = (w1 , . . . , wn ), which must satisfy width limits W min ≤ wi ≤ W max , i = 1, . . . , n, where W min and W max are given (positive) values. (You can assume there are no other constraints on w.) The design is judged by three objectives, each of which we would like to be small: the circuit power P (w), the circuit delay D(w), and the total circuit area A(w). These three objectives are (complicated) posynomial functions of w. You do not know the functions P , D, or A...
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 Berkeley.

Ask a homework question - tutors are online