APPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING

PDF
  • Majid Darehmiraki1,
  1. khatam alanbia university of technology Iran, Islamic Republic of department of mathematics

Revised: 15-04-2016

Accepted: 15-04-2016

Published in Issue 21-03-2013

How to Cite

Darehmiraki, M. (2013). APPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING. International Journal of Mathematical Modelling & Computations, 3(4), 317-320. https://oiccpress.com/ijm2c/article/view/11198

Abstract

In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, items are selected in according to their rank.
PDF