Multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. The optimality of such optimizations is largely defined through the Pareto optimality. Multiple objective integer linear programs (MOILP) are special cases of multiple criteria decision making problems. Numerous algorithms have been desig...

this paper uses the weighted l$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. when all variables are integer it finds the whole set of efficient solutions. in each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

The problem for selection of appropriate assets investing composition projects such as assets rationalization plays an important role in promotion of business systems. We consider the assets investing composition plan problems subject to grey multi objective programming with the grey inequality constraints. In this paper, we show in detail the entire process of the application from modeling the...

A characteristic of data envelopment analysis (DEA) is to allow individual decision making units (DMUs) to select the most advantageous weights in calculating their efficiency scores. This flexibility, on the other hand, deters the comparison among DMUs on a common base. For dealing with this difficulty and assessing all the DMUs on the same scale, this paper proposes using a multiple objective...

this paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. for solving this multi-objective model, we develop a fuzzy multi-objective linear programming (fmolp) model. in this problem, a proposed fmolp method is applied with respect to the o...

In this study, we introduce new generalizations of higher-order type-I functions and pseudo-convexity functions. The application the notion sublinear functionals to these is crucial our main findings. Furthermore, under functions, established studied six types duality models programs for multiple objective nonlinear programming problems. addition, use formulate prove theorems weak duality, stro...