Paper Info
Title
On the optimal solution set in interval linear programming.
Abstract
Determining the set of all optimal solutions of a linear program with interval data is one of the most challenging problems discussed in interval optimization. In this paper, we study the topological and geometric properties of the optimal set and examine sufficient conditions for its closedness, boundedness, connectedness and convexity. We also prove that testing boundedness is co-NP-hard for inequality-constrained problems with free variables. Furthermore, we prove that computing the exact interval hull of the optimal set is NP-hard for linear programs with an interval right-hand-side vector. We then propose a new decomposition method for approximating the optimal solution set based on complementary slackness and show that the method provides the exact description of the optimal set for problems with a fixed coefficient matrix. Finally, we conduct computational experiments to compare our method with the existing orthant decomposition method.
Year
DOI
Venue
2019
10.1007/s10589-018-0029-8
Comp. Opt. and Appl.
Keywords
Field
DocType
Interval linear programming, Optimal solution set, Decomposition methods, Topological properties
Mathematical optimization,Social connectedness,Convexity,Coefficient matrix,Orthant,Free variables and bound variables,Decomposition method (constraint satisfaction),Solution set,Linear programming,Mathematics
Journal
Volume
Issue
ISSN
72
1
1573-2894
Citations 
PageRank 
References 
0
0.34
11
Authors
2
Name
Order
Citations
PageRank
Elif Garajová131.44
Milan Hladík226836.33