PhilArchive
open access
Taylor Series Approximation to Solve Neutrosophic Multiobjective Programming Problem
In this paper, Taylor series is used to solve neutrosophic multi-objective programming problem (NMOPP). In the proposed approach, the truth membership, Indeterminacy membership, falsity membership functions associated with each objective of multi-objective programming problems are transformed into a single objective linear programming problem by using a first order Taylor polynomial series. Finally, to illustrate the efficiency of the proposed method, a numerical experiment for supplier selection is given as an application of Taylor series method for solving neutrosophic multi-objective programming problem at end of this paper.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Neutrosophic Treatment of Duality Linear Models and the Binary Simplex Algorithm#106396
- The Encyclopedia of Neutrosophic Researchers. Volume IV#98094
- The Encyclopedia of Neutrosophic Researchers, 1st volume#717682
- The Encyclopedia of Neutrosophic Researchers. Volume III#110248
- The Encyclopedia of Neutrosophic Researchers. Volume I#80886
Record · ID 724390
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive