.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Duality results
Dual simplex method
Grey system
Grey number
Grey linear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
353
被引数:
886
机构
引用论文
.png){kind=icon}
What are These Things Called Geopolymers? A Physicochemical Perspective这些被称为地聚合物的物质是什么？——从物理化学角度探讨
PREAI
分享收藏分享收藏分享收藏分享收藏
查看更多内容