On approximation of the best case optimal value in interval linear programming

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10282487" target="_blank" >RIV/00216208:11320/14:10282487 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s11590-013-0715-5" target="_blank" >http://dx.doi.org/10.1007/s11590-013-0715-5</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11590-013-0715-5" target="_blank" >10.1007/s11590-013-0715-5</a>

Result language
angličtina
Original language name
On approximation of the best case optimal value in interval linear programming
Original language description
Interval linear programming addresses problems with uncertain coefficients and the only information that we have is that the true values lie somewhere in the prescribed intervals. For the inequality constraint problem, computing the worst case scenario and the corresponding optimal value is an easy task, but the best case optimal value calculation is known to be NP-hard. In this paper, we discuss lower and upper bound approximation for the best case optimal value, and propose suitable methods for both of them. We also propose a not apriori exponential algorithm for computing the best case optimal value. The presented techniques are tested by randomly generated data, and also applied in a simple data classification problem.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—

Project
<a href="/en/project/GA13-10660S" target="_blank" >GA13-10660S: Interval methods for optimization problems</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)