MIT2_017JF09_ch07

# MIT2_017JF09_ch07 - 7 OPTIMIZATION 7 46 OPTIMIZATION The...

This preview shows pages 1–3. Sign up to view the full content.

± ² 7 OPTIMIZATION 46 7 OPTIMIZATION The engineer is continually faced with non-trivial decisions, and discerning the best among alternatives is one of the most useful and general tasks that one can master. Optimization exists because in nearly every endeavor, one is faced with tradeoﬀs. Here are some examples: Contributing to savings versus achieving enjoyment from purchases made now; Buying an expensive bicycle from one of many manufacturers - you are faced with choices on accessories, weight, style, warranty, performance, reputation, and so on; Writing a very simple piece of code that can solves a particular problem versus devel- oping a more professional and general-use product; Size of the column to support a roof load; How fast to drive on the highway; Design of strength bulkheads inside an airplane wing assembly The ﬁeld of optimization is very broad and rich, with literally hundreds of diﬀerent classes of problems, and many more methods of solution. Central to the subject is the concept of the parameter space denoted as X , which describes the region where speciﬁc decisions x may lie. For instance, acceptable models of a product oﬀ the shelf might be simply indexed as x i . x can also be a vector of speciﬁc or continuous variables, or a mixture of the two. Also critical is the concept of a cost f ( x ) that is associated with a particular parameter set x .W e c a n say that f will be minimized at the optimal set of parameters x : f ( x ) = min f ( x ) . x±X We will develop in this section some methods for continuous parameters and others for discrete parameters. will consider some concepts also from planning and multi-objective optimization, e.g., the case where there is more than one cost function. 7.1 Single-Dimension Continuous Optimization Consider the case of only one parameter, and one cost function. When the function is known and is continuous - as in many engineering applications - a very reasonable ﬁrst method to try is to zero the derivative. In particular, df ( x ) =0 . dx x = x The user has to be aware even in this ﬁrst problem that there can exist multiple points with zero derivative. These are any locations in X where f ( x ) is ﬂat, and indeed these could be

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

View Full Document
7 OPTIMIZATION 47 at local minima and at local and global maxima. Another important point to note is that if X is a ﬁnite domain, then there may be no location where the function is ﬂat. In this case, the solution could lie along the boundary of X , or take the minimum within X . In the ﬁgure below, points A and C are local maxima, E is the global maxima, B and D are local minima, and F is the global minimum shown. However, the solution domain X does not admit F, so the best solution would be B. In all the cases shown, however, we have at the maxima and minima f ± ( x ) = 0. Furthermore, at maxima f ±± ( x ) < 0, and at minima f ±± ( x ) > 0.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 11/29/2011 for the course CIVIL 1.00 taught by Professor Georgekocur during the Spring '05 term at MIT.

### Page1 / 14

MIT2_017JF09_ch07 - 7 OPTIMIZATION 7 46 OPTIMIZATION The...

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

View Full Document
Ask a homework question - tutors are online