Inside the Box: 0-1 Linear Programming Under Interval Uncertainty

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10509912" target="_blank" >RIV/00216208:11320/25:10509912 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-031-81241-5_24" target="_blank" >https://doi.org/10.1007/978-3-031-81241-5_24</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-031-81241-5_24" target="_blank" >10.1007/978-3-031-81241-5_24</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Inside the Box: 0-1 Linear Programming Under Interval Uncertainty

Popis výsledku v původním jazyce

Many practical optimization problems require models that are able to reflect uncertainty or inexactness inherently present in the data. Interval linear programming provides a model for handling uncertain optimization problems, in which one assumes that only lower and upper bounds on the input data are available and the data can be independently perturbed within the intervals determined by the given bounds. Apart from the linear programming models with continuous variables, which have been explored by various authors, intervals also often arise in discrete optimization problems. We adopt the model of integer linear programming with binary variables, in which the constraint matrix, objective vector and right-hand-side vector are affected by interval uncertainty. For this model, only a few works investigating its properties can be found in the literature. In this paper, we discuss the main concepts of feasibility and optimality in the model and discuss their properties. Namely, we address the problem of computing the set and the range of optimal values and characterizing weak optimality of solutions. (C) The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

Název v anglickém jazyce

Inside the Box: 0-1 Linear Programming Under Interval Uncertainty

Popis výsledku anglicky

Many practical optimization problems require models that are able to reflect uncertainty or inexactness inherently present in the data. Interval linear programming provides a model for handling uncertain optimization problems, in which one assumes that only lower and upper bounds on the input data are available and the data can be independently perturbed within the intervals determined by the given bounds. Apart from the linear programming models with continuous variables, which have been explored by various authors, intervals also often arise in discrete optimization problems. We adopt the model of integer linear programming with binary variables, in which the constraint matrix, objective vector and right-hand-side vector are affected by interval uncertainty. For this model, only a few works investigating its properties can be found in the literature. In this paper, we discuss the main concepts of feasibility and optimality in the model and discuss their properties. Namely, we address the problem of computing the set and the range of optimal values and characterizing weak optimality of solutions. (C) The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA22-11117S" target="_blank" >GA22-11117S: Globální analýza citlivosti a stabilita v optimalizačních úlohách</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ISBN

978-3-031-81241-5

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

8

Strana od-do

312-319

Název nakladatele

Springer Science and Business Media Deutschland GmbH

Místo vydání

Cham

Místo konání akce

Pizzo Calabro

Datum konání akce

14. 6. 2023

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—