Estimating Solution of Posynomial Geometric Programming Problems with Interval Coefficients

Abstract

Posynomial Geometric Programming problems are considered to be complex in nature when the coefficients in the objective function, the constraints as well as on the right hand side of the constraints are in the form of an interval. Many approaches have been followedto find the approximate optimal solution for such type of geometric programming problems. In this paper, we have considered single objective posynomial geometric programming problem of above mentioned type. To solve such type of problems, we have converted the interval coefficient to a single number using interval valued function. Karush-Kuhn Tucker conditions are applied on this non-linear problem. To linearize the resulting non-linear problem we used first order Taylor’s series expansionwhich is further solved for the optimal solution. The function codes are written in Python and executed using Google Colab due to free availability and ease of use as compared to other mathematical tools.