ABSTRACT
There are several optimization methods that are applicable only for certain types of functions or for specific problems. In the former category are methods such as geometric and linear programming. As mentioned in Chapter 7, geometric programming can be employed for problems in which the objective function and the constraints can be represented as sums of polynomials. Linear programming is applicable when these can be represented as linear combinations of the independent variables. In the second category are techniques such as dynamic programming and those for optimizing form, shape, and structure. Dynamic programming is applicable to continuous processes that can be represented by a sequence of stages or steps so that the optimum path may be determined. Shape and structural optimization focus on varying the geometrical form or configuration of an item to obtain the optimum characteristics for a given application.
