Multiple criteria districting problems

Districting problems are of high importance in many different fields. Multiple criteria models seem a more adequate representation of districting problems in real-world situations. Real-life decision situations are by their very nature multidimensional. This paper deals with the problem of partitioning a territory into “homogeneous” zones. Each zone is composed of a set of elementary territorial units. A district map is formed by partitioning the set of elementary units into connected zones without inclusions. When multiple criteria are considered, the problem of enumerating all the efficient solutions for such a model is known as being NP-hard, which is why we decided to avoid using exact methods to solve large-size instances. In this paper, we propose a new method to approximate the Pareto front based on an evolutionary algorithm with local search. The algorithm presents a new solution representation and the crossover/mutation operators. Its main features are the following: it deals with multiple criteria; it allows to solve large-size instances in a reasonable CPU time and generates high quality solutions. The algorithm was applied to a real-world problem, that of the Paris region public transportation. Results will be used for a discussion about the reform of its current pricing system.     

Multiple criteria decision problems with fuzzy domination structures

The concepts of domination structures and nondominated solutions in multiple criteria decision problems, which were introduced by Yu, enable us to tackle general situations in which there exists information concerning the decision maker's preferences.In many of the multiple criteria decision problems the underlying domination structures are not known precisely but only fuzzily determined. Yu primarily works with the case where the domination structure at each point is a convex cone. As a result, there exists a sharp borderline dividing all solutions into nondominated solutions and the others.This paper fuzzifies the concepts of domination structures and nondominated solutions to allow them to be applied to a larger class of the multiple criteria decision problems mentioned above. Introducing the concepts of fuzzy convex cones and fuzzy polar cones, it is shown how some of the main results obtained by Yu are extended.     

Multiple criteria facility location problems: A survey

This paper provides a review on recent efforts and development in multi-criteria location problems in three categories including bi-objective, multi-objective and multi-attribute problems and their solution methods. Also, it provides an overview on various criteria used. While there are a few chapters or sections in different location books related to this topic, we have not seen any comprehensive review papers or book chapter that can cover it. We believe this paper can be used as a complementary and updated version.     

Variational inequalities over Euclidean balls

This paper investigates solution stability of parametric variational inequalities over Euclidean balls in finite dimensional spaces. We provide exact formulas for computing required coderivatives of the normal cone mappings to Euclidean balls via the initial data. On the basis of these formulas, we establish necessary and sufficient conditions for Lipschitzian stability of the solution maps of the aforementioned variational inequalities.     

On linear optimization over Wasserstein balls

Mathematical Programming - Wasserstein balls, which contain all probability measures within a pre-specified Wasserstein distance to a reference measure, have recently enjoyed wide popularity in the...     

Isoperimetric balls in cones over tori

In the cone over a cubic three-torus T ³, balls about the vertex are isoperimetric if the volume of T ³ is less than π/16 times the volume of the unit three-sphere. The conjectured optimal constant is 1.     

The generalization of Minkowski problems for polytopes

The generalization of Minkowski problems, such as the $L_p$ and Orlicz Minkowski problems, have caused wide concern recently. In this paper, we will establish the existence of the Orlicz Minkowski problem for polytopes. In particular, a solution to the $L_p$ Minkowski problem for polytopes with $p>1$ is given. By the uniqueness of this solution, we present a new proof of the $L_p$ Minkowski inequality that demonstrates the relationship between these two fundamental theorems of the $L_p$ Brunn–Minkowski theory.     

复正定矩阵的Minkowski不等式

建立了复正定矩阵的几个行列式不等式,将正定Ｈｅｒｍｉｔｅ阵的Ｍｉｎｋｏｗｓｋｉ不等式、 Ｏｓｔｒｏｗｓｋｉ－Ｔａｕｓｓｋｙ不等式推广到了复正定矩阵上,推广改进了一些文献的结果．     

Unsmoothing over balls via plane wave decomposition

Let

A classification of Minkowski planes over half-ordered fields

This paper concerns a construction of Minkowski planes over half-ordered fields [5] and [20]. Solving various functional equations the Klein-Kroll types of these Minkowski planes are determined with respect toG- andq-translations and (p, q)-homotheties. Examples for some of the resulting types are given.     

Single facility location problems with unbounded unit balls

