To develop a branch and bound method for this problem,a nonlinear integer-programming model was constructed.

Research on distributed parallel computing for branch and bound algorithm;

A bounding function is constructed by the use of the surrogateconstraint with less computational time, and a branch and bound algorithm is presented.

In this thesis, the design and realization of a special cluster are presented for calculating branch and bound algorithm that can decrease the calculating time and enhance the algorithmic efficiency.

Interior point method and branch-and-bound method for unit commitment;

Study on optimal power flow based on primal-dual interior point algorithm under perturbed KKT conditions and branch-and-bound method;

By converting discrete variables into continuous variables,applying the primal-dual interior method to global optimization within the feasible domain and integrating with the branch-and-bound method based on BFS(Breadth-First-Search) for the discret.