| Article ID: | iaor1997694 |
| Country: | Netherlands |
| Volume: | 25 |
| Issue: | 3 |
| Start Page Number: | 201 |
| End Page Number: | 212 |
| Publication Date: | Dec 1995 |
| Journal: | Engineering Optimization |
| Authors: | Bricker Dennis L., Choi Jae Chul |
| Keywords: | programming: integer |
Geometric programming problems in which several of the variables are restricted to assume either integer values or one of a set of standard sizes are known as Semi-Discrete Geometric Programming problems. In this paper several variations of Generalized Benders’ Decomposition are described for these problems and some computational experience is presented.