> A bit tedious when there are many solutions though. When I read about
> logilab-constraint at [http://www.logilab.org/card/eid/3441], I noticed
> that the solver was said to provide 64 solutions to the sample problem
> described there. Maybe they use a very different kind of solver.
Looks like t
Try scip, which can give you all solutions. It's free for academic or
personal use,as far as I know
Sent from my iPhone
On Nov 3, 2009, at 10:10 AM, Erik wrote:
I have been searching around for a program to find solutions to little
problems like this: An item of meat costs 160. An item of f
Below here are glpk 4.40 benchmarks for MIPLIB 2.0. All instances
(except three hard ones) were solved to optimality with the hybrid
pseudocost branching.
Solver: GLPSOL 4.40 (options used: --pcost)
Computer: Intel Pentium 4, 3.0 GHz
Platform: Cygwin 1.5.25
Compiler: GCC 3.4.4 (options used: -
> I have been searching around for a program to find solutions to little
> problems like this: An item of meat costs 160. An item of fish costs 30.
> An item of milk costs 15. Someone spent 700 and bought at most 6 items.
> What did he buy?
> What I want is to just input some constraints:
> k * 1
Andrew Makhorin skrev:
> The glpk mip solver is not intended to find all optimal or integer
> feasible solutions. However, once you have found one solution, you may
> add an additional constraint to cut off corresponding point; this
> allows you to find an alternate solution, if it exists.
>
Go
I have been searching around for a program to find solutions to little
problems like this: An item of meat costs 160. An item of fish costs 30.
An item of milk costs 15. Someone spent 700 and bought at most 6 items.
What did he buy?
What I want is to just input some constraints:
k * 160 + m * 30
The example at [glpk-4.35/examples/huge.mod] mentions "constrint matrix"
but "constrint" does not seem like a word.
___
Help-glpk mailing list
Help-glpk@gnu.org
http://lists.gnu.org/mailman/listinfo/help-glpk
> I looked at the example in glpk-4.35/examples/bpp.mod. The description
> says "we put items into a bin until it is possible" but that does not
> really make sense to me. It would make sense if "until" was replaced
> with "as long as". Then "the number of bin used" would sound better with
> an 's'
I looked at the example in glpk-4.35/examples/bpp.mod. The description
says "we put items into a bin until it is possible" but that does not
really make sense to me. It would make sense if "until" was replaced
with "as long as". Then "the number of bin used" would sound better with
an 's' after "bi
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
GLPK 4.40 -- Release Information
Release date: Nov 03, 2009
GLPK (GNU Linear Programming Kit) is intended for solving large-scale
linear programming (LP), mixed integer linear programming (MIP), and
other related prob
10 matches
Mail list logo
