An interior-point approach for solving MC2 linear programming problems

This paper presents an interior-point method to solve the multiple criteria and multiple constraint level linear programming (MC2LP) problems. This approach utilizes the known interior-point method to multiple criteria linear programming (MCLP) and a convex combination method to generate potential solutions for the MC2LP problems. This method can be used as an alternative to the well-known MC2-simplex method. The numerical comparison study of two methods is provided in the paper.