.png){kind=icon}
返回
Maximal inner boxes in parametric AE-solution sets with linear shape
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2015.08.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider linear systems of equations A(p)x = b(p), where the parameters pare linearly dependent and come from prescribed boxes, and the sets of solutions (defined in various ways) which have linear boundary. One fundamental problem is to compute a box being inside a parametric solution set. We first consider parametric tolerable solution sets (being convex polyhedrons). For such solution sets we prove that finding a maximal inner box is an NP-hard problem. This justifies our exponential linear programming methods for computing maximal inner boxes. We also propose a polynomial heuristic that yields a large, but not necessarily the maximal, inner box. Next, we discuss how to apply the presented linear programming methods for finding large inner estimations of general parametric AE-solution sets with linear shape. Numerical examples illustrate the properties of the methods and their application. (C) 2015 Elsevier Inc. All rights reserved.
Keyword:
Linear equations
Dependent interval parameters
Tolerable solution set
AE-solution set
Inner estimation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容