Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10329240" target="_blank" >RIV/00216208:11320/16:10329240 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/s10700-015-9226-4" target="_blank" >http://dx.doi.org/10.1007/s10700-015-9226-4</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10700-015-9226-4" target="_blank" >10.1007/s10700-015-9226-4</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem

Popis výsledku v původním jazyce

The current research concerns multiobjective linear programming problems with interval objective functions coefficients. It is known that the most credible solutions to these problems are necessarily efficient ones. To solve the problems, this paper attempts to propose a new model with interesting properties by considering the minimax regret criterion. The most important property of the new model is attaining a necessarily efficient solution as an optimal one whenever the set of necessarily efficient solutions is nonempty. In order to obtain an optimal solution of the new model, an algorithm is suggested. To show the performance of the proposed algorithm, numerical examples are given. Finally, some special cases are considered and their characteristic features are highlighted.

Název v anglickém jazyce

Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem

Popis výsledku anglicky

The current research concerns multiobjective linear programming problems with interval objective functions coefficients. It is known that the most credible solutions to these problems are necessarily efficient ones. To solve the problems, this paper attempts to propose a new model with interesting properties by considering the minimax regret criterion. The most important property of the new model is attaining a necessarily efficient solution as an optimal one whenever the set of necessarily efficient solutions is nonempty. In order to obtain an optimal solution of the new model, an algorithm is suggested. To show the performance of the proposed algorithm, numerical examples are given. Finally, some special cases are considered and their characteristic features are highlighted.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

<a href="/cs/project/GA13-10660S" target="_blank" >GA13-10660S: Intervalové metody pro optimalizační úlohy</a><br>

Návaznosti

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

Rok uplatnění

2016

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 periodika

Fuzzy Optimization and Decision Making

ISSN

1568-4539

e-ISSN

—

Svazek periodika

15

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

17

Strana od-do

237-253

Kód UT WoS článku

000387582700001

EID výsledku v databázi Scopus

2-s2.0-84946103065