Абстрактный

GOAL GEOMETRIC PROGRAMMING PROBLEM (G2 P2) WITH CRISP AND IMPRECISE TARGETS

Payel Ghosh, Tapan Kumar Roy

There are very common and widely used forms of solving linear and non-linear Goal Programming Problem. They are Archimedean, Lexicographic and MINMAX etc. This paper proposes a Geometric Programming method to solve a non-linear Goal Programming Problem. In particular, it demonstrates a new approach goal geometric programming in both crisp and imprecise environment. There is a numerical example and also an application of this method in two-bar truss problem. Comparison with Kuhn-Tucker conditions and crisp goal geometric programming method in the numerical example, it shows the efficiency of this method. In this paper, we have described fuzzy goal geometric programming and also implemented it on the same numerical example like crisp goal geometric programming and two bar truss problem.