Solving methods for interval linear programming problem: a review and an improved method

Interval linear programming is used for tackling interval uncertainties in real-world systems. An arbitrary point is a feasible point to the interval linear programming model if it lies in the largest feasible region of the interval linear programming model, and it is optimal if it is an optimal sol...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operational research Ročník 20; číslo 3; s. 1205 - 1229
Hlavní autoři: Mishmast Nehi, H., Ashayerinasab, H. A., Allahdadi, M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2020
Springer Nature B.V
Témata:
Business and Management
Computational Intelligence
Linear programming
Management Science
Mathematical models
Mathematical programming
Methods
Operations Research
Operations Research/Decision Theory
Original Paper
Solution space
Optimal solution set
Feasibility
Stability
Interval linear programming
Optimality
ISSN:1109-2858, 1866-1505
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Interval linear programming is used for tackling interval uncertainties in real-world systems. An arbitrary point is a feasible point to the interval linear programming model if it lies in the largest feasible region of the interval linear programming model, and it is optimal if it is an optimal solution to a characteristic model. The optimal solution set to the interval linear programming is the union of all solutions that are optimal for a characteristic model. In this paper, we review some existing methods for solving interval linear programming problems. Using these methods the interval linear programming model is transformed into two sub-models. The optimal solutions of these sub-models form the solution space of these solving methods. A part of the solution space of some of these methods may be infeasible. To eliminate the infeasible part of the solution space of above methods, several methods have been proposed. The solution space of these modified methods may contain non-optimal solutions. Two improvement methods have been proposed to remove the non-optimal solutions of the solution space of above modified methods. Finally, we introduce an improved method and its sub-models. The solution space of our method is absolutely both feasible and optimal.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1109-2858
1866-1505
DOI:10.1007/s12351-018-0383-4