All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 200

Showing per page

Interactive compromise hypersphere method and its applications

Sebastian Sitarz (2012)

RAIRO - Operations Research

The paper focuses on multi-criteria problems. It presents the interactive compromise hypersphere method with sensitivity analysis as a decision tool in multi-objective programming problems. The method is based on finding a hypersphere (in the criteria space) which is closest to the set of chosen nondominated solutions. The proposed modifications of the compromise hypersphere method are based on using various metrics and analyzing their influence on the original method. Applications of the proposed...

LFS functions in multi-objective programming

Luka Neralić, Sanjo Zlobec (1996)

Applications of Mathematics

We find conditions, in multi-objective convex programming with nonsmooth functions, when the sets of efficient (Pareto) and properly efficient solutions coincide. This occurs, in particular, when all functions have locally flat surfaces (LFS). In the absence of the LFS property the two sets are generally different and the characterizations of efficient solutions assume an asymptotic form for problems with three or more variables. The results are applied to a problem in highway construction, where...

Linear optimization with multiple equitable criteria

Michael M. Kostreva, Wodzimierz Ogryczak (2010)

RAIRO - Operations Research

The standard multiple criteria optimization starts with an assumption that the criteria are incomparable. However, there are many applications in which the criteria express ideas of allocation of resources meant to achieve some equitable distribution. This paper focuses on solving linear multiple criteria optimization problems with uniform criteria treated in an equitable way. An axiomatic definition of equitable efficiency is introduced as an refinement of Pareto-optimality. Various generation...

Locally Lipschitz vector optimization with inequality and equality constraints

Ivan Ginchev, Angelo Guerraggio, Matteo Rocca (2010)

Applications of Mathematics

The present paper studies the following constrained vector optimization problem: min C f ( x ) , g ( x ) ∈ - K , h ( x ) = 0 , where f : ℝ n → ℝ m , g : ℝ n → ℝ p are locally Lipschitz functions, h : ℝ n → ℝ q is C 1 function, and C ⊂ ℝ m and K ⊂ ℝ p are closed convex cones. Two types of solutions are important for the consideration, namely w -minimizers (weakly efficient points) and i -minimizers (isolated minimizers of order 1). In terms of the Dini directional derivative first-order necessary conditions for a point x 0 to be a w -minimizer and first-order sufficient conditions for x 0 ...

Measuring consistency and inconsistency of pair comparison systems

Jaroslav Ramík, Milan Vlach (2013)

Kybernetika

In this paper we deal with mathematical modeling of real processes that are based on preference relations in the sense that, for every pair of distinct alternatives, the processes are linked to a value of preference degree of one alternative over the other one. The use of preference relations is usual in decision making, psychology, economics, knowledge acquisition techniques for knowledge-based systems, social choice and many other social sciences. For designing useful mathematical models of such...

MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization

Thibaut Lust, Jacques Teghem (2008)

RAIRO - Operations Research

We present in this paper a new multiobjective memetic algorithm scheme called MEMOX. In current multiobjective memetic algorithms, the parents used for recombination are randomly selected. We improve this approach by using a dynamic hypergrid which allows to select a parent located in a region of minimal density. The second parent selected is a solution close, in the objective space, to the first parent. A local search is then applied to the offspring. We experiment this scheme with a new multiobjective...

Multi-attribute evaluation with imprecise vector utility

Sixto Ríos-Insua, Alfonso Mateos (1996)

Revista de la Real Academia de Ciencias Exactas Físicas y Naturales

We consider the multi-attribute decision making problem with incomplete information on the decision maker's preferences, given by an imprecise vector utility function. We introduce an approximation set to the utility efficient set which may be used to aid a decision maker in reaching a final compromise strategy. We provide sorne properties and an interactive procedure based on such approximation set.

Currently displaying 81 – 100 of 200