.png){kind=icon}
.png){kind=icon}
Return
Solving interval linear programming problems with equality constraints using extended interval enclosure solutions
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-018-3388-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper focuses on solving systems of interval linear equations and interval linear programming in a computationally efficient way. Since the computational complexity of most interval enclosure numerical methods is often prohibitive, a procedure to obtain a relaxation of the interval enclosure solution that is computationally tractable is proposed. We show that our approach unifies the four standard interval solutions-the weak, strong, control and tolerance solutions. The interval linear system methods require n2n linear solutions. However, in the case of linear programming problems, we show that this requires just two optimization problem of the size of the problem itself. Numerical examples illustrate our results.
Keywords:
Interval linear system
Interval linear programming
Constraint intervals
Extended interval enclosure solutions
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
