Checking bounds on solutions of linear interval equations is NP-hard (Q1894514)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Checking bounds on solutions of linear interval equations is NP-hard |
scientific article; zbMATH DE number 778275
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Checking bounds on solutions of linear interval equations is NP-hard |
scientific article; zbMATH DE number 778275 |
Statements
Checking bounds on solutions of linear interval equations is NP-hard (English)
0 references
6 September 1995
0 references
This paper is concerned with the solution of systems of linear interval equations. The author considers the problem to check whether the solution set of such a system is contained in a given interval vector. The main result that this problem is NP-hard even for a very restricted class of systems with strongly regular interval matrices is proved.
0 references
checking bounds on solutions
0 references
interval mathematics
0 references
systems of linear interval equations
0 references
NP-hard
0 references
interval matrices
0 references
0 references
