In [5] an evolutionary algorithm for detecting continuous Pareto optimal sets has been proposed. In this paper we propose a new evolutionary elitist approach combing a non-standard solution representation and an evolutionary optimization technique. The proposed method permits detection of continuous decision regions. In our approach an individual (a solution) is either a closed interval or a po...

Borrowing concepts from linear algebra and convex analysis, it has been shown how the feasible set for a general vector optimization problem can be mapped under a linear transformation so that Pareto points in the image correspond to nondominated solutions for the original problem. The focus of this paper is to establish corresponding results for approximate nondominated points, based on a new ...

We consider the problem of constructing a portfolio of finitely many assets whose returns are described by a discrete joint distribution. We propose mean–risk models which are solvable by linear programming and generate portfolios whose returns are nondominated in the sense of second-order stochastic dominance. Next, we develop a specialized parametric method for recovering the entire mean–risk...

Nondominated sorting is a combinatorial algorithm that sorts points in Euclidean space into layers according to a partial order. It was recently shown that nondominated sorting of random points has a Hamilton-Jacobi equation continuum limit. The original proof, given in [1], relies on a continuum variational problem. In this paper, we give a new proof using a direct verification argument that c...

We consider a nondominated model of a discrete-time financial market where stocks are traded dynamically and options are available for static hedging. In a general measure-theoretic setting, we show that absence of arbitrage in a quasi-sure sense is equivalent to the existence of a suitable family of martingale measures. In the arbitrage-free case, we show that optimal superhedging strategies e...