Abstract
This thesis presents a modified interior algorithm that is based on an interior multiobjective linear programming algorithm proposed by Arbel. We use Arbel's ideas as a fundamental, and with some modification by adopting the minimum ratio test, the potential push method and normalization, which we make the modified algorithm more effective in solving multiobjective linear programming problems. The approach of the modified interior algorithm has the potential benefit that the search for optimality is less sensitive to problem size due to the solution process does not rely on the number of vertices of the feasible region. From the computational experience, we can conclude that the proposed modified algorithm provides an efficient and accurate way to solve the multiobjective linear programming problems.