NAUTILUS method: An interactive technique in multiobjective optimization based on the nadir point

Most interactive methods developed for solving multiobjective optimization problems sequentially generate Pareto optimal or nondominated vectors and the decision maker must always allow impairment in at least one objective function to get a new solution. The NAUTILUS method proposed is based on the assumptions that past experiences affect decision makers’ hopes and that people do not react symmetrically to gains and losses. Therefore, some decision makers may prefer to start from the worst possible objective values and to improve every objective step by step according to their preferences. In NAUTILUS, starting from the nadir point, a solution is obtained at each iteration which dominates the previous one. Although only the last solution will be Pareto optimal, the decision maker never looses sight of the Pareto optimal set, and the search is oriented so that (s)he progressively focusses on the preferred part of the Pareto optimal set. Each new solution is obtained by minimizing an achievement scalarizing function including preferences about desired improvements in objective function values. NAUTILUS is specially suitable for avoiding undesired anchoring effects, for example in negotiation support problems, or just as a means of finding an initial Pareto optimal solution for any interactive procedure. An illustrative example demonstrates how this new method iterates.     

On adjunctions between Lim, SL-Top, and SL-Lim

Consider (L,*,1) be a commutative, strictly two-sided quantale with the underlying lattice L being meet-continuous. Two adjunctions, one is between limit spaces and stratified L-limit spaces and the other is between stratified L-limit spaces and stratified L-topological spaces, are established. The first adjunction can be viewed as an extension of Lowen's adjunction between the category of topological spaces and stratified [0,1]-topological spaces. The second is an extension of an adjunction between limit spaces and (stratified) L-topological spaces established in U. Höhle and T. Kubiak (Höhle-Kubiak, Semigroup Forum (2007)).     

On the projectors FF and FF

A particular version of the singular value decomposition is exploited for an extensive analysis of two orthogonal projectors, namely FF^† and F^†F, determined by a complex square matrix F and its Moore-Penrose inverse F^†. Various functions of the projectors are considered from the point of view of their nonsingularity, idempotency, nilpotency, or their relation to the known classes of matrices, such as EP, bi-EP, GP, DR, or SR. This part of the paper was inspired by Benítez and Rako?evi? [J. Benítez, V. Rako?evi?, Matrices A such that AA^† − A^†A are nonsingular, Appl. Math. Comput. 217 (2010) 3493-3503]. Further characteristics of FF^† and F^†F, with a particular attention paid on the results dealing with column and null spaces of the functions and their eigenvalues, are derived as well. Besides establishing selected exemplary results dealing with FF^† and F^†F, the paper develops a general approach whose applicability extends far beyond the characteristics provided therein.     

Eliciting Electre Tri category limits for a group of decision makers

Multiple criteria sorting aims at assigning alternatives evaluated on several criteria to predefined ordered categories. In this paper, we consider a well known multiple criteria sorting method, Electre Tri, which involves three types of preference parameters: (1) category limits defining the frontiers between consecutive categories, (2) weights and majority level specifying which coalitions form a majority, and (3) veto thresholds characterizing discordance effects. We propose an elicitation procedure to infer category limits from assignment examples provided by multiple decision makers. The procedure computes a set of category limits and vetoes common to all decision makers, with variable weights for each decision maker. Hence, the method helps reaching a consensus among decision makers on the category limits and veto thresholds, whereas finding a consensus on weights is left aside. The inference procedure is based on mixed integer linear programming and performs well even for datasets corresponding to real-world decision problems. We provide an illustrative example of the use of the method and analyze the performance of the proposed algorithms.     

Gradient based and least squares based iterative algorithms for matrix equations AXB + CXD = F

This paper develops a gradient based and a least squares based iterative algorithms for solving matrix equation AXB + CX^TD = F. The basic idea is to decompose the matrix equation (system) under consideration into two subsystems by applying the hierarchical identification principle and to derive the iterative algorithms by extending the iterative methods for solving Ax = b and AXB = F. The analysis shows that when the matrix equation has a unique solution (under the sense of least squares), the iterative solution converges to the exact solution for any initial values. A numerical example verifies the proposed theorems.     

