Article ID: | iaor20063637 |
Country: | Netherlands |
Volume: | 168 |
Issue: | 2 |
Start Page Number: | 345 |
End Page Number: | 353 |
Publication Date: | Jan 2006 |
Journal: | European Journal of Operational Research |
Authors: | Liu Shiang-Tai |
Keywords: | optimization |
Geometric programming provides a powerful tool for solving nonlinear problems where nonlinear relations can be well presented by exponential or power function. This paper develops a procedure to derive the lower and upper bounds of the objective of the posynomial geometric programming problem when the cost and constraint parameters are uncertain. The imprecise parameters are represented by ranges, instead of single values. An imprecise geometric program is transformed to a family of conventional geometric programs to calculate the objective value. The derived result is also in a range, where the objective value would appear. The ability of calculating the bounds of the objective value developed in this paper might help lead to more realistic modeling efforts in engineering design areas.