General method for solving multi-objective de novo programming problem

Abstract

A general method to solve multi-objective de novo programming problem having both maximizing and minimizing types of objectives has been proposed. The method in one hand provides a platform to get a maximum number of objectives to their targeted ideal (maximum/minimum) values and on the other hand gives the decision-maker flexibility to choose the objectives according to his/her priority towards the attainment of their ideal values. The proposed method has been illustrated with a numerical problem and a real-life example. A comparison with two other existing methods for such problems has also been provided.

Keywords:

• Multiple objective programming
• de novo programming
• multi-objective optimization
• ideal values
• row echelon form

Disclosure statement

No potential conflict of interest was reported by the author(s).