Re: [ojAlgo-user] Knapsack problem

[Anders P. <an...@op...>]

Try using

http://ojalgo.org/generated/org/ojalgo/optimisation/linear/LinearExpressionsModel.html

The MIP solver is experimental, but there has been success reports.

/Anders


On 3 mar 2010, at 17.19, Luke Lindsay wrote:

> I am looking to solve the following type of problem..
> 
> There is a seller who has different quantities of number of types of
> good A, B,C,D...  A number of buyers make the seller offers, e.g "$190
> for 2 units of good A and 1 unit of good B" and the seller has to
> decide which offers to accept in order to maximize revenue.
> 
> Is ojalgo suited to solving this type of problem and if so can you
> give me any pointers on how to get started or point me towards
> anything I should read.
> 
> Any help greatly appreciated,
> 
> Luke
> 
> ------------------------------------------------------------------------------
> Download Intel® Parallel Studio Eval
> Try the new software tools for yourself. Speed compiling, find bugs
> proactively, and fine-tune applications for parallel performance.
> See why Intel Parallel Studio got high marks during beta.
> http://p.sf.net/sfu/intel-sw-dev
> _______________________________________________
> ojAlgo-user mailing list
> ojA...@li...
> https://lists.sourceforge.net/lists/listinfo/ojalgo-user
> 
>