Exponentiation in V-categories

For a Heyting algebra V which, as a category, is monoidal closed, we obtain characterizations of exponentiable objects and morphisms in the category of V-categories and apply them to some well-known examples. In the case these characterizations of exponentiable morphisms and objects in the categories (P)Met of (pre)metric spaces and non-expansive maps show in particular that exponentiable metric spaces are exactly the almost convex metric spaces, while exponentiable complete metric spaces are the complete totally convex ones.     

ISTMO: An interval reference point-based method for stochastic multiobjective programming problems

In this paper, we present an interactive algorithm (ISTMO) for stochastic multiobjective problems with continuous random variables. This method combines the concept of probability efficiency for stochastic problems with the reference point philosophy for deterministic multiobjective problems. The decision maker expresses her/his references by dividing the variation range of each objective into intervals, and by setting the desired probability for each objective to achieve values belonging to each interval. These intervals may also be redefined during the process. This interactive procedure helps the decision maker to understand the stochastic nature of the problem, to discover the risk level (s)he is willing to assume for each objective, and to learn about the trade-offs among the objectives.     

Squarefree P-modules and the cd-index

In this paper, we introduce a new algebraic concept, which we call squarefree P-modules. This concept is inspired from Karu's proof of the non-negativity of the cd-indices of Gorenstein* posets, and supplies a way to study cd-indices from the viewpoint of commutative algebra. Indeed, by using the theory of squarefree P-modules, we give several new algebraic and combinatorial results on CW-posets. First, we define an analogue of the cd-index for any CW-poset and prove its non-negativity when a CW-poset is Cohen–Macaulay. This result proves that the h-vector of the barycentric subdivision of a Cohen–Macaulay regular CW-complex is unimodal. Second, we prove that the Stanley–Reisner ring of the barycentric subdivision of an odd dimensional Cohen–Macaulay polyhedral complex has the weak Lefschetz property. Third, we obtain sharp upper bounds of the cd-indices of Gorenstein* posets for a fixed rank generating function.     

Quasi-linear functional differential equations with Property A

We study oscillatory properties of solutions of a functional differential equation of the form

(0.1)     

Topological sums and products in ZF-set theory

In ZF, i.e., Zermelo-Fraenkel set theory without the axiom of choice, the category Top of topological spaces and continuous maps is well-behaved. In particular, Top has sums (=coproducts) and products. However, it may happen that for families (Xi)_i∈I and (Yi)_i∈I with the property that each Xi is homeomorphic to the corresponding Yi neither their sums _⊕i∈IXi and _⊕i∈IYi nor their products _∏i∈IXi and _∏i∈IYi are homeomorphic. It will be shown that the axiom of choice is not only sufficient but also necessary to rectify this defect.     

Irreducible Specht modules for Hecke algebras of type A

Let F be a field, n a non-negative integer, λ a partition of n and S^λ the corresponding Specht module for the Iwahori-Hecke algebra H_F,q(S_n). James and Mathas conjecture a necessary and sufficient condition on λ for S^λ to be irreducible. We prove the sufficiency of this condition in the case where F has infinite characteristic and also in the case where q=1.     

On the potential balance among compulsory education outcomes through econometric and multiobjective programming analysis

This paper sheds new light on the relationship between inputs and outputs in the framework of the educational production function. In particular, it is geared at gaining a better understanding of which factors may be affected in order to achieve an optimal educational output level. With this objective in mind, we analyze teacher-based assessments (actual marks) in three different subjects using a multiobjective schema. For much of the analysis we use data from a recent (2010) Survey – ESOC10, linked with the results from an educational assessment program conducted among 11 and 15 year-old students and with the administrative records on teacher-based scores. Following the statistical and econometric analysis of these data, they are used to build a multiobjective mixed integer model. A reference point approach is used to determine the profile of, potentially, the most “successful and balanced” students in terms of educational outcomes. This kind of methodology in multiobjective programming allows generating “very balanced” solutions in terms of the objective values (subjects). Finally, a sensitivity analysis is used to determine policies that can be carried out in order to improve the performance levels of primary and secondary education students. Particularly, policy makers should be more concerned with the need to promote some cultural habits – such as reading –, from both the students’ and parents’ side. Additionally, policy efforts should be focused on making the vocational pathways available to Spanish youth more appealing, with the aim of taking advantage of the particular skills of students not succeeding in the academic track.     

