Optimization method for mixed constraints problem solving

Abstract

This paper presents a new method that solves a mixed constraints problem by transforming it into a mixed integer programming problem. The method builds the connection between the feasibility of a mixed constraint problem and the solution to a mixed integer programming problem. The correctness of this method is proven. This method will be beneficial for the further integration of constraint programming and optimization methods.