This paper proposes a new algorithm for the solution of fully fuzzy Multi objective linear programming problems involving triangular fuzzy number without converting them to equivalent classical problems. Based on the fuzzy ideal and fuzzy negative ideal solution of each single fuzzy objective function we propose an algorithm which provides a fuzzy Pareto-optimal solution for the given fully fuz...

Recently, a couple of approaches have been developed that combine multiobjective optimization with direct discretization methods to approximate trajectories of optimal control problems, resulting in restricted optimization problems of high dimension. The solution set of a multiobjective optimization problem is called the Pareto set which consists of optimal compromise solutions. A common way to...

The optimal design of a plate-fin recuperator of a 200-kW microturbine was studied in this paper. The exergy efficiency, pressure drop and total cost were selected as the three important objective functions of the recuperator. Genetic Algorithm (GA) and Non-dominated Sorting Genetic Algorithm (NSGA-II) were respectively employed for single-objective and multi-objective optimizations. By opt...

One of the most common approaches for multiobjective optimization is to generate a solution set that well approximates the whole Pareto-optimal frontier to facilitate the later decision-making process. However, how to evaluate and compare the quality of different solution sets remains challenging. Existing measures typically require additional problem knowledge and information, such as a refere...

In this paper, the average cases of Markov decision processes with uncertainty is considered. That is, a controlled Markov set-chain model with a finite state and action space is developed by an interval arithmetic analysis, and we will find a Pareto optimal policy which maximizes the average expected rewards over all stationary policies under a new partial order. The Pareto optimal policies is...

In multicriteria optimization, a compromise solution is a feasible solution whose cost vector minimizes the distance to the ideal point w.r.t. a given norm. The coordinates of the ideal point are given by the optimal values for the single optimization problem for each criterion. We show that the concept of compromise solutions fits nicely into the existing notion of Pareto optimality: For a hug...

This work presents a new learning scheme for improving generalization of Multilayer Perceptrons (MLPs). The proposed Multi-objective algorithm (MOBJ) approach minimizes both the sum of squared error and the norm of network weight vectors to obtain the Pareto-optimal solutions [1]. Preliminar results are shown in [3]. Since the Pareto-optimal solutions are not unique, we need a decision phase in...