An algorithm model for mixed variable programming

In this paper we consider a particular class of nonlinear optimization problems involving both continuous and discrete variables. The distinguishing feature of this class of nonlinear mixed variable optimization problems is that the structure and the number of variables of the problem depend on the values of some discrete variables. In particular, we de. ne a general algorithm model for the solution of this class of problems, that draws inspiration from the approach recently proposed by Audet and Dennis [SIAM J. Optim., 11 (2001), pp. 573-594], and is based on the strategy of combining in a suitable way a local search with respect to the continuous variables and a local search with respect to the discrete variables. We prove global convergence of the algorithm model without specifying the local continuous search, but only identifying some reasonable requirements. Moreover, we de. ne a particular derivative-free algorithm for solving mixed variable programming problems where the continuous variables are linearly constrained and derivative information is not available. Finally, we report numerical results obtained by the proposed algorithm in solving a real optimal design problem. These results show the effectiveness of the approach