Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic Treatment of Duality Linear Models and the Binary Simplex Algorithm

Document Type

Article

Publication Date

2023

Abstract

One of the most important theories in linear programming is the dualistic theory and its basic idea is that for every linear model has dual linear model, so that solving the original linear model gives a solution to the dual model. Therefore, when we solving the linear programming model, we actually obtain solutions for two linear models. In this research, we present a study of the models. The neutrosophic dual and the binary simplex algorithm, which works to find the optimal solution for the original and dual models at the same time. The importance of this algorithm is evident in that it is relied upon in several operations research topics, such as integer programming algorithms, some nonlinear programming algorithms, and sensitivity analysis in linear programming.

Language (ISO)

English

Keywords

Neutrosophic Science, Neutrosophic Linear Models, Dual Models, Neutrosophic dual Linear Models, binary Simplex Algorithm

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

This document is currently not available here.

Share

COinS