Duality Gap in Interval Linear Programming

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10415142" target="_blank" >RIV/00216208:11320/20:10415142 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=XK8Oov~CXx" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=XK8Oov~CXx</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10957-019-01610-y" target="_blank" >10.1007/s10957-019-01610-y</a>

Result language
angličtina
Original language name
Duality Gap in Interval Linear Programming
Original language description
This paper deals with the problem of linear programming with inexact data represented by real intervals. We introduce the concept of duality gap to interval linear programming. We give characterizations of strongly and weakly zero duality gap in interval linear programming and its special case where the matrix of coefficients is real. We show computational complexity of testing weakly- and strongly zero duality gap for commonly used types of interval linear programming.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
50201 - Economic Theory

Project
<a href="/en/project/GA18-04735S" target="_blank" >GA18-04735S: Novel approaches for relaxation and approximation techniques in deterministic global optimization</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)