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...

We consider multiple objective combinatorial optimization problems in which the first objective is of arbitrary type and the remaining objectives are either bottleneck or k-max objective functions. While the objective value of a bottleneck objective is determined by the largest cost value of any element in a feasible solution, the k-largest element defines the objective value of the k-max objec...

in this paper, the finitely many constraints of a fuzzy relationinequalities problem are studied and the linear objective function on the regiondefined by a fuzzy max-average operator is optimized. a new simplificationtechnique which accelerates the resolution of the problem by removing thecomponents having no effect on the solution process is given together with analgorithm and a numerical exa...