A computationally efficient algorithm for determination of efficient max-ordering optimal solutions in multiple objective programming

In this paper a new algorithm is proposed to determine efficient max-ordering optimal solutions in multiple objective programming (MOP). In fact, the max-ordering optimal solution is not necessarily efficient, and could be weakly efficient. In this paper a new algorithm is proposed which is capable to overcome this problem, and has computational advantages as compared to the customary method.