Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients

DOI10.1007/s10100-012-0252-9zbMath1339.90308OpenAlexW2019648504MaRDI QIDQ301052

M. A. Yaghoobi, Sanaz Rivaz

Publication date: 29 June 2016

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-012-0252-9

zbMATH Keywords

efficiencymultiobjective linear programminginterval programmingminimax regret criterion

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items (19)

Robustness-based approach for fuzzy multi-objective problems ⋮ Robust optimal solutions in interval linear programming with forall-exists quantifiers ⋮ Generation of some methods for solving interval multi-objective linear programming models ⋮ Multi-objective enhanced interval optimization problem ⋮ Unnamed Item ⋮ Robust optimality analysis of non-degenerate basic feasible solutions in linear programming problems with fuzzy objective coefficients ⋮ An ensemble framework for assessing solutions of interval programming problems ⋮ Various approaches to multiobjective linear programming problems with interval costs and interval weights ⋮ Compromising solution of geometric programming problem with bounded parameters ⋮ Multiobjective interval linear programming in admissible-order vector space ⋮ Unnamed Item ⋮ Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach ⋮ \(E\)-differentiable minimax programming under \(E\)-convexity ⋮ New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach ⋮ Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem ⋮ Finding efficient solutions in the interval multi-objective linear programming models ⋮ A New Interval Multi-Objective Optimization Method for Uncertain Problems with Dependent Interval Variables ⋮ Some results in interval multiobjective linear programming for recognizing different solutions ⋮ Multi-objective interval fractional programming problems: an approach for obtaining efficient solutions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
• Goal programming problems with interval coefficients and target intervals
• An interactive method of tackling uncertainty in interval multiple objective linear programming
• Multiple objective linear programming models with interval coefficients -- an illustrated overview
• Minimax regret solution to linear programming problems with an interval objective function
• Portfolio selection problem with interval coefficients
• Solutions for the portfolio selection problem with interval and fuzzy coefficients
• Multiobjective transportation problem with interval cost, source and destination parameters
• Minimax regret strategies for greenhouse gas abatement: Methodology and application
• The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
• An interval portfolio selection problem based on regret function
• A mathematical basis for satisficing decision making
• Necessary conditions for min-max problems and algorithms by a relaxation procedure
• Linear Multiple Objective Problems with Interval Coefficients
• An Interactive Method To Multiobjective Linear Programming Problems With Interval Coefficients
• Multicriteria Optimization
• Nonlinear Programming
• Linear Optimization Problems with Inexact Data
• The Theory of Statistical Decision

This page was built for publication: Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients