An algorithm for solving non-linear programming problems containing integer, discrete and continuous variables is presented. Based on a commonly employed optimization algorithm, penalties on integer and/or discrete violations are imposed on the objective function to force the search to converge upon standard values. Examples are included to illustrate the practical use of this algorithm in the area of engineering design.
No takes yet. Share an insight, caveat, or question.
Fu et al. (1991) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: