# Difference between revisions of "Parallel Linear Programmers"

Ammobasseri (talk | contribs) |
Ammobasseri (talk | contribs) (→Application of Parallel Computing in Linear Programming Problems) |
||

(20 intermediate revisions by 2 users not shown) | |||

Line 1: | Line 1: | ||

+ | == Application of Parallel Computing in Linear Programming Problems == | ||

+ | |||

Resource Links: | Resource Links: | ||

− | + | ||

+ | http://www.wikihow.com/Use-the-Hungarian-Algorithm (Appoint, or Assignment Problem) | ||

+ | |||

http://www.deazone.com/ | http://www.deazone.com/ | ||

http://www.elsevier.com/authored_subject_sections/S03/Anniversary/EJOR_free1.pdf | http://www.elsevier.com/authored_subject_sections/S03/Anniversary/EJOR_free1.pdf | ||

+ | |||

+ | http://www.shodor.org/media/content//petascale/materials/UPModules/dynamicProgrammingCUDAPtII/moduleDocument_pdf.pdf | ||

+ | |||

+ | http://lpsolve.sourceforge.net/5.0/CPLEX-format.htm (Syntax Rules of LP File Format) | ||

+ | |||

+ | http://www.inf.fu-berlin.de/lehre/SS10/SP-Par/download/lp.pdf | ||

+ | |||

+ | http://www.google.ca/url?sa=t&rct=j&q=&esrc=s&source=web&cd=8&cad=rja&ved=0CFEQFjAH&url=http%3A%2F%2Fetna.mcs.kent.edu%2Fvol.28.2007-2008%2Fpp174-189.dir%2Fpp174-189.pdf&ei=Y3ORUIK5CKftygH8w4DQDw&usg=AFQjCNHO8JqPNO6nt_bXNmMZ53wBtfNuAQ (CUDA) | ||

+ | |||

+ | http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6062991&abstractAccess=no&userType=inst (CUDA) http://homepages.laas.fr/elbaz/4538a179.pdf | ||

+ | |||

+ | http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6009074&abstractAccess=no&userType=inst (CUDA) http://homepages.laas.fr/elbaz/PCO11.pdf | ||

+ | |||

+ | http://dpcs.uoc.edu/joomla/images/stories/workshop2012/presentations/t2/alvaro_garcia.pdf | ||

+ | |||

+ | http://code.google.com/p/cpplex/source/browse/trunk/simplex/#simplex%253Fstate%253Dclosed | ||

Amir and Michael | Amir and Michael | ||

Line 11: | Line 31: | ||

* simplex_exp.cpp | * simplex_exp.cpp | ||

− | we will focus on appoint and simplex_exp for our project of developing a fast approach for calculating simplex | + | we will focus on appoint and simplex_exp for our project of developing a fast approach for calculating simplex algorithms |

'''Application of Parallel computing in Simplex method''' | '''Application of Parallel computing in Simplex method''' | ||

− | # The first step is to find and use a reliable source code for simplex | + | # The first step is to find and use a reliable source code for simplex algorithm, in order to use it for linear programming problems. SoPlex is one the famous and reliable Open source LP Solvers in C++ Language. http://soplex.zib.de/ (Since SoPlex source code is so complicated to modify in order to use it as a DEA solver, we decided to you the opensource from http://code.google.com/p/cpplex/source/browse/trunk/simplex/#simplex%253Fstate%253Dclosed) |

− | + | # Next step is to learn how to work with Soplex. The following link shows an example of using SoPlex: http://disopt.epfl.ch/files/content/sites/disopt/files/shared/OptInFinance09/zimplfaq.pdf | |

+ | # After that, we are trying to understand the Revised Simplex method which is used by SoPlex and we will see how to modify it to solve a simple Multi-Criteria Decision Making problem with using DEA method. Because DEA method has various models and it has been developed and expanded so much since 1980's, we will work on Input Oriented CCR model as a starting point. | ||

− | + | == 7zip C Decompression == | |

− | |||

− | + | Resource Links: | |

+ | * 7zip project: http://sourceforge.net/projects/sevenzip/ | ||

+ | * source code: http://sourceforge.net/projects/sevenzip/files/7-Zip/9.22/7z922.tar.bz2/download |

## Latest revision as of 12:57, 6 December 2012

## Application of Parallel Computing in Linear Programming Problems

Resource Links:

http://www.wikihow.com/Use-the-Hungarian-Algorithm (Appoint, or Assignment Problem)

http://www.elsevier.com/authored_subject_sections/S03/Anniversary/EJOR_free1.pdf

http://lpsolve.sourceforge.net/5.0/CPLEX-format.htm (Syntax Rules of LP File Format)

http://www.inf.fu-berlin.de/lehre/SS10/SP-Par/download/lp.pdf

http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6062991&abstractAccess=no&userType=inst (CUDA) http://homepages.laas.fr/elbaz/4538a179.pdf

http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6009074&abstractAccess=no&userType=inst (CUDA) http://homepages.laas.fr/elbaz/PCO11.pdf

http://dpcs.uoc.edu/joomla/images/stories/workshop2012/presentations/t2/alvaro_garcia.pdf

http://code.google.com/p/cpplex/source/browse/trunk/simplex/#simplex%253Fstate%253Dclosed

Amir and Michael Posted three programs

- recursive.cpp
- appoint.cpp
- simplex_exp.cpp

we will focus on appoint and simplex_exp for our project of developing a fast approach for calculating simplex algorithms

**Application of Parallel computing in Simplex method**

- The first step is to find and use a reliable source code for simplex algorithm, in order to use it for linear programming problems. SoPlex is one the famous and reliable Open source LP Solvers in C++ Language. http://soplex.zib.de/ (Since SoPlex source code is so complicated to modify in order to use it as a DEA solver, we decided to you the opensource from http://code.google.com/p/cpplex/source/browse/trunk/simplex/#simplex%253Fstate%253Dclosed)
- Next step is to learn how to work with Soplex. The following link shows an example of using SoPlex: http://disopt.epfl.ch/files/content/sites/disopt/files/shared/OptInFinance09/zimplfaq.pdf
- After that, we are trying to understand the Revised Simplex method which is used by SoPlex and we will see how to modify it to solve a simple Multi-Criteria Decision Making problem with using DEA method. Because DEA method has various models and it has been developed and expanded so much since 1980's, we will work on Input Oriented CCR model as a starting point.

## 7zip C Decompression

Resource Links: