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...