.png){kind=icon}
返回
Detecting IIS in infeasible linear programmes using techniques from goal programming
.png){kind=icon}
PRE
AI
DOI：10.1016/0305-0548(95)00018-H.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents ideas from goal programming (GP) used as an accompaniment to linear programming (LP) for the analysis of LP infeasibility. A new algorithm (GPIIS) for the detection of irreducibly inconsistent systems (IIS) of constraints is presented using this approach. The structure necessary for implementing such a procedure into a commercial LP solver is outlined. Results for a selection of infeasible LP problems are given, and conclusions drawn.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
.png){kind=icon}
