SOLVING GEOMETRIC PROGRAMMING PROBLEMS WITH TRIANGULAR AND TRAPEZOIDAL UNCERTAINTY DISTRIBUTIONS

Abstract

The geometric programming problem is an important optimization technique that is often used to solve different nonlinear optimization problems and engineering problems. The geometric programming models that are commonly used are generally based on deterministic and accurate parameters. However, it is observed that in real-world geometric programming problems, the parameters are frequently inaccurate and ambiguous. In this paper, we consider chance-constrained geometric programming problems with uncertain coefficients and with geometric programming techniques in the uncertain-based framework. We show that the associated chance-constrained uncertain geometric programming problem can be converted into a crisp geometric programming problem by using triangular and trapezoidal uncertainty distributions for the uncertain variables. The main aim of this paper is to provide the solution procedures for geometric programming problems under triangular and trapezoidal uncertainty distributions. To show how well the procedures and algorithms work, two numerical examples and an application in the inventory model are given.