A Quasi-extreme Reduction for Interval Transportation Problems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10493551" target="_blank" >RIV/00216208:11320/24:10493551 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/978-3-031-50320-7_6" target="_blank" >https://doi.org/10.1007/978-3-031-50320-7_6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-031-50320-7_6" target="_blank" >10.1007/978-3-031-50320-7_6</a>
Alternative languages
Result language
angličtina
Original language name
A Quasi-extreme Reduction for Interval Transportation Problems
Original language description
Transportation problems provide a classic linear programming model used in many areas of operations research, such as inventory control, logistics or supply chain management. The goal of a transportation problem is to find a minimum-cost transportation plan for shipping a given commodity from a set of sources to a set of destinations. Since the input data of such models are not always known exactly in practice, we adopt the approach of interval programming, which handles uncertainty in the supply, demand and cost parameters by assuming that only lower and upper bounds on these quantities are given. One of the main tasks in interval programming is to compute bounds on the values that are optimal for some realization of the interval coefficients. While the best optimal value of an interval transportation problem can be computed by a single linear program, finding the worst (finite) optimal value is a much more challenging task. For interval transportation problems that are immune against the "more-for-less" paradox, it was recently proved that the worst optimal value can be found by considering only quasi-extreme scenarios, in which all coefficients in the model but one are set to the lower or upper bounds. We strengthen the former result and show that an analogous property also holds true for general interval transportation problems. Then, we utilize the obtained characterization to derive an exact method for computing the worst optimal value.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Lecture Notes in Computer Science
ISBN
978-3-031-50319-1
ISSN
0302-9743
e-ISSN
1611-3349
Number of pages
10
Pages from-to
83-92
Publisher name
Springer Internat. Publ.
Place of publication
Cham
Event location
Praha
Event date
Sep 3, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—