Taylor Series Approximation to Solve Neutrosophic Multiobjective Programming Problem


  • Ibrahim M. Hezam Department of computer, Faculty of Education, Ibb University, Ibb city, Yemen
  • Mohamed Abdel-Baset Department of Operations Research, Faculty of Computers and Informatics, Zagazig University, El-Zera Square, Zagazig, Sharqiyah, Egypt
  • Florentin Smarandache University of New Mexico, Math & Science Division, 705 Gurley Ave., Gallup, NM 87301, USA


Taylor series, Neutrosophic optimization, Multiobjective programming problem


In this paper, Taylor series is used to solve the 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 problems at end of this paper.


Download data is not yet available.




How to Cite

Ibrahim M. Hezam, Mohamed Abdel-Baset, & Smarandache, F. (2020). Taylor Series Approximation to Solve Neutrosophic Multiobjective Programming Problem. Neutrosophic Sets and Systems, 10, 39-45. Retrieved from http://fs.unm.edu/NSS2/index.php/111/article/view/465