Group decision-making based on concepts of ideal and anti-ideal points in a fuzzy environment

Decision-making problems (location selection) often involve a complex decision-making process in which multiple requirements and uncertain conditions have to be taken into consideration simultaneously. In evaluating the suitability of alternatives, quantitative/qualitative assessments are often required to deal with uncertainty, subjectiveness and imprecise data, which are best represented with fuzzy data. This paper presents a new method of analysis of multicriteria based on the incorporated efficient fuzzy model and concepts of positive ideal and negative ideal points to solve decision-making problems with multi-judges and multicriteria in real-life situations. As a result, effective decisions can be made on the basis of consistent evaluation results. Finally, this paper uses a numerical example of location selection to demonstrate the applicability of this method, with its simplicity in both concept and computation. The results show that this method can be implemented as an effective decision aid in selecting location or decision-making problems.     

A multicriteria approach to the location of public facilities

We argue that practical problems involving the location of public facilities are really multicriteria problems, and ought to be modeled as much. The general criteria are those of cost and service, but there exist several distinct criteria in each of those two categories. For the first category, fixed investment cost, fixed operating cost, variable operating cost, total operating cost, and total discounted cost are all reasonable criteria to consider. In terms of service, both demand served and response time (or distance traveled) are appropriate criteria, either agglomerated or considered on the basis of the individual clients. In this paper we treat such multicriteria questions in the framework of a model for selecting a subset of M sites at which to establish public facilities in order to serve client groups located at N distinct points. We show that for some combinations of specific criteria, parametric solutions of a generalized assignment problem (GAP) will yield all efficient solution. In most other cases the efficient solutions can be found through parametric solution of a GAP with additional constraints of a type which can be incorporated into an existing algorithm for the GAP. Rather than attempting to find all efficient solutions, however, we advocate an interactive approach to the resolution of multicriteria location problems and elaborate on a specific interactive algorithm for multicriteria optimization which for the present model solves a finite sequence of GAP's or GAP-type problems. Finally, some similar aspects of private sector location problems are discussed.     

Multicriteria Planar Ordered Median Problems

In this paper, we deal with the determination of the entire set of Pareto solutions of location problems involving Q general criteria. These criteria include median, center, or centdian objective functions as particular instances. We characterize the set of Pareto solutions of all these multicriteria problems for any polyhedral gauge. An efficient algorithm is developed for the planar case and its complexity is established. Extensions to the nonconvex case are also considered. The proposed approach is more general than previously published approaches to multicriteria location problems.The research of the third and fourth authors was partially supported by Grants BFM2001-2378, BFM2001-4028, BFM2004-0909, and HA2003-0121.     

A polynomial algorithm for the multicriteria cent-dian location problem

Given a network with several weights per node and several lengths per edge, we address the problem of locating a facility on the network such that the convex combinations of the center and median objective functions are minimized. Since we consider several weights and several lengths, various objective functions should be minimized, and hence we have to solve a multicriteria cent-dian location problem. A polynomial algorithm to characterize the efficient location point set on the network is developed. Furthermore, this model can generalize other problems such as the multicriteria center problem and the multicriteria median problem. Computing time results on random planar networks considering different combinations of weights and lengths are reported, which strengthen the polynomial complexity of the procedure.     

Characterizing the efficient points without closedness or free-disposability

Many multicriteria problems in economics and finance require that efficient solutions be found. A recent contribution to production theory established a characterization of efficient points under closedness and free-disposability (Bonnisseau and Crettez in Econ Theory 31(2):213–223, 2007, Theorem 1). However, as will be shown using a number of examples, these results cannot be applied to simple and plausible production sets, nor can they be extended to other classic multicriteria problems such as those arising in optimal portfolio theory and bargaining theory. To address these limitations, a reformulation of the above theorem without closedness or free-disposability is proposed. This enables efficient solutions for a wider range of multicriteria problems to be identified.     

Multicriteria dynamic programming with an application to the integer case

