Abstract
Several types of mixed variable optimum design problems (MV-OPT) are defined. Some basic concepts, definitions, and solution concepts related to the mixed discrete and continuous variable optimization problems are presented. Several methods for different classes of problems, such as the branch and bound method, integer programming, sequential linearization methods, simulated annealing (a stochastic method), dynamic rounding-off, and neighborhood search methods, are presented. An adaptive method for discrete variable optimization is also described. Methods for linked discrete variables where specification of value for one variable is linked to several other variables are also presented and illustrated. Characteristics of various discrete variable optimization methods are summarized in a table making it easier to select a method for the given MV-OPT problem.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
