more advices on using lp_solve

doc/starpu.texi

@@ -1130,9 +1130,13 @@ The @code{deps} parameter tells StarPU whether to take tasks and implicit data
 dependencies into account. It must be understood that the linear programming
 problem size is quadratic with the number of tasks and thus the time to solve it
 will be very long, it could be minutes for just a few dozen tasks. You should
-probably use @code{lp_solve} to convert the problem to MPS format and then
+probably use @code{lp_solve -timeout 1 test.pl -wmps test.mps} to convert the
+problem to MPS format and then
 use a better solver, @code{glpsol} might be better than @code{lp_solve} for
-instance (the @code{--pcost} option may be useful), but sometimes doesn't manage to converge. Be sure to try all the @code{-B} options of @code{lp_solve}. For instance, we often just use @code{lp_solve -cc -B1 -Bb -Bg -Bp -Bf -Br -BG -Bd -Bs -BB -Bo -Bc -Bi}.
+instance (the @code{--pcost} option may be useful), but sometimes doesn't manage
+to converge. Be sure to try all the @code{-B} options of @code{lp_solve}. For
+instance, we often just use @code{lp_solve -cc -B1 -Bb -Bg -Bp -Bf -Br -BG -Bd
+-Bs -BB -Bo -Bc -Bi} , and the @code{-gr} option can be quite useful.
 
 Setting @code{deps} to 0 will only take into account the actual computations
 on processing units. It however still properly takes into account the varying