Fundamental dynamic programming recursive equations are extended to the multicriteria framework. In particular, a more detailed procedure for a general recursive solution scheme for the multicriteria discrete mathematical programming problem is developed. Definitions of lower and upper bounds are offered for the multicriteria case and are incorporated into the recursive equations to aid problem solution by eliminating inefficient subpolicies. Computational results are reported for a set of 0–1 integer linear programming problems.This research was supported in part by CONACYT (Consejo Nacional de Ciencia y Technologia), Mexico City, Mexico.     

Postoptimal analysis of the multicriteria combinatorial median location problem

We consider a multicriteria variant of the well-known combinatorial minisum facility location problem (median problem) with Pareto and lexicographic optimality principles. Necessary and sufficient conditions of a solution stability to the initial data perturbations in such problems are formulated in terms of binary relations. Numerical examples are given.     

An algebraic approach to assignment problems

For assignment problems a class of objective functions is studied by algebraic methods and characterized in terms of an axiomatic system. It says essentially that the coefficients of the objective function can be chosen from a totally ordered commutative semigroup, which obeys a divisibility axiom. Special cases of the general model are the linear assignment problem, the linear bottleneck problem, lexicographic multicriteria problems,p-norm assignment problems and others. Further a polynomial bounded algorithm for solving this generalized assignment problem is stated. The algebraic approach can be extended to a broader class of combinatorial optimization problems.     

Some pathological configurations of noninferior set appearing in multicriteria optimization problems of chemical processes

The noninferior set of multicriteria optimization problems may sometimes include some inactive subset in which a scalar-valued objective function of weighted-mean type cannot be minimal. It is shown that there exists such an inactive noninferior subset within the noninferior set of two multicriteria optimization problems concerning a cross-current multistage extraction process and a fluidized reactor-heater system.     

Decision making in a fuzzy environment and its application to multicriteria power engineering problems

This paper presents results of research into the use of the Bellman–Zadeh approach to decision making in a fuzzy environment for solving multicriteria optimization problems. Its application conforms to the principle of guaranteed result and provides constructive lines in obtaining harmonious solutions on the basis of analyzing associated maxmin problems. The use of the Bellman–Zadeh approach has served as a basis for solving a problem of multicriteria allocation of resources (or their shortages) and developing a corresponding adaptive interactive decision making system (AIDMS1). AIDMS1 includes procedures for considering linguistic variables to reflect conditions that are difficult to formalize as well as procedures for constructing and correcting vectors of importance factors for goals. The use of these procedures permits one to realize an adaptive approach to processing information of a decision maker to provide successive improvment in solution quality. The results of the paper are universally applicable and are already being used to solve power engineering problems. It is illustrated by considering problems of multicriteria power and energy shortage allocation and multicriteria power system operation.     

Extended VIKOR method in comparison with outranking methods

The VIKOR method was developed to solve MCDM problems with conflicting and noncommensurable (different units) criteria, assuming that compromising is acceptable for conflict resolution, the decision maker wants a solution that is the closest to the ideal, and the alternatives are evaluated according to all established criteria. This method focuses on ranking and selecting from a set of alternatives in the presence of conflicting criteria, and on proposing compromise solution (one or more). The VIKOR method is extended with a stability analysis determining the weight stability intervals and with trade-offs analysis. The extended VIKOR method is compared with three multicriteria decision making methods: TOPSIS, PROMETHEE, and ELECTRE. A numerical example illustrates an application of the VIKOR method, and the results by all four considered methods are compared.     

Connectedness of efficient points in convex and convex transformable vector optimization

Given a convex vector optimization problem with respect to a closed ordering cone, we show the connectedness of the efficient and properly efficient sets. The Arrow–Barankin–Blackwell theorem is generalized to nonconvex vector optimization problems, and the connectedness results are extended to convex transformable vector optimization problems. In particular, we show the connectedness of the efficient set if the target function f is continuously transformable, and of the properly efficient set if f is differentiably transformable. Moreover, we show the connectedness of the efficient and properly efficient sets for quadratic quasiconvex multicriteria optimization problems.     

The Edgeworth-Pareto principle in terms of a fuzzy choice function

