A Holistic Approach Based on MCDM for Solving Location Problems
Authors
Abstract:
Location decision is an integral part of organizational strategies involving many factorsthat may be conflicting in nature. This paper presents a holistic approach of the multi-criteria decisionmaking (MCDM) methodology to select the optimal location(s), which fits best for both investors andmanagers. A case study is also provided to illustrate the application of the proposed holistic approach.Finally, a comparison with the previous work is made and the informational efficacy of the proposedmodel is also discussed.
similar resources
The BF-TOPSIS Approach for Solving Non-classical MCDM Problems
In this paper we show how the Belief-Function based Technique for Order Preference by Similarity to Ideal Solution (BF-TOPSIS) approach can be used for solving non-classical multi-criteria decisionmaking (MCDM) problems. We give simple examples to illustrate our presentation.
full textProviding a Method for Solving Interval Linear Multi-Objective Problems Based on the Goal Programming Approach
Most research has focused on multi-objective issues in its definitive form, with decision-making coefficients and variables assumed to be objective and constraint functions. In fact, due to inaccurate and ambiguous information, it is difficult to accurately identify the values of the coefficients and variables. Interval arithmetic is appropriate for describing and solving uncertainty and inaccu...
full textA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
full textA new approach for solving neutrosophic integer programming problems
Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...
full textA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
full textA New Approach for Solving Grey Assignment Problems
Linear assignment problem is one of the most important practical models in the literature of linear programming problems. Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach. In this way, some researchers have used a whitening technique to solve the grey assignment p...
full textMy Resources
Journal title
volume 20 issue 3
pages 251- 262
publication date 2007-10-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023