4558

4286

كارشناسي ارشد

سيستم هاي اقتصادي واجتماعي

اصفهان: دانشگاه صنعتي اصفهان، دانشكده صنايع وسيستم ها

1387

ده، 72 ،[II]، ص: جدول

ص.ع.به:فارسي وانگليسي

محمد سعيد دباغ

ناصر ملاوردي

88/4/23

نادر شتاب بوشهري

1396/09/12

كتابنامه

مهندسي صنايع و سيستم ها

ID4286

به فارسي و انگليسي: قابل رويت در نسخه ديجيتال

Abstract Although many years past from presentation of the algorithms for solving integer programming problems amethod compatible with all of the problems has not been presented The aim was on solving the problems withspecial structures One of these problems was knapsack problem This kind of problems was the main focus inlast years because of its special theoretical framework and many studies have been done in regard todevelopment of its application and the methods for solving this kind of problems However some of difficultknapsack problems remain that the offered methods for them are not compatible with these problems The category of knapsack problems has different kinds and each has its own feature One of the knapsackproblems is the one that the constraint of which is in the form of an equation and is known as equality constraintknapsack problem In this research firstly the literature related to integer programming and solving relatedproblems was dealt been defined and the methods used for solving these problems has been investigated Inchapter 4 the main idea of this thesis has been described in details This idea resulted in presentation of two newmethods for solving equality constraint knapsack problems This main idea is actually embedded in the fact that methods like branch and bound and cutting plans areafter one goal i e finding some nonbasic variables of the primary answer that taking value of them results ingetting integreof primary basic variables In the method presented in this thesis the focus is on identifying thesenonbasic variables in a shortcut way Since the efficiency of the mentioned methods should be proved they should be applied to solving sampleand standard problems To this end these two methods have been applied to 25 equality constraint knapsackproblems that are some of the most challenging and difficult problems that have been investigated in severalstudies as standard problems The results have been presented in the last chapter The results are unique in some way and two proposed methods can be very good starting points Finally amethod has been proposed for solving of penalty model the implication of the main idea and main approach ofthis study has been proposed as a suggestion in order to presenting new methods for solving integerprogramming problems developing and improving two proposed methods in this thesis and popularizing themto knapsack problems Key wordsInteger programming knapsack problem equality constraint penalty method basic variable nonbasic variable

محمد سعيد دباغ

ناصر ملاوردي

نادر شتاب بوشهري