bv_cvxbook_extra_exercises

Here we will use a very simple model with xj r

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: w to ﬁnd the fuel burn levels f0 , . . . , fN that minimize the time T , subject to the constraints. (b) Carry out the method described in part (a) for the problem instance with data given in min_time_speed_data.m. Give the optimal time T ⋆ , and compare it to the time T unif achieved if the fuel for propulsion were burned uniformly, i.e., f0 = · · · = fN . For each of these cases, plot speed versus distance along the road, using the plotting code in the data ﬁle as a template. 14.12 Least-cost road grading. A road is to be built along a given path. We must choose the height of the roadbed (say, above sea level) along the path, minimizing the total cost of grading, subject to some constraints. The cost of grading (i.e., moving earth to change the height of the roadbed from the existing elevation) depends on the diﬀerence in height between the roadbed and the existing elevation. When the roadbed is below the existing elevation it is called a cut ; when it is above it is called a ﬁll. Each of these incurs engineering costs; for example, ﬁll is cre...
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