A continuous strategy to solve a class of mixed optimization problems

This work presents a method to solve a class of discrete optimization problems, including linear, quadratic, convex, and discrete geometric programming problems. The methodology consists of inserting, in the original problem, additional geometric constraints where any viable solution is also discrete. Moreover, a strategy to solve signomial geometric programming problems is developed. Computational results are shown through some examples of facility location, machining economics and economic order quantity problems.