New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach

DOI10.1016/j.ejor.2019.11.009zbMath1431.90143OpenAlexW2996707679WikidataQ126530943 ScholiaQ126530943MaRDI QIDQ2286943

Yanyan Li

Publication date: 23 January 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.11.009

zbMATH Keywords

sensitivity analysistolerance approachnecessarily efficient solutionsmultiobjective interval linear programmingpossibly efficient solutions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items (4)

Assessing the performance of exchange traded funds in the energy sector: a hybrid DEA multiobjective linear programming approach ⋮ A novel approach for exploring the trade‐offs between several features of students’ well‐being ⋮ Robust optimality analysis of non-degenerate basic feasible solutions in linear programming problems with fuzzy objective coefficients ⋮ Various approaches to multiobjective linear programming problems with interval costs and interval weights

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results in interval multiobjective linear programming for recognizing different solutions
• Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients
• An enumerative algorithm for computing all possibly optimal solutions to an interval LP
• Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
• Multiple objective linear programming models with interval coefficients -- an illustrated overview
• A preview of a tolerance approach to sensitivity analysis in linear programming
• Minimax regret solution to linear programming problems with an interval objective function
• A global tolerance approach to sensitivity analysis in linear programming
• Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
• Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem
• Efficient solution generation for multiple objective linear programming based on extreme ray generation method
• Possible and necessary optimality tests in possibilistic linear programming problems
• A fresh view on the tolerance approach to sensitivity analysis in linear programming
• Tolerance analysis in linear systems and linear programming
• Tolerance Sensitivity and Optimality Bounds in Linear Programming
• Minimising the maximum relative regret for linear programmes with interval objective function coefficients
• Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis
• Computing the tolerances in multiobjective linear programming
• The Tolerance Approach to Sensitivity Analysis in Linear Programming
• Linear Multiple Objective Problems with Interval Coefficients
• Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
• An achievement rate approach to linear programming problems with an interval objective function
• Weighted sum of maximum regrets in an interval MOLP problem

This page was built for publication: New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach