Pages that link to "Item:Q1794864"

The following pages link to Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem (Q1794864):

Displaying 15 items.

• Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients (Q301052) (← links)
• Complexity of necessary efficiency in interval linear programming and multiobjective linear programming (Q1758029) (← links)
• On highly robust efficient solutions to uncertain multiobjective linear programs (Q1991250) (← links)
• The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems (Q2030735) (← links)
• Generation of some methods for solving interval multi-objective linear programming models (Q2150482) (← links)
• Multi-objective enhanced interval optimization problem (Q2150768) (← links)
• Multiobjective interval linear programming in admissible-order vector space (Q2215103) (← links)
• Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach (Q2239941) (← links)
• New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach (Q2286943) (← links)
• Finding efficient solutions in the interval multi-objective linear programming models (Q3388946) (← links)
• (Q5858202) (← links)
• Quasi-Newton algorithms for solving interval-valued multiobjective optimization problems by using their certain equivalence (Q6056223) (← links)
• A survey of interval algorithms for solving multicriteria analysis problems (Q6135498) (← links)
• Various approaches to multiobjective linear programming problems with interval costs and interval weights (Q6166935) (← links)
• Finding efficient solutions in interval multi-objective linear programming models by uncertainty theory (Q6641996) (← links)