A Continuous Strategy to Solve a Class of Discrete Optimization Problems

In this work we develop a method to solve a class of discrete optimization problems. This class covers linear, quadratic, convex, and discrete geometric programming problems. The methodology consists in inserting additional geometric constraints where any viable solution is also discrete. Moreover, we also adopt a methodology for solution of signomial geometric programming problems and solve the problem. We present some examples of facility location problems and the results obtained.