A review of the parallel standard, dual and modified Simplex methods for solving the LP problems
سال انتشار: 1399
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 556
فایل این مقاله در 14 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
MECECONF01_001
تاریخ نمایه سازی: 19 شهریور 1399
چکیده مقاله:
So far, several methods have been introduced to solve linear problems, one of them is the Simplex method that is one of the most important and widely used solutions for linear programming problems (LP). There are two types of Simplex methods: the first is the modified method and the second is the standard or tabular method. With the increasing use of computers for research work, the need for faster processing has increased and has become a basic need. Today, parallel processing has solved a very large part of this requirement. Parallel processing or parallel computing is defined as Simultaneous execution of programs that are divided into smaller sections on multiple processors to make greater speed. In this paper, first, a brief description of the main concepts of the article is given, then we overview the methods used in various articles to parallelize the standard, dual and modified Simplex method in solving LP problems
کلیدواژه ها:
نویسندگان
Zahra Kiapasha
Department of Computer Science, University of Mazandaran, Babolsar, Iran
Zohre Kiapasha
Department of Information Technology Engineering, University of Qom, Qom, Iran