پديد آورنده :
رضايي زواره، سپيده
عنوان :
بررسي و طراحي الگوريتم هاي موازي تحليل مسائل برنامه ريزي خطي امكان ناپذير در مقياس بزرگ
مقطع تحصيلي :
كارشناسي ارشد
گرايش تحصيلي :
سيستم هاي اقتصادي اجتماعي
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده صنايع و سيستم ها
صفحه شمار :
نه، 108ص.: مصور، جدول، نمودار
يادداشت :
ص. ع. به فارسي و انگليسي
استاد راهنما :
ناصر ملاوردي
استاد مشاور :
محمود اشرفي زاده
توصيفگر ها :
بهينه سازي بزرگ مقياس , مساله امكان ناپذيري , ماكزيمم زير سيستم امكان پذير ﴿MaxFs﴾ , پردازش موازي , معماري حافظه توزيع شده , مدل انتقال پيام , ﴿MpI﴾
تاريخ نمايه سازي :
11/5/91
استاد داور :
نادر شتاب بوشهري، محمد سعيد صباغ
تاريخ ورود اطلاعات :
1395/11/13
رشته تحصيلي :
صنايع و سيستم ها
دانشكده :
مهندسي صنايع و سيستم ها
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
Designing Parallel Algorithms of Large Scale Infeasible Linear Programming Solvers Sepideh Rezaei Zavareh s rezaeizavareh@in iut ac ir Date of Submission 2011 7 19 Department of Industrial System Engineering Isfahan University of Technology Isfahan 84156 83111 IranDegree M Sc Language FarsiSupervisor Naser Mollaverdi naserm@cc iut ac irAbstractNowadays models consists of more details in comparison to past because of improving in scienceand technology so dimensions of modern problems are increasing fast On the other handdimensions of problems that we can solve are limited due to available computing power Mathematicians and on the other hand computer engineers suggest some approach to solve largescale problems but still there are many problems that are unsolvable One more effective approachto solve large scale problems is parallel processing That is using several processors concurrentlyfor solving one problem due to dividing the problem to some independent sections As mathematical models grow larger and more complex infeasibility happens more often duringthe process of model formulation Because of costs of formulation of large scale problems ignoring infeasible models is not frugal So mathematicians develop some methods for analysis ofinfeasible models during two past decades According to this fact that infeasibility occurs in textof large scale optimization and most approach for solving it is formulated as NP hard problem using parallel processing in this context is useful This thesis is dedicated to study of methods forinfeasibility analysis detection parallel source in their algorithms and designing parallelalgorithms In this way we use distributed memory architecture and message passing model Implementation of algorithms is done with MPI protocol Finally numerical results are shown andcompered Key wordsLarge scale Optimization Infeasibility Analysis Maximum Feasibility Subsystem MaxFS Parallel Processing Distributed Memory Architecture Message Passing Model Message PassingInterface MPI
استاد راهنما :
ناصر ملاوردي
استاد مشاور :
محمود اشرفي زاده
استاد داور :
نادر شتاب بوشهري، محمد سعيد صباغ
