Geometric Programming in Imprecise Domain with Application

The paper aims to obtain a computational algorithm to solve a geometric Programming Problem by weighted sum method with equal priority in imprecise condition i.e. in Fuzzy, Intuitionistic Fuzzy and Neutrosophic field. A contrasting study of optimal solution among three has been prescribed to show the efficiency of this method. Numerical example and an application Gravel Box Design Problem is presented to compare different designs. Proposed method is determined by maximizing the truth and indeterminacy membership degree and minimizing the negative membership degree.