Finding All Possibly Efficient Solutions of an Interval Multiple Objective Linear Programming Problem
Discuss this preprint
Start a discussion What are Sciety discussions?Listed in
This article is not in any list yet, why not save it to one of your lists.Abstract
Finding all possibly efficient solutions of an interval multiple objective linear programming (IMOLP) problem with interval coefficients in the objective functions, the constraint matrix and the right-hand side vector is dealt with. Up to now, there are no known methods that can find all possibly efficient solutions of an IMOLP problem with interval coefficients in the objective functions and the right-hand side vector. In this paper, we propose a method to find all possibly efficient solutions of an IMOLP problem with interval coefficients in the objective functions and the right-hand side vector. Some sufficient conditions to obtain all possibly efficient solutions of an IMOLP problem in a general case are also given.