Asymptotic strong determination in integer programming: Quasi dual method

Although the Lagrangian method is a powerful dual search method in integer programming, it often fail to identify the optimal solution of the primal problem. In this paper, a quasi dual formulation is proposed for bounded integer programming. This formulation possesses an asymptotic strong determination property and guarantees a success for identifying an optimum solution. Its another feature is that no actual dual search is needed when the parameters of the method are set to be large enough. Copyright Springer-Verlag Berlin Heidelberg 2003