20,491 research outputs found

    On optimal completions of incomplete pairwise comparison matrices

    Get PDF
    An important variant of a key problem for multi-attribute decision making is considered. We study the extension of the pairwise comparison matrix to the case when only partial information is available: for some pairs no comparison is given. It is natural to define the inconsistency of a partially filled matrix as the inconsistency of its best, completely filled completion. We study here the uniqueness problem of the best completion for two weighting methods, the Eigen-vector Method and the Logarithmic Least Squares Method. In both settings we obtain the same simple graph theoretic characterization of the uniqueness. The optimal completion will be unique if and only if the graph associated with the partially defined matrix is connected. Some numerical experiences are discussed at the end of the paper

    An exact algorithm for linear optimization problem subject to max-product fuzzy relational inequalities with fuzzy constraints

    Full text link
    Fuzzy relational inequalities with fuzzy constraints (FRI-FC) are the generalized form of fuzzy relational inequalities (FRI) in which fuzzy inequality replaces ordinary inequality in the constraints. Fuzzy constraints enable us to attain optimal points (called super-optima) that are better solutions than those resulted from the resolution of the similar problems with ordinary inequality constraints. This paper considers the linear objective function optimization with respect to max-product FRI-FC problems. It is proved that there is a set of optimization problems equivalent to the primal problem. Based on the algebraic structure of the primal problem and its equivalent forms, some simplification operations are presented to convert the main problem into a more simplified one. Finally, by some appropriate mathematical manipulations, the main problem is transformed into an optimization model whose constraints are linear. The proposed linearization method not only provides a super-optimum (that is better solution than ordinary feasible optimal solutions) but also finds the best super-optimum for the main problem. The current approach is compared with our previous work and some well-known heuristic algorithms by applying them to random test problems in different sizes.Comment: 29 pages, 8 figures, 7 table

    A Posynomial Geometric Programming Restricted to a System of Fuzzy Relation Equations

    Get PDF
    AbstractA posynomial geometric optimization problem subjected to a system of max-min fuzzy relational equations (FRE) constraints is considered. The complete solution set of FRE is characterized by unique maximal solution and finite number of minimal solutions. A two stage procedure has been suggested to compute the optimal solution for the problem. Firstly all the minimal solutions of fuzzy relation equations are determined. Then a domain specific evolutionary algorithm (EA) is designed to solve the optimization problems obtained after considering the individual sub-feasible region formed with the help of unique maximum solution and each of the minimal solutions separately as the feasible domain with same objective function. A single optimal solution for the problem is determined after solving these optimization problems. The whole procedure is illustrated with a numerical example

    Minimizing and maximizing a linear objective function under a fuzzy max\max -\ast relational equation and an inequality constraint

    Get PDF
    summary:This paper provides an extension of results connected with the problem of the optimization of a linear objective function subject to max\max-\ast fuzzy relational equations and an inequality constraint, where \ast is an operation. This research is important because the knowledge and the algorithms presented in the paper can be used in various optimization processes. Previous articles describe an important problem of minimizing a linear objective function under a fuzzy max\max-\ast relational equation and an inequality constraint, where \ast is the tt-norm or mean. The authors present results that generalize this outcome, so the linear optimization problem can be used with any continuous increasing operation with a zero element where \ast includes in particular the previously studied operations. Moreover, operation \ast does not need to be a t-norm nor a pseudo-tt-norm. Due to the fact that optimal solutions are constructed from the greatest and minimal solutions of a max\max-\ast relational equation or inequalities, this article presents a method to compute them. We note that the linear optimization problem is valid for both minimization and maximization problems. Therefore, for the optimization problem, we present results to find the largest and the smallest value of the objective function. To illustrate this problem a numerical example is provided

    Flood lamination strategy based on a three-flood-diversion-area system management

    Get PDF
    The flood lamination has for principal objective to maintain a downstream flow at a fixed lamination level. For this goal, it is necessary to proceed to the dimensioning of the river system capacity and to make sure of its management by taking into account socio-economic and environmental constraints. The use of flood diversion areas on a river has for main interest to protect inhabited downstream areas. In this paper, a flood lamination strategy aiming at deforming the wave of flood at the entrance of the zone to be protected is presented. A transportation network modeling and a flow optimization method are proposed. The flow optimization method, is based on the modeling of a Min-Cost-Max-flow problem with a linear programming formulation. The optimization algorithm used in this method is the interior-point algorithm which allows a relaxation of the solution of the problem and avoids some non feasibility cases due to the use of constraints based on real data. For a forecast horizon corresponding to the flood episode, the management method of the flood volumes is evaluated on a 2D simulator of a river equipped with a three-flood-diversion- area system. Performances show the effectiveness of the method and its ability to manage flood lamination with efficient water storage

    Geometric Programming Subject to System of Fuzzy Relation Inequalities

    Get PDF
    In this paper, an optimization model with geometric objective function is presented. Geometric programming is widely used; many objective functions in optimization problems can be analyzed by geometric programming. We often encounter these in resource allocation and structure optimization and technology management, etc. On the other hand, fuzzy relation equalities and inequalities are also used in many areas. We here present a geometric programming model with a monomial objective function subject to the fuzzy relation inequality constraints with maxproduct composition. Simplification operations have been given to accelerate the resolution of the problem by removing the components having no effect on the solution process. Also, an algorithm and two practical examples are presented to abbreviate and illustrate the steps of the problem resolution

    Resolution and simplification of Dombi-fuzzy relational equations and latticized optimization programming on Dombi FREs

    Full text link
    In this paper, we introduce a type of latticized optimization problem whose objective function is the maximum component function and the feasible region is defined as a system of fuzzy relational equalities (FRE) defined by the Dombi t-norm. Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. Since the feasible solutions set of FREs is non-convex and the finding of all minimal solutions is an NP-hard problem, designing an efficient solution procedure for solving such problems is not a trivial job. Some necessary and sufficient conditions are derived to determine the feasibility of the problem. The feasible solution set is characterized in terms of a finite number of closed convex cells. An algorithm is presented for solving this nonlinear problem. It is proved that the algorithm can find the exact optimal solution and an example is presented to illustrate the proposed algorithm.Comment: arXiv admin note: text overlap with arXiv:2206.09716, arXiv:2207.0637
    corecore