Abstract:

A rotating vector optimization method for integer programming is presented based on the basic rotate vector method.  Rotation coefficient and contract coefficient are rebuilt. The length of the radius vector is ensured to be constant in  the process of rotation. The strategy for contraction can search an optimal solution exhaustively in the space. The 
method of multi vectors and the principle of “survival of the fittest” are used. The rejection coefficient of radius  vectors and the retained coefficient of vectors are introduced as control parameters. As a result, computational  efficiency and accuracy are improved evidently. The effectiveness is tested by solving two examples of integer  programming. The method is also efficient for integer programming with higher dimensional space.