A multiobjective based approach for mathematical programs with linear flexible constraints

In this paper a mathematical problem with linear flexible constraints is considered. In order to solve the problem an approach is proposed based on multiobjective linear programming. Indeed, allowing violations for the constraints, and using multiobjective linear programming to minimize these violations, a subset of solution set which has less violations, namely efficiently feasible set, is obtained. Then, the corresponding objective function is optimized over efficiently feasible set in order to obtain an optimal solution. An application of the proposed approach in pattern classification is introduced.