Milan Hladík. Two approaches to inner estimations of the optimal solution set in interval linear programming. In Proceedings of the 2020 4th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence, pp. 99–104, ISMSI 2020, Association for Computing Machinery, New York, USA, 2020.
[PDF] [gzipped postscript] [postscript] [HTML]
We consider a linear programming problem with uncertain input coefficients. The only information we have are lower and upper bounds for the uncertain values. This gives rise to the so called interval linear programming. The challenging problem here is to characterize and determine the set of all possible optimal solutions. Most of the scholars were focus on computing outer bounds for the optimal solution. Herein, we will be interested with computing inner bounds. We propose a local search algorithm and a genetic algorithm. We compare both methods numerically on random data to ascertain what is their real time complexity and quality of inner estimations.
@inProceedings{Hla2020c,
author = "Milan Hlad\'{\i}k",
title = "Two approaches to inner estimations of the optimal solution set in interval linear programming",
editor = "Suash Deb",
booktitle = "Proceedings of the 2020 4th International Conference on Intelligent Systems, Metaheuristics \& Swarm Intelligence",
location = "Thimphu, Bhutan",
series = "ISMSI 2020",
publisher = "Association for Computing Machinery",
address = "New York, USA",
pages = "99-104",
year = "2020",
doi = "10.1145/3396474.3396479",
isbn = "978-1-4503-7761-4",
url = "https://doi.org/10.1145/3396474.3396479",
bib2html_dl_pdf = "https://dl.acm.org/doi/10.1145/3396474.3396479",
abstract = "We consider a linear programming problem with uncertain input coefficients. The only information we have are lower and upper bounds for the uncertain values. This gives rise to the so called interval linear programming. The challenging problem here is to characterize and determine the set of all possible optimal solutions. Most of the scholars were focus on computing outer bounds for the optimal solution. Herein, we will be interested with computing inner bounds. We propose a local search algorithm and a genetic algorithm. We compare both methods numerically on random data to ascertain what is their real time complexity and quality of inner estimations.",
keywords = "Interval computation; Genetic algorithm; Heuristic; Linear programming; Parametric programming",
}
Generated by bib2html.pl (written by Patrick Riley ) on Mon Apr 15, 2024 08:26:42