.png){kind=icon}
返回
Infeasibility resolution based on goal programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2006.08.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Infeasibility resolution is an important aspect of infeasibility analysis. This paper proposes a multi-objective programming model for infeasibility resolution and develops a method based on l(infinity) norm goal programming to solve the problem. Any solution is at least weakly efficient and any efficient solution is reachable by regulating the weights. For the special case of irreducibly inconsistent linear systems, any solution is guaranteed to be efficient. The method is capable of handling both linear and nonlinear/non-convex cases, as demonstrated by the numerical examples. (c) 2006 Elsevier Ltd. All rights reserved.
Keyword:
infeasibility analysis
goal programming
IIS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容