On necessary efficient solutions in interval multiobjective linear programming
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10033294" target="_blank" >RIV/00216208:11320/10:10033294 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On necessary efficient solutions in interval multiobjective linear programming
Original language description
We investigate multiobjective linear programming problems with objective coefficients varying inside given intervals. A feasible solution is called necessarily efficient if it is efficient for all realizations of the interval objective function coefficients. Testing necessarily efficiency may be computationally expensive. Thus we propose one sufficient and also one necessary condition for necessarily efficiency that can significantly speed up decision algorithms. These conditions do not require the feasible solution to be non-degenerate. We demonstrate usage of both conditions on illustrative examples and show how strong they are.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
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
Proceedings of the 25th Mini-EURO Conference
ISBN
978-989-95055-3-7
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
INESC Coimbra
Place of publication
Coimbra
Event location
Coimbra
Event date
Apr 15, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—