In this paper we consider a new class of continuous location problems where the distances are measured by gauges of closed (not necessarily bounded) convex sets. These distance functions do not satisfy the definiteness property and therefore they can be used to model those situations where there exist zero-distance regions. We prove a geometrical characterization of these measures of distance as the length of shortest paths between points using only a subset of directions of their unit balls. We also characterize the complete set of optimal solutions for this class of continuous single facility location problems and we give resolution methods to solve them. Our analysis allows to consider new models of location problems and generalizes previously known results.     

Duality for location problems with unbounded unit balls

Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conjugacy approach based on the perturbation theory, we determine a dual to it. Necessary and sufficient optimality conditions are derived using strong duality. Furthermore, as special case of this problem, we consider a location problem, where the “distances” are measured by gauges of closed convex sets. We prove that the geometric characterization of the set of optimal solutions for this location problem given by Hinojosa and Puerto in a recently published paper can be obtained via the presented dual problem. Finally, the Weber and the minmax location problems with gauges are given as applications.     

Majorants of functions with vanishing integrals over balls

We prove the existence of nontrivial functions in ℝⁿ, n ≥ 2, with vanishing integrals over balls of fixed radius and given majorant of growth. Translated from Ukrains'kyi Matematychnyi Zhurnal, Vol. 60, No. 6, pp. 857–861, June, 2008.     

Multiple criteria linear regression

The unknown parameters in multiple linear regression models may be estimated using any one of a number of criteria such as the minimization of the sum of squared errors MSSE, the minimization of the sum of absolute errors MSAE, and the minimization of the maximum absolute error MMAE. At present, the MSSE or the least squares criterion continues to be the most popular. However, at times the choice of a criterion is not clear from statistical, practical or other considerations. Under such circumstances, it may be more appropriate to use multiple criteria rather than a single criterion to estimate the unknown parameters in a multiple linear regression model. We motivate the use of multiple criteria estimation in linear regression models with an example, propose a few models, and outline a solution procedure.     

Minkowski’s Second Theorem over a Simple Algebra

We generalize the notion of successive minima, Minkowski’s second theorem and Siegel’s lemma to a free module over a simple algebra whose center is a global field. The author was partly supported by the Grant-in-Aid for Scientific Research (C), Japan Society for the Promotion of Science.     

Extremal problems in Minkowski space related to minimal networks

We solve the following problem of Z. Füredi, J. C. Lagarias and F. Morgan (1991): Is there an upper-bound polynomial in for the largest cardinality of a set of unit vectors in an -dimensional Minkowski space (or Banach space) such that the sum of any subset has norm less than 1? We prove that and that equality holds iff the space is linearly isometric to , the space with an -cube as unit ball. We also remark on similar questions they raised that arose out of the study of singularities in length-minimizing networks in Minkowski spaces.

     

Computation of Minkowski Values of Polynomials over Complex Sets

As a generalization of Minkowski sums, products, powers, and roots of complex sets, we consider the Minkowski value of a given polynomial P over a complex set X. Given any polynomial P(z) with prescribed coefficients in the complex variable z, the Minkowski value P(X) is defined to be the set of all complex values generated by evaluating P, through a specific algorithm, in such a manner that each instance of z in this algorithm varies independently over X. The specification of a particular algorithm is necessary, since Minkowski sums and products do not obey the distributive law, and hence different algorithms yield different Minkowski value sets P(X). When P is of degree n and X is a circular disk in the complex plane we study, as canonical cases, the Minkowski monomial value P _m (X), for which the monomial terms are evaluated separately (incurring n(n+1) independent values of z) and summed; the Minkowski factor value P _f (X), where P is represented as the product (z–r ₁)(z–r _n ) of n linear factors – each incurring an independent choice zX – and r ₁,...,r _n are the roots of P(z); and the Minkowski Horner value P _h (X), where the evaluation is performed by nested multiplication and incurs n independent values zX. A new algorithm for the evaluation of P _h (X), when 0X, is presented.     

Minkowski’s Second Theorem over a Simple Algebra

We generalize the notion of successive minima, Minkowski’s second theorem and Siegel’s lemma to a free module over a simple algebra whose center is a global field.     

On bifurcation for semilinear elliptic Dirichlet problems on geodesic balls

We study bifurcation from a branch of trivial solutions of semilinear elliptic Dirichlet boundary value problems on a geodesic ball, whose radius is used as the bifurcation parameter. In the proof of our main theorem we obtain in addition a special case of an index theorem due to S. Smale.