.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Linear equations
Dependent interval parameters
Tolerable solution set
AE-solution set
Inner estimation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave
View more