Hello,
I am afraid setting the objective to zero is probably not the best
solution for Chris. He would like to have 'the current "best"
(feasible) solution' however setting the objective to zero yields the
first integer feasible which may not be a good solution.
Probably setting a gap limit woul
Hi, I am a grad student at UC Riverside. A few other students and I have
been working on an implementation of a new algorithm to solve linear
packing and covering problems. We are perhaps a couple of weeks from
finishing. Here is a link to the paper describing the new algorithm:
http://arxiv.org/ab
Thank you for the reply. I am reading an MPS-format file. Do you
know how to do it in that context?
Thanks,
Chris
On Jul 23, 2008, at 2:31 PM, Bruno Rosell i Gui wrote:
Hi!
Hello,
I'm using glpsol (glpk -4.29) and would like to get intermediate
solutions out into a file. My problem doe
Hi!
> Hello,
>
> I'm using glpsol (glpk -4.29) and would like to get intermediate
> solutions out into a file. My problem doesn't require an optimal
> solution, just a good one, so it would be very helpful for glpsol to
> output the current "best" (feasible) solution to a file so that I can
> get
Hello,
I'm using glpsol (glpk -4.29) and would like to get intermediate
solutions out into a file. My problem doesn't require an optimal
solution, just a good one, so it would be very helpful for glpsol to
output the current "best" (feasible) solution to a file so that I can
get at it mu
> I have a small problem and I want have the dual solution.
> But I find that the GLPK and LP-solve give me 2 different dual
> solution (the primal solution and the objective value is the same).
> Could someone help to explain the reason??
In column 'Marginal' the glpk simplex solver reports red
The attached file glpk_vfs.rb demonstrates using a Virtual File System to
produce input files for GLPK without the files being physically present on
disk. This approach has been used for frontending SQL databases and obtaing
data from the internet. Of course at the moment I'm more interested in
Attached is an earlier posting. The example is in glpk's examples directory,
called t1.cs, it could probably be better named in future releases
- Original Message -
From: "Nigel Galloway" <[EMAIL PROTECTED]>
To: help-glpk@gnu.org
Subject: [Help-glpk] C#, GLPK, and The Fundamental Theorem
I have a small problem and I want have the dual solution.
But I find that the GLPK and LP-solve give me 2 different dual solution (the
primal solution and the objective value is the same).
Could someone help to explain the reason??
( I give the mps file. )
Thanks
GLPK:
Problem:
No
