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 th...

Full description

Saved in:

Bibliographic Details
Published in:	Neutrosophic sets and systems Vol. 51; pp. 371 - 392
Main Author:	Das, Pintu
Format:	Journal Article
Language:	English
Published:	Neutrosophic Sets and Systems 01-12-2022 University of New Mexico
Subjects:	fuzzy geometric programming gravel box design problem intuitionistic fuzzy Investment analysis neutrosophic sets
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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. Keywords: Geometric Programming, Fuzzy, Intuitionistic Fuzzy, Neutrosophic sets, Gravel Box Design Problem.
ISSN:	2331-6055 2331-608X
DOI:	10.5281/zenodo.7135323