.png){kind=icon}
Return
A dual simplex method for grey linear programming problems based on duality results
.png){kind=icon}
PRE
AI
DOI：10.1108/GS-10-2019-0044.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Purpose For extending the common definitions and concepts of grey system theory to the optimization subject, a dual problem is proposed for the primal grey linear programming problem. Design/methodology/approach The authors discuss the solution concepts of primal and dual of grey linear programming problems without converting them to classical linear programming problems. A numerical example is provided to illustrate the theory developed. Findings By using arithmetic operations between interval grey numbers, the authors prove the complementary slackness theorem for grey linear programming problem and the associated dual problem. Originality/value Complementary slackness theorem for grey linear programming is first presented and proven. After that, a dual simplex method in grey environment is introduced and then some useful concepts are presented.
Keywords:
Duality results
Dual simplex method
Grey system
Grey number
Grey linear programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
353
Citations:
886
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more