| Abstract: | In this paper a new concept for development of algorithms for optimal design of engineering systems is presented. The basic idea is to use upper and lower bounds on optimum cost to develop iterative search strategies. The main feature of the concept is that it does not rely on one-dimensional search to compute a step size at any design iteration. Implication of the feature is that the algorithms based on this concept require evaluation of constraint functions only once at any design iteration. This is highly desirable for optimal design of engineering systems because evaluation of functions for such systems is very expensive due to their implicit dependence on design variables. An algorithm based on the new concept is derived in the paper. Several new step sizes are introduced and their relation to proper reduced optimal design problems are presented. A new step size based on the constant cost requirement at some design iterations is introduced. Numerical aspects for the algorithm are also presented. Based on the new algorithm, a general-purpose computer code GRP2 is developed. The code is used to solve several problems to gain experience and insight for the algorithm. Numerical experience with examples is discussed. It is concluded that algorithms based on bounding optimum cost have substantial potential for applications in optimal design of engineering systems. |
