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

摘要

The current paper focuses on a multiobjective linear programming problem with interval objective functions coefficients. Taking into account the minimax regret criterion, an attempt is being made to propose a new solution i.e. minimax regret solution. With respect to its properties, a minimax regret solution is necessarily ideal when a necessarily ideal solution exists; otherwise it is still considered a possibly weak efficient solution. In order to obtain a minimax regret solution, an algorithm based on a relaxation procedure is suggested. A numerical example demonstrates the validity and strengths of the proposed algorithm. Finally, two special cases are investigated: the minimax regret solution for fixed objective functions coefficients as well as the minimax regret solution with a reference point. Some of the characteristic features of both cases are highlighted thereafter.