In the current work, we have formulated the optimal bit-allocation problem for a scalable codec of images or videos as a constrained vector-valued optimization problem and demonstrated that there can be many optimal solutions, called Pareto optimal points. In practice, the Pareto points are derived via the weighted sum scalarization approach. An important question which arises is whether all th...

The massive scale and variability of microarray gene data creates new and challenging problems of signal extraction, gene clustering, and data mining, especially for temporal gene profiles. Many data mining methods for finding interesting gene expression patterns are based on thresholding single discriminants, e.g. the ratio of between-class to within-class variation or correlation to a templat...

Self-optimization enables technical systems to adapt their behavior to varying environmental conditions and changing system settings. Objective functions serve as evaluation criteria for the system behavior. In this paper we propose a hierarchical control approach of an objective-based Pareto controller. We separate the processes of optimization and control. First, we use multiobjective optimiz...

Most methods for finding interesting gene expression profiles from gene microarray data are based on a single discriminant, e.g. the classical paired t-test. Here a different approach is introduced based on gene ranking according to Pareto depth in multiple discriminants. The novelty of our approach, which is an extension of our previous work on Pareto front analysis (PFA), is that a gene’s rel...

In this paper, lift and drag coefficients were numerically investigated using NUMECA software in a set of 4-digit NACA airfoils. Two metamodels based on the evolved group method of data handling (GMDH) type neural networks were then obtained for modeling both lift coefficient (CL) and drag coefficient (CD) with respect to the geometrical design parameters. After using such obtained polynomial n...

The multi-objective multi-armed bandit (MOMAB) problem is a sequential decision process with stochastic rewards. Each arm generates a vector of rewards instead of a single scalar reward. Moreover, these multiple rewards might be conflicting. The MOMAB-problem has a set of Pareto optimal arms and an agent’s goal is not only to find that set but also to play evenly or fairly the arms in that set....

An effective approach to decision support in multicriteria decision making (MCDM) problems characterized by three to eight decision criteria is described. The approach is based on approximating the feasible set in the criterion space (or a broader criterion set, which has the same Pareto frontier) and visualization of the Pareto frontier by interactive displaying bi-criterion slices of this set...

This paper presents a new multiobjective evolutionary algorithm for Environmental/Economic power Dispatch (EED) problem. The EED problem is formulated as a nonlinear constrained multiobjective optimization problem. A new Strength Pareto Evolutionary Algorithm (SPEA) based approach is proposed to handle the problem as a true multiobjective problem with competing and non-commensurable objectives....

Design of control systems is characterised by many targets, therefore the methods enabling optimisation of several objectives have received more and more attention over the past years. When dealing with multi-objective optimisation problems the notion of the scalar function optimality was extended. The most common approach was originally proposed in 19th century by Edgeworth and later generalis...