AttributesValues
type
value
  • In this paper, authors disclose a new concept of pentagonal neutrosophic (PN) approach to solve linear programming (LP) problem. To best of our insight, there is no approach for solving PNLP problem. For the first time, we take up the PNLP problem where the objectives, constraints are considered as pentagonal neutrosophic numbers (PNN). To deign our algorithm, we described the PN arithmetic operation laws and mathematical computation in PNN environment. This proposed method is based on ranking function and convert to its equivalent crisp LP (CrLP) problem. The obtained CrLP issue is presently being tackled by any LP method which is effectively accessible. To legitimize the proposed technique, some numerical tests are given to show the adequacy of the new model.
Subject
  • Mathematical physics
  • Convex optimization
  • Geometric algorithms
  • Linear programming
  • P-complete problems
  • Arithmetic
part of
is abstract of
is hasSource of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software