Solving neutrosophic minimal cost flow problem using multi-objective linear programming problem
Saved in:
| Title: | Solving neutrosophic minimal cost flow problem using multi-objective linear programming problem |
|---|---|
| Authors: | Shubham Kumar Tripathi, Ranjan Kumar |
| Source: | Journal of Information and Optimization Sciences. 45:1093-1104 |
| Publisher Information: | Taru Publications, 2024. |
| Publication Year: | 2024 |
| Subject Terms: | 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology |
| Description: | The Linear Programming (LP) model, renowned for its robust modeling capabilities, is a highly effective tool for solving real-world problems and optimizing tasks with specific objective. A key component of the LP model is the Minimum Cost Flow (MCF), which aims to minimize the transportation cost of a single product through a capacitated network. This article focuses on the MCF problem with neutrosophic arc cost, a scenario that often arises in real-world situations due to the complexity and uncertainty of data. The neutrosophic theory plays a crucial role in handling this vagueness. The primary objective of this paper is to find the optimal solution to the neutrosophic MCF problem using SVTN numbers. |
| Document Type: | Article |
| ISSN: | 2169-0103 0252-2667 |
| DOI: | 10.47974/jios-1694 |
| Accession Number: | edsair.doi...........3c151f7c36cee73b82bbc5294a8b105c |
| Database: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstract: | The Linear Programming (LP) model, renowned for its robust modeling capabilities, is a highly effective tool for solving real-world problems and optimizing tasks with specific objective. A key component of the LP model is the Minimum Cost Flow (MCF), which aims to minimize the transportation cost of a single product through a capacitated network. This article focuses on the MCF problem with neutrosophic arc cost, a scenario that often arises in real-world situations due to the complexity and uncertainty of data. The neutrosophic theory plays a crucial role in handling this vagueness. The primary objective of this paper is to find the optimal solution to the neutrosophic MCF problem using SVTN numbers. |
|---|---|
| ISSN: | 21690103 02522667 |
| DOI: | 10.47974/jios-1694 |