mathematical programming techniques solving de talari ganesh (9 résultats)

Etat : New.

Paperback. Etat : Brand New. 100 pages. 8.66x5.91x0.23 inches. In Stock.

Taschenbuch. Etat : Neu. Mathematical Programming Techniques for solving MCDA problems | Ganesh Talari | Taschenbuch | 100 S. | Englisch | 2017 | LAP LAMBERT Academic Publishing | EAN 9786202062152 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In MCDA problem, the outranking methodology of ELECTRE TRI method provides a compromise solution. An attempt is made in developing spreadsheet procedures for ELECTRE TRI method. The algorithm proposed is a user-friendly one and allows the user to handle the complex dimensioned MCDA problems very simply using the defined macro. To meet the main objective of goal programming, i.e., minimizing the sum of deviations, two new methods are proposed. The proposed methods showed better results in minimizing the deviations when compared to conventional goal programming model. A derivative ratio methodology, namely the Analytical Hierarchy Process has been used to test the consistency of the weights under goal programming model. Further, the practical importance, scope and usage of this technique in handling goal programming model are highlighted. It is shown that the weights which are proved as consistent, these weights will provide better performance than the weights which are inconsistent. 100 pp. Englisch.

Etat : New. Print on Demand.

Etat : New. PRINT ON DEMAND.

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Talari GaneshDr. Ganesh is working as Assistant Professor at the Department of Mathematics, National Institute of Technology (NIT) Hamirpur, Himachal Pradesh. He obtained his MSc, Ph.D. in Statistics from SV University, Tirupati. His.

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -In MCDA problem, the outranking methodology of ELECTRE TRI method provides a compromise solution. An attempt is made in developing spreadsheet procedures for ELECTRE TRI method. The algorithm proposed is a user-friendly one and allows the user to handle the complex dimensioned MCDA problems very simply using the defined macro. To meet the main objective of goal programming, i.e., minimizing the sum of deviations, two new methods are proposed. The proposed methods showed better results in minimizing the deviations when compared to conventional goal programming model. A derivative ratio methodology, namely the Analytical Hierarchy Process has been used to test the consistency of the weights under goal programming model. Further, the practical importance, scope and usage of this technique in handling goal programming model are highlighted. It is shown that the weights which are proved as consistent, these weights will provide better performance than the weights which are inconsistent.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 100 pp. Englisch.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In MCDA problem, the outranking methodology of ELECTRE TRI method provides a compromise solution. An attempt is made in developing spreadsheet procedures for ELECTRE TRI method. The algorithm proposed is a user-friendly one and allows the user to handle the complex dimensioned MCDA problems very simply using the defined macro. To meet the main objective of goal programming, i.e., minimizing the sum of deviations, two new methods are proposed. The proposed methods showed better results in minimizing the deviations when compared to conventional goal programming model. A derivative ratio methodology, namely the Analytical Hierarchy Process has been used to test the consistency of the weights under goal programming model. Further, the practical importance, scope and usage of this technique in handling goal programming model are highlighted. It is shown that the weights which are proved as consistent, these weights will provide better performance than the weights which are inconsistent.