LR-Type Fully Single-Valued Neutrosophic Linear Programming Problems

A single-valued neutrosophic set, an generalization of intuitionistic fuzzy set, is a powerful model to deal with uncertainty. In this study we present a method to solve LR-type single-valued neutrosophic linear programming problems by using unrestricted LR-type single-valued neutrosophic numbers. We propose the ranking function to transform LR-type single-valued neutrosophic problems into crisp problems. The arithmetic operations for unrestricted LR-type single-valued neutrosophic numbers are introduced. We propose a method to solve the fully single-valued neutrosophic linear programming problems with equality constraints having LR-type single-valued neutrosophic numbers as right hand sides, parameters and variables. We describe our proposed method by solving real life examples