An application of a delimitative and combinatorial algorithm to the discrete optimum design of structures

In the present algorithm, the lower bounds of combinations are defined by the constraint functions, and the upper bounds by the objective function step by step in the search procedure, accompanying the fact that a series of infeasible and nonoptimum combinations are eliminated. The advantages of this algorithm are that computational effort is decreased and the effectiveness is increased significantly.