A penalty approach for nonlinear optimization with discrete design variables

Introduced here is a simple approach to minimization problems with discrete design variables by modifying the penaly function approach of converting the constrained problems into sequential unconstrained minimization technique (SUMT) problems. It was discovered, during the course of the present work, that a similar idea was suggested by Marcal and Gellatly. However, no further work has been encountered. A brief description of the SUMT is presented. The form of the penalty function for the discrete-valued design variables and strategy used for the implementation of the procedure is discussed next. Finally, several design examples are used to demonstrate the procedure, and results are compared with the ones available in the literature.