MMN-4020

An optimized model for neutrosophic multi-choice goal programming

Amirhossein Nafei; Chien-Yi Huang; Seyed Mohammadtaghi Azimi; Amir Javadpour;

Abstract

Goal Programming (GP) as a generalization of linear programming is a proper technique for handling Multi-Objective Decision-Making (MODM) problems. Using this technique, we can determine multiple aspiration levels for each objective. The Neutrosophic set theory is a powerful tool to deal with indeterminacy and inconsistent data. This paper provides a new idea to formulate Neutrosophic Multi-Choice Goal Programming (NMCGP) problems to simulate real-life problems more realistically. Also, to show the low computational complexity for the proposed model, the Space and time complexity criterion is used in the Python language. Eventually, a mathematical practical example is solved to present the effectiveness of the proposed model.


Vol. 24 (2023), No. 2, pp. 915-931
DOI: 10.18514/MMN.2023.4020


Download: MMN-4020