Optimization and Computational Fluid Dynamics - Department of ...
Optimization and Computational Fluid Dynamics - Department of ...
Optimization and Computational Fluid Dynamics - Department of ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
236 Marco Manzan, Enrico Nobile, Stefano Pieri <strong>and</strong> Francesco Pinto<br />
determinate outputs, when it undergoes through certain inputs. Whoever<br />
wants to look into a system, she/he has to, first <strong>of</strong> all, build a model <strong>of</strong> it:<br />
the simplest possible representation, yet bearing the most important features<br />
<strong>of</strong> the system itself. By means <strong>of</strong> its model, a system can be studied <strong>and</strong><br />
improved using mathematical tools, whenever a quantitative relation between<br />
inputs <strong>and</strong> outputs can be established. Thus, a system can be seen as a black<br />
box acting on inputs to produce outputs, as in the following relation:<br />
⎧<br />
⎨<br />
O =<br />
⎩<br />
O1<br />
...<br />
Om<br />
⎫ ⎧<br />
⎬ ⎨<br />
= f(X)=f<br />
⎭ ⎩<br />
X1<br />
...<br />
Xn<br />
⎫<br />
⎬<br />
⎭<br />
(8.37)<br />
where O is a set <strong>of</strong> outputs <strong>and</strong> f is a generic relation linking outputs to<br />
inputs set X.<br />
<strong>Optimization</strong> is the act <strong>of</strong> obtaining the best solution under given circumstances,<br />
as Rao states in [45]. From a system point <strong>of</strong> view, this means one is<br />
searching a maximum, or respectively a minimum, for function f, depending<br />
on the desired goal. Without loss <strong>of</strong> generality, noting that the maximum <strong>of</strong><br />
f coincides with the minimum <strong>of</strong> its opposite −f, an optimization problem<br />
can be taken as either a minimization or a maximization one.<br />
The existence <strong>of</strong> optimization methods can be traced back to the beginning<br />
<strong>of</strong> differential calculus that allows minimization <strong>of</strong> functionals, in both<br />
unconstrained <strong>and</strong> constrained domains. But, in real problems, the function f<br />
is unlikely to be a simple analytical expression, in which case the study <strong>of</strong> the<br />
function by classical mathematical analysis is sufficient. It is rather a usually<br />
unknown relation that might lack continuity, derivativeness, or connectedness.<br />
Differential calculus, therefore, is <strong>of</strong> little help in such circumstances.<br />
When a relation is unknown, a trial <strong>and</strong> error methodology is the oldest<br />
practice, <strong>and</strong> no further contributions to optimization techniques has been<br />
provided until the advent <strong>of</strong> digital computers, which have made implementation<br />
<strong>of</strong> optimization procedures a feasible task. From an optimization point <strong>of</strong><br />
view inputs <strong>and</strong> outputs in Eq. (8.37) can be renamed after their conceptual<br />
meanings. Inputs are usually known in literature as design variables, while<br />
outputs, being the goal <strong>of</strong> an optimization process, are known as objective<br />
functions or simply objectives. In many practical problems, design variables<br />
cannot be chosen arbitrarily, but they have to satisfy specified requirements.<br />
These are called design constraints. Even the objectives could undergo restrictions.<br />
They are called functional constraints. In addition to Eq. (8.37),<br />
these two kind <strong>of</strong> constraints can be formally expressed as:<br />
g (X) ≤ 0 (8.38)<br />
m (f (X)) ≤ 0 (8.39)<br />
where g <strong>and</strong> m are two general applications. Equality relations are easily<br />
obtained replacing the symbol “≤” with “=”. <strong>Optimization</strong> problems can be