Abstract
Branch and bound has been widely recognized as an effective method in solving linear integer programming problems. This paper presents a study on the feasibility of the branch and bound method in solving general nonlinear mixed integer programming and discrete optimization problems. First, a description of the branch and bound method as applied to the integer case is given. Next, a computer code BBNLMIP is developed to carry out an experimental study on 22 test problems. The numerical results indicate the effect of the problem parameters such as number of integer variables and constraints. Finally, a method for extending the branch and bound principle to solve nonlinear discrete optimization problems is described.
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 callMore From: Journal of Mechanisms, Transmissions, and Automation in Design
Disclaimer: 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.
