Билинейная оптимизация в анализе многокритериальных задач методами теории важности критериев при неточной информации о предпочтениях
Exact efficient numerical methods are proposed for solving bilinear optimization problems that arise when various solution variants are compared based on their preferability using an additive value function in the case of interval estimates of the degrees of superiority of certain criteria over others and in the case of interval restrictions on the growth of preferences along the criteria range.
This abstract offers a method for ranking alternatives in a decison making problem. It determines importance of the criteria with help of factor analysis. Though the alternatives are evaluated by each of the criteria by a group of experts, the weights for the criteria are to be found with the help of factor analysis.
The algorithm of the method is as follows:
1. Under the constraint that the problem handles several evaluation criteria, several items to compare (alternatives) and several experts to give their evaluation.
2. Find the principal components that replace the input criteria implicitly.
3. To find the final mark for each of the alternatives the marks given by experts are multiplied with the regression coefficients, found in the step 2.
4. The final marks are represented in axes „crieria“ and „mark“ so that each alternative is described with a curve (trajectory). These curves represent the map of graded alternatives. Depending on the problem to be solved (min or max,) a record for each main criteria is to be found.
5. With help of special deviation measure procedures (Minkowski, Chebyshev e.t.s) a matrix of deviations from ideal solution is to be built.
6. The alternatives are to be rated in accordance to the deviation from the ideal trajectory.
To prove the effectiveness of the method it was applied to a problem for 5 alternatives, 3 experts and 38 evaluation criteria. The problem was also solved with the help of most popular method of Weighted Sum Model (WSM) and TOPSIS method. The problem was also being solved by finding the geometric mean for each alternative. The results for approaches were compared and the method, offered in this abstrat, proved itself as a feasible one.
An approach to sensitivity (stability) analysis of nondominated alternatives to changes in the bounds of intervals of value tradeoffs, where the alternatives are selected based on interval data of criteria tradeoffs is proposed. Methods of computations for the analysis of sensitivity of individual nondominated alternatives and the set of such alternatives as a whole are developed.
The influence of the assumption about the existence of cardinal coefficients of criteria importance, consistent with the importance ordering of criteria (according to the definitions in the criteria importance theory), on the preference relation generated by this information, is investigated.
The author shows that criteria can be ordered in terms of importance (in the strict sense defined in the criteria importance theory) even if the preference structure with the value function is not additive.
Influence of the assumption about the existence of quantitative coefficients of criteria importance, consistent with the criteria importance order (according to the definitions in the criteria importance theory), on the preference relation, generated by this information, is investigated.
WE present a general approach to the solution of the multicriteria choice problem by methods of the Criteria importance theory. The overview of methods of vector estimates comparison by preference using various types of information about the preferences of the decision-maker is given. These methods are implemented in the computer system DASS.
We consider certain spaces of functions on the circle, which naturally appear in harmonic analysis, and superposition operators on these spaces. We study the following question: which functions have the property that each their superposition with a homeomorphism of the circle belongs to a given space? We also study the multidimensional case.
We consider the spaces of functions on the m-dimensional torus, whose Fourier transform is p -summable. We obtain estimates for the norms of the exponential functions deformed by a C1 -smooth phase. The results generalize to the multidimensional case the one-dimensional results obtained by the author earlier in “Quantitative estimates in the Beurling—Helson theorem”, Sbornik: Mathematics, 201:12 (2010), 1811 – 1836.
We consider the spaces of function on the circle whose Fourier transform is p-summable. We obtain estimates for the norms of exponential functions deformed by a C1 -smooth phase.
Let k be a field of characteristic zero, let G be a connected reductive algebraic group over k and let g be its Lie algebra. Let k(G), respectively, k(g), be the field of k- rational functions on G, respectively, g. The conjugation action of G on itself induces the adjoint action of G on g. We investigate the question whether or not the field extensions k(G)/k(G)^G and k(g)/k(g)^G are purely transcendental. We show that the answer is the same for k(G)/k(G)^G and k(g)/k(g)^G, and reduce the problem to the case where G is simple. For simple groups we show that the answer is positive if G is split of type A_n or C_n, and negative for groups of other types, except possibly G_2. A key ingredient in the proof of the negative result is a recent formula for the unramified Brauer group of a homogeneous space with connected stabilizers. As a byproduct of our investigation we give an affirmative answer to a question of Grothendieck about the existence of a rational section of the categorical quotient morphism for the conjugating action of G on itself.
This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.
Let G be a connected semisimple algebraic group over an algebraically closed field k. In 1965 Steinberg proved that if G is simply connected, then in G there exists a closed irreducible cross-section of the set of closures of regular conjugacy classes. We prove that in arbitrary G such a cross-section exists if and only if the universal covering isogeny Ĝ → G is bijective; this answers Grothendieck's question cited in the epigraph. In particular, for char k = 0, the converse to Steinberg's theorem holds. The existence of a cross-section in G implies, at least for char k = 0, that the algebra k[G]G of class functions on G is generated by rk G elements. We describe, for arbitrary G, a minimal generating set of k[G]G and that of the representation ring of G and answer two Grothendieck's questions on constructing generating sets of k[G]G. We prove the existence of a rational (i.e., local) section of the quotient morphism for arbitrary G and the existence of a rational cross-section in G (for char k = 0, this has been proved earlier); this answers the other question cited in the epigraph. We also prove that the existence of a rational section is equivalent to the existence of a rational W-equivariant map T- - - >G/T where T is a maximal torus of G and W the Weyl group.