Before revision:  However, by using canonical duality theory (CDT) developed recently by the author, this challenging 0-1 integer programming problem can be solved analytically to obtain global optimal solution at each design iteration.
After revision:  However, by using canonical duality theory (CDT) developed recently by the author, the linear knapsack problem can be solved analytically to obtain global optimal solution at each design iteration.