Solving the Problem of Linear Programming with Cost Coefficients and Grey Resources Using the Primal Simplex Algorithm
In most real-world issues, we are dealing with situations where accurate data and complete information are not available. One way to deal with these uncertainties in real life is to use Grey System Theory (GST). In this paper, a linear programing problem in a grey environment with interval Grey Numb...
Saved in:
Main Author: | Farid Pourofoghi |
---|---|
Format: | Article |
Language: | English |
Published: |
REA Press
2022-06-01
|
Series: | Big Data and Computing Visions |
Subjects: | |
Online Access: | https://www.bidacv.com/article_153167_5ccfdc1662cc2874f339a074f77a3cee.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Improving classic hungarian algorithm considering uncertainty by applying for grey numbers
by: Shahram Ariafar, et al.
Published: (2023-09-01) -
The Axiomatic Characterization of the Grey Shapley Value
by: Mehmet Gençtürk, et al.
Published: (2025-01-01) -
Low-Cost Domestic Grey Wastewater Treatment and Recycling System.
by: Mubangizi, Paul Steven
Published: (2024) -
Presenting a Model for Robot evaluation and Ranking by Grey MuLTIMOORA
by: Ahmadreza Ghasemi, et al.
Published: (2022-03-01) -
On the Simplex-based methods for Neutrosophic linear programming problems
by: Sulima Ahmed Mohammed Zubair, et al.
Published: (2024-12-01)