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. The branch and bound method as applied to the integer case is described, and 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. A method for extending the branch and bound principle to solve nonlinear discrete optimization problems is described.
All Science Journal Classification (ASJC) codes