A New Approach to Solve Multiple Objective Programming Probleams

Multiple objective programming (mop) problems have becomefamou s among many researchers due to more practical and realisticimplementations. there have been a lot of methods proposedespecially during the past four decades. in this paper, we develop anew algorithm based on a new approach to solve mop problems bystarting from a utopian point (which is usually infeasible) and movingtowards the feas ible region via stepwise movements and a plaincontinuous interaction with decision maker (dm). we consider thecase where all objective functions and constraints are linear. theimplementation of the proposed algorithm is demonstrated with twonumerical examples.