Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4652740 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics