Radii of Solvability and Unsolvability of Linear Systems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F16%3A00458516" target="_blank" >RIV/67985807:_____/16:00458516 - isvavai.cz</a>
Alternative codes found
RIV/00216208:11320/16:10329230
Result on the web
<a href="http://dx.doi.org/10.1016/j.laa.2016.03.028" target="_blank" >http://dx.doi.org/10.1016/j.laa.2016.03.028</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.laa.2016.03.028" target="_blank" >10.1016/j.laa.2016.03.028</a>

Result language
angličtina
Original language name
Radii of Solvability and Unsolvability of Linear Systems
Original language description
We consider a problem of determining the component-wise distance (called the radius) of a linear system of equations or inequalities to a system that is either solvable or unsolvable. We propose explicit characterization of these radii and show relations between them. Then the radii are classified in the polynomial vs. NP-hard manner. We also present a generalization to an arbitrary linear system consisting from both equations and inequalities with both free and nonnegative variables. Eventually, we extend the concept of the component-wise distance to a non-uniform one.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GA13-10660S" target="_blank" >GA13-10660S: Interval methods for optimization problems</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)