Functions of operators under perturbations of class Sp

This is a continuation of our paper [2]. We prove that for functions f in the Hölder class Λα(R) and 1<p<∞, the operator f(A)−f(B) belongs to Sp/α, whenever A and B are self-adjoint operators with A−B∈Sp. We also obtain sharp estimates for the Schatten-von Neumann norms ‖f(A)−f(B)Sp/α_‖ in terms of ‖A−BSp_‖ and establish similar results for other operator ideals. We also estimate Schatten-von Neumann norms of higher order differences . We prove that analogous results hold for functions on the unit circle and unitary operators and for analytic functions in the unit disk and contractions. Then we find necessary conditions on f for f(A)−f(B) to belong to Sq under the assumption that A−B∈Sp. We also obtain Schatten-von Neumann estimates for quasicommutators f(A)R−Rf(B), and introduce a spectral shift function and find a trace formula for operators of the form f(A−K)−2f(A)+f(A+K).     

A geometric realization of quantum groups of type D

We geometrize quantum groups of type D in the spirit of Beilinson et al. (1990) [1].     

Extending compact topologies to compact Hausdorff topologies in ZF

Within the framework of Zermelo-Fraenkel set theory ZF, we investigate the set-theoretical strength of the following statements:

(1)

For every family(Ai)_i∈Iof sets there exists a family(Ti)_i∈Isuch that for everyi∈I(Ai,Ti)is a compactT₂space.

(2)

For every family(Ai)_i∈Iof sets there exists a family(Ti)_i∈Isuch that for everyi∈I(Ai,Ti)is a compact, scattered, T₂space.

(3)

For every set X, every compactR₁topology (itsT₀-reflection isT₂) on X can be enlarged to a compactT₂topology.

We show:

(a)

(1) implies every infinite set can be split into two infinite sets.

(b)

(2) iff AC.

(c)

(3) and “there exists a free ultrafilter” iff AC.

We also show that if the topology of certain compact T₁ spaces can be enlarged to a compact T₂ topology then (1) holds true. But in general, compact T₁ topologies do not extend to compact T₂ ones.     

Cone contraction and reference point methods for multi-criteria mixed integer optimization

Interactive approaches employing cone contraction for multi-criteria mixed integer optimization are introduced. In each iteration, the decision maker (DM) is asked to give a reference point (new aspiration levels). The subsequent Pareto optimal point is the reference point projected on the set of admissible objective vectors using a suitable scalarizing function. Thereby, the procedures solve a sequence of optimization problems with integer variables. In such a process, the DM provides additional preference information via pair-wise comparisons of Pareto optimal points identified. Using such preference information and assuming a quasiconcave and non-decreasing value function of the DM we restrict the set of admissible objective vectors by excluding subsets, which cannot improve over the solutions already found. The procedures terminate if all Pareto optimal solutions have been either generated or excluded. In this case, the best Pareto point found is an optimal solution. Such convergence is expected in the special case of pure integer optimization; indeed, numerical simulation tests with multi-criteria facility location models and knapsack problems indicate reasonably fast convergence, in particular, under a linear value function. We also propose a procedure to test whether or not a solution is a supported Pareto point (optimal under some linear value function).     

The Paley-Wiener Theorem in R with the Clifford Analysis Setting

We prove the Paley-Wiener Theorem in the Clifford algebra setting. As an application we derive the corresponding result for conjugate harmonic functions.