On Thursday, June 11, 2015 at 11:02:40 PM UTC+3, Luke Pebody wrote:
Indeed I did. The linear programming library I used did not give accurate
enough answers on the small data set to pass, so I solved the dual problem
instead, which turned out to be quite easy.
On Tue, Jun 9, 2015 at 9:50
Check out my (linguo, 36th) solution to C-Large. Python solution using
linear programming tool. Make that runnable on your machine and you could
do the same.
On 10 Jun 2015 09:38, bigOnion haibren...@gmail.com wrote:
On Wednesday, June 10, 2015 at 10:16:19 AM UTC+3, M.H. wrote:
I know that
Indeed I did. The linear programming library I used did not give accurate
enough answers on the small data set to pass, so I solved the dual problem
instead, which turned out to be quite easy.
On Tue, Jun 9, 2015 at 9:50 PM, Edward Lockhart edward.lockh...@gmail.com
wrote:
Yes - see for example
1. Do you know if octave and GLPK run smoothly on windows?
Yes, both of them run on Windows, however I experienced several
'corner-cases'. E.g., I am not aware if modern Octave GUI (introduced in
3.8.x) is already available for Windows without Cygwin. I also had some
problems with running it on
I know that obviously coding a solution to LP is much harder than the
simple analysis of this specific problem.
I think, GNU Octave + GLPK are acceptable tools in this contest (as both of
them are open-source and free), so solving a LP (and MILP) problem is as
hard as filling three matrices and
On Wednesday, June 10, 2015 at 10:16:19 AM UTC+3, M.H. wrote:
I know that obviously coding a solution to LP is much harder than the
simple analysis of this specific problem.
I think, GNU Octave + GLPK are acceptable tools in this contest (as both of
them are open-source and free), so
On Wednesday, June 10, 2015 at 2:37:00 PM UTC+3, M.H. wrote:
1. Do you know if octave and GLPK run smoothly on windows?
Yes, both of them run on Windows, however I experienced several
'corner-cases'. E.g., I am not aware if modern Octave GUI (introduced in
3.8.x) is already available for
During round 2 I recognized that problem B can be described as a Linear
Programming problem.
There are two restrictions:
R_1 * t_1 + ... + R_n * t_n = V
C_1 * R_1 * t_1 + ... + C_n * R_n * t_n = V * X
t_1, ..., t_n are all non-negative
Finally the objective is:
Minimize (max{t_1, ..., t_n} )
Yes - see for example linguo's solution.
He solved bilingual as an integer linear programming problem too.
Edward
On 9 Jun 2015, at 21:09, bigOnion haibren...@gmail.com wrote:
During round 2 I recognized that problem B can be described as a Linear
Programming problem.
There are two
