Optimization brute-force search

The method of optimization is a brute-force search technique. All the possible laminates that can be obtained by changing the individual laminae orientations by 5° increments are candidates for the optimization process. We consider RC7 because this program is widely used and because it is representative of the brute-force search technique. The basic question is because we must carry a certain load, what laminate do we need We have no idea how many layers are required, much less their orientation, but we must start someplace. 

Solution The most straightforward way to optimize a function is by a brute force search. Results from such a search are shown in Table 6.2. 

SOLUTION The most straightforward way to optimize a function is by a brute-force search. Code for Example 6.3 does this using subroutines developed in Code for Example 6.2. Results from such a search are shown in Table 6.2. The example reaction sequence shows a board range of values for T and V that give close to the minimum cost. The engineer should rejoice. Since the cost is relatively insensitive to the design choices, decisions should be reasonable despite model error. 

Search for the overall optimum within the available parameter space Factorial, simplex, regression, and brute-force techniques. The classical, the brute-force, and the factorial methods are applicable to the optimization of the experiment. The simplex and various regression methods can be used to optimize both the experiment and fit models to data. 

How this optimization is accomplished is not pertinent to the present development. The operator may work by Fibonacci search, differential calculus, or even brute-force evaluation of all possible decisions all that is important is the resultant finding of the optimal yield Y and the associated decision D. 

Optimizing a univariate function is rarely seen in pharmacokinetics. Multivariate optimization is more the norm. For example, in pharmacokinetics one often wishes to identify many different rate constants and volume terms. One solution to a multivariate problem can be done either directly using direct search (Khora-sheh, Ahmadi, and Gerayeli, 1999) or random search algorithms (Schrack and Borowski, 1972), both of which are basically brute force algorithms that repeatedly evaluate the function at selected values under the... 

---