The Edgeworth-Pareto Principle, the simplest version of which has been known since the 19th century, is stated in general terms of a fuzzy choice function. The application of the principle is justified for a wide class of fuzzy multicriteria choice problems described by certain axioms of the rational behavior. These results bring the axiomatic substantiation of the Edgeworth-Pareto principle performed previously by the author to the most general form and make it possible to reveal the boundaries of that class of multicriteria choice problems for which the application of this principle is required. Based on scalarization methods as applied to multicriteria problems, upper bounds are derived for the unknown set of selected vectors.     

Integral analysis method – IAM

This paper presents the theoretical foundations of the new integral analysis method (IAM), and its application to a facility location problem. This methodology integrates the cardinal and ordinal criteria of combinatorial stochastic optimization problems in four stages: definition of the problem, cardinal analysis, ordinal analysis and integration analysis. The method uses the concepts of stochastic multicriteria acceptability analysis (SMAA), Monte Carlo simulation, optimization techniques and elements of probability. The proposed method (IAM) was used to determine optimal locations for the retail stores of a Colombian coffee marketing company.     

Theory of convex cones in multicriteria decision making

We develop the theory of convex polyhedral cones in the objective-function space of a multicriteria decision problem. The convex cones are obtained from the decision-maker's pairwise judgments of decision alternatives and are applicable to any quasiconcave utility function. Therefore, the cones can be used in any progressively articulated solution procedure that employs pairwise comparisons. The cones represent convex sets of solutions that are inferior to known solutions to a multicriteria problem. Therefore, these convex sets can be eliminated from consideration while solving the problem. We develop the underlying theory and a framework for representing knowledge about the decision-maker's preference structure using convex cones. This framework can be adopted in the interactive solution of any multicriteria problem after taking into account the characteristics of the problem and the solution procedure. Our computational experience with different multicriteria problems shows that this approach is both viable and efficient in solving practical problems of moderate size.     

Solving Fractional Multicriteria Optimization Problems with Sum of Squares Convex Polynomial Data

This paper focuses on the study of finding efficient solutions in fractional multicriteria optimization problems with sum of squares convex polynomial data. We first relax the fractional multicriteria optimization problems to fractional scalar ones. Then, using the parametric approach, we transform the fractional scalar problems into non-fractional problems. Consequently, we prove that, under a suitable regularity condition, the optimal solution of each non-fractional scalar problem can be found by solving its associated single semidefinite programming problem. Finally, we show that finding efficient solutions in the fractional multicriteria optimization problems is tractable by employing the epsilon constraint method. In particular, if the denominators of each component of the objective functions are same, then we observe that efficient solutions in such a problem can be effectively found by using the hybrid method. Some numerical examples are given to illustrate our results.     

Multicriteria analysis: survey and new directions

Before the advent of multicriteria analysis, decision problems often took the form of the optimization of an objective function or a utility function. This approach has the advantage of resulting in well-defined mathematical problems but is not always representative of reality: in fact the comparison of several possible decisions is rarely made according to a single point of view and the preferences on a point of view are in many cases only modelled with difficulty by a function. The aim of this paper is to survey the different directions in which multicriteria analysis has developed: multiattribute utility theory, outranking relations, interactive methods. The methodology recently proposed by B. Roy is also presented.     

向量拟平衡问题系统及其应用

引入了向量拟平衡问题系统并证明了其解的存在性定理．作为应用,还得到约束多目标对策和无约束多目标对策弱Pareto平衡的一些存在性结果．     

Multicriteria–multistage planning for the optimal path selection using hybrid genetic algorithms

The problem of the competence set expansion involves determining the optimal expansion path under the minimum cost and time. As we know, the conventional competence set model only considers the problems of the static situation and the single objective. However, the dynamic situation and the multicriteria should also be simultaneously considered in practice. In this paper, a multicriteria and multistage competence set model is proposed. In order to efficiently obtain an optimal expansion path, hybrid genetic algorithms (HGA) are employed. In addition, a numerical example is used to demonstrate the proposed method. On the basis of the numerical results, we can conclude that the proposed method can provide a sound competence set model by simultaneously considering the multicriteria and multistage situations.