GEOMETRIC PROGRAMMING WITH SEVERAL DISCRETE VARIABLES: ALGORITHMS EMPLOYING GENERALIZED BENDERS' DECOMPOSITION
- 1 December 1995
- journal article
- research article
- Published by Taylor & Francis Ltd in Engineering Optimization
- Vol. 25 (3), 201-212
- https://doi.org/10.1080/03052159508941263
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Yet another geometric programming dual algorithmOperations Research Letters, 1983
- Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' DecompositionOperations Research, 1983
- Solving Stochastic Transportation-Location Problems by Generalized Benders DecompositionTransportation Science, 1982
- Planning Electric Power Generation: A Nonlinear Mixed Integer Model Employing Benders DecompositionManagement Science, 1977
- Generalized Benders decompositionJournal of Optimization Theory and Applications, 1972
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962