## ojalgo-user — For ojAlgo users

You can subscribe to this list here.

2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 Jan Feb Mar Apr May Jun (1) Jul (1) Aug Sep Oct Nov Dec Jan Feb (1) Mar Apr (14) May (1) Jun (1) Jul Aug Sep Oct (1) Nov Dec (1) Jan (3) Feb Mar Apr May Jun (1) Jul Aug (1) Sep (3) Oct Nov Dec (1) Jan (1) Feb (1) Mar (1) Apr May (1) Jun (2) Jul Aug (5) Sep Oct (3) Nov (4) Dec (2) Jan (8) Feb (1) Mar (2) Apr (11) May (6) Jun Jul (10) Aug (2) Sep Oct (4) Nov Dec (11) Jan (22) Feb (4) Mar (2) Apr (4) May (2) Jun Jul Aug (1) Sep Oct (6) Nov (17) Dec (5) Jan (15) Feb (2) Mar (2) Apr (3) May (4) Jun (5) Jul (9) Aug (2) Sep Oct (5) Nov (14) Dec Jan (3) Feb (5) Mar (2) Apr (19) May Jun Jul Aug (2) Sep Oct (5) Nov (3) Dec Jan Feb (1) Mar (7) Apr (10) May (1) Jun (15) Jul (1) Aug Sep Oct (13) Nov (9) Dec (11) Jan Feb (1) Mar (9) Apr (23) May (16) Jun (9) Jul (13) Aug Sep (4) Oct (1) Nov (1) Dec Jan Feb (12) Mar (7) Apr (24) May Jun (7) Jul (4) Aug Sep (3) Oct (16) Nov (7) Dec (3) Jan (22) Feb (1) Mar (1) Apr May (2) Jun (3) Jul (4) Aug (4) Sep (1) Oct (2) Nov (6) Dec (2)
S M T W T F S

1

2

3
(2)
4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

Showing 2 results of 2

 Re: [ojAlgo-user] Knapsack problem From: Anders Peterson - 2010-03-03 21:57:02 ```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 > ojAlgo-user@... > https://lists.sourceforge.net/lists/listinfo/ojalgo-user > > ```
 [ojAlgo-user] Knapsack problem From: Luke Lindsay - 2010-03-03 16:19:09 ```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 ```

Showing 2 results of 2