Weighted sum of maximum regrets in an interval MOLP problem

DOI10.1111/ITOR.12216MaRDI QIDQ4624890zbMATH OpenOpenAlexFDO

Authors M. A. Yaghoobi, Sanaz Rivaz

Publication date 20 February 2019

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.12216

zbMATH Keywords

interval programminglinear programmingmultiple objective programminguncertainty modeling

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Recommendations

• Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients
• Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem
• scientific article; zbMATH DE number 721836
• Minimax regret solution to linear programming problems with an interval objective function
• A heuristic to minimax absolute regret for linear programs with interval objective function coefficients

Cited in

(12)

• Minimax regret solution to linear programming problems with an interval objective function
• Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem
• The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems
• Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach
• New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach
• Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients
• Finding efficient solutions in the interval multi-objective linear programming models
• scientific article; zbMATH DE number 721836 (Why is no real title available?)
• Using necessarily weak efficient solutions for solving a biobjective transportation problem with fuzzy objective functions coefficients
• Various approaches to multiobjective linear programming problems with interval costs and interval weights
• Finding efficient solutions in interval multi-objective linear programming models by uncertainty theory
• A method to find all efficient solutions of an interval multiple objective linear programming problem

This page was built for publication: Weighted sum of maximum regrets in an interval MOLP problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4624890)