Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem
Result description
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.
Keywords
Necessarily efficient solutionsMinimax regret criterionInterval programmingMultiobjective linear programming
The result's identifiers
Result code in IS VaVaI
Result on the web
DOI - Digital Object Identifier
Alternative languages
Result language
angličtina
Original language name
Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2016
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
Name of the periodical
Fuzzy Optimization and Decision Making
ISSN
1568-4539
e-ISSN
—
Volume of the periodical
15
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
17
Pages from-to
237-253
UT code for WoS article
000387582700001
EID of the result in the Scopus database
2-s2.0-84946103065
Basic information
Result type
Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP
BB - Applied statistics, operational research
Year of implementation
2016