This paper presents a new algorithm for solving mixed integer nonlinear programming problems. The algorithm uses a branch and bound strategy where a nonlinear programming problem is solved in each integer node of the tree. The nonlinear programming problems, at each integer node of the tree, are not solved to optimality, rather one iteration step is taken at each node and then linearizations of...