A boolean local improvement method for general discrete optimization problems

The paper proposes a new approach to solving the discrete design optimization problem by combining Boolean logic methods with conventional nonlinear optimization. A continuous variable optimum is first found, and then the Boolean method searches the local region for the discrete variable optimum. Introduction We are concerned with proposing a new approach to solving the discrete design optimization using Boolean methods. The general nonlinear problem can be stated as follows