Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem
type: Item
instance of: scholarly article
title: Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem
zbMATH Open document ID: 1397.90352
author: Sanaz Rivaz
author: M. A. Yaghoobi
author: Milan Hladík
published in: Fuzzy Optimization and Decision Making
publication date: 2018-10-16T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6955029
zbMATH Keywords: multiobjective linear programming
zbMATH Keywords: interval programming
zbMATH Keywords: minimax regret criterion
zbMATH Keywords: necessarily efficient solutions
MaRDI profile type: Publication
full work available at URL: s10700-015-9226-4
OpenAlex ID: W2234227697
cites work: Q3182207
cites work: Linear Multiple Objective Problems with Interval Coefficients
cites work: Multicriteria Optimization
cites work: Primal-dual simplex method for multiobjective linear programming
cites work: Linear semi-infinite programming theory: an updated survey
cites work: Computing the tolerances in multiobjective linear programming
cites work: Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
cites work: Weak and strong solvability of interval linear systems of equations and inequalities
cites work: How to determine basis stability in interval linear programming
cites work: Goal programming problems with interval coefficients and target intervals
cites work: Minimax regret solution to linear programming problems with an interval objective function
cites work: Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
cites work: Multiobjective programming in optimization of the interval objective function
cites work: Semi-infinite programming
cites work: Minimax regret strategies for greenhouse gas abatement: Methodology and application
cites work: Introduction to Interval Analysis
cites work: Multiple objective linear programming models with interval coefficients -- an illustrated overview
cites work: An interactive method of tackling uncertainty in interval multiple objective linear programming
cites work: Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients
cites work: An Interactive Method To Multiobjective Linear Programming Problems With Interval Coefficients
cites work: The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
DOI: 10.1007/S10700-015-9226-4
description: scientific article; zbMATH DE number 6955029