# Difference between revisions of "Parallel Linear Programmers"

Idshibanov (talk | contribs) |
Idshibanov (talk | contribs) |
||

Line 1: | Line 1: | ||

− | |||

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

## Revision as of 15:10, 27 November 2012

## Application of Parallel Computing in Linear Programming Problems

Resource Links: 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://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6062991&abstractAccess=no&userType=inst

http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6009074&abstractAccess=no&userType=inst

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 algorithims

**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

## 7zip C Decompression

Resource Links: