Name
Abstract | ||
|---|---|---|
We consider a linear programming problem with interval data. We discuss the problem of checking whether a given solution is optimal for each realization of interval data. This problem was studied for particular forms of linear programming problems. Herein, we extend the results to a general model and simplify the overall approach. Moreover, we inspect computational complexity, too. Eventually, we investigate a related optimality concept of semi-strong optimality, showing its characterization and complexity. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s11590-016-1088-3 | Optimization Letters |
Keywords | Field | DocType |
Linear programming, Interval analysis, Uncertainty modeling | Linear-fractional programming,Mathematical optimization,Interval linear programming,Linear programming,Basic solution,Interval arithmetic,Uncertainty modeling,Interval data,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
11 | 7 | 1862-4480 |
Citations | PageRank | References |
2 | 0.37 | 10 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Milan Hladík | 1 | 268 | 36.33 |