Abstract
Most of the practical design variables should always be discrete quantity within engineering optimization design problems. To obtain the true optimization solution, a discrete optimization method must be used. In this paper, a new method called step optimization search method is presented to solve the discrete quantity mathematic programming problems. The basic idea of this method is to find out an initial feasible point and then to search the optimum point step by step in the neighbouring region of this point so as to obtain an improved new discrete point. Respectively, the new point can be taken as initial one, and the whole process can be carried out once more until the optimum solution of the problem is obtained.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
