# Efficient and fast way of solving linear programming problems in R

 1 I am working with a very large dataset, typically dealing with a few millions of combinations. I want to solve the assignment problem.(maximise the sum) I had tried solving it on a small test set using adagio::assignment, clue::solve_LSAP I wasnt able to successfully install the "lpSolve" package on my system, threw some segmentation fault Wanted to know which of these is faster or any other method which does it faster. Thanks.... asked 24 Oct '14, 14:35 abcdef 11●1●2 accept rate: 0%

 1 Take a look at: In addition to the lpSolve package [and the specialized solvers you mentioned], you can choose – in the "realm" of OSS – from glpkAPI and Rsymphony; and, furthermore, "major players" from the commercial domain [CPLEX, Gurobi, MOSEK] also provide interfaces to their solvers [hint: you might want to check if you're eligible for an academic license – or, if you are not, try to get hold of an evaluation copy]. answered 24 Oct '14, 15:21 fbahr ♦ 4.6k●7●16 accept rate: 13%
 1 I once did a comparison between LSAP and Gurobi: http://yetanothermathprogrammingconsultant.blogspot.com/2009/11/assignment-problem.html answered 24 Oct '14, 19:27 erwin 401●1●3 accept rate: 10%
 0 For an open-source option, check https://projects.coin-or.org/Clp. answered 25 Oct '14, 17:00 Matthew Salt... ♦ 4.7k●3●10 accept rate: 17%
 toggle preview community wiki

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "Title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported

Tags: