[GAP Forum] Two questions

[Dmitrii Pasechnik]

lpsolve, being a "classical" implementation of the simplex method, does not
do exact rational (i.e. arbitrary precision rational) simplex. Thus it does
not scale too well, e.g., on inputs arising in coding theory (computing
Delsarte bound, for instance).

HTH,
Dmitrii 


On 11/27/07 6:59 PM, "Kasper Andersen" <kksa at math.ku.dk> wrote:

> Dear Forum and dear Gabor,
> 
> For linear programming I can strongly recommend Michel Berkelaar's lpsolve
> program.
> 
> best, Kasper Andersen
> 
> 
> On Tue, 27 Nov 2007, Gábor Nagy wrote:
> 
>> Dear Forum,
>> 
>> I have the following questions.
>> 
>> 1) Is there a way to access the character table of the general symmetric
>> group? It seems to me that the tables are only stored up to n=18.
>> 
>> 2) I would like to use linear programming in GAP. Before I start implementing
>> the simplex method in GAP, I would like to ask if anybody has done it before?
>> This could save me some time. :-)
>> 
>> Actually, I already made a very simple GAP interface to Maxima to solve
>> linear programs. If somebody is interested, he/she can contact me.
>> Unfortunately, I am not impressed by Maxima's speed.
>> 
>> BTW, I am interested in any kind of implementation of fast exact rational
>> simplex method.
>> 
>> Thanks,
>> 
>> Gabor
>> 
>> _______________________________________________
>> Forum mailing list
>> Forum at mail.gap-system.org
>> http://mail.gap-system.org/mailman/listinfo/forum
>> 
> _______________________________________________
> Forum mailing list
> Forum at mail.gap-system.org
> http://mail.gap-system.org/mailman/listinfo/forum

-- 
Dima Pasechnik
http://www.ntu.edu.sg/home/dima/