Full Text: PDF
Received November 19, 2021; Accepted January 18, 2022; Published February 28, 2022
Abstract. In this paper, we propose a new efficient approach for solving some special types of integer linear programming problems, frequently appearing in practical applications. Such problems require an integer solution and therefore, in most cases, the computations rely on integer and mixed-integer linear programming solvers. In general, these solvers can not handle large scaled problems. To avoid this difficulty, many researchers applied some heuristic-based approaches or introduced a clustering structure to reduce the size of the problem. We demonstrate that there exists a large class of practical applications, in particular, disaster management and resource location-allocation problems whose exact solutions can be obtained by applying the simplex method (linear programming) without relying on integer solvers. This approach has several advantages. First of all, any modern optimisation solvers can handle large-scaled linear programming problems. Second, the optimal solutions are the solutions to the original problems without any artificial constructions.
How to Cite this Article:
B. Bodaghi, N. Sukhorukova, Solving resource allocation problems in disaster management using linear programming relaxations, Commun. Optim. Theory 2022 (2022) 1.