Re: [ojAlgo-user] Integer solver
Mathematics, linear algebra and optimisation
Brought to you by:
apete
From: Francisco V. <fra...@gm...> - 2013-02-22 11:48:17
|
The variables are binay and the X_111_19=-16 Also exits the folowing restriction: sum(X_i_j) = 1 The variables with problem are X_111_j, the variable X_112_j are ok. The result state are: OPTIMAL 295.5 This is a print of variables after solve 0 <= X_111_0: 0 (6.6) <= 1 0 <= X_111_1: 1 (5.8) <= 1 0 <= X_111_2: 1 (5) <= 1 0 <= X_111_3: 0 (4.2) <= 1 0 <= X_111_4: 1 (3.5) <= 1 0 <= X_111_5: 1 (2.9) <= 1 0 <= X_111_6: 1 (2.3) <= 1 0 <= X_111_7: 1 (1.9) <= 1 0 <= X_111_8: 1 (1.5) <= 1 0 <= X_111_9: 1 (1.2) <= 1 0 <= X_111_10: 1 (0.9) <= 1 0 <= X_111_11: 1 (0.7) <= 1 0 <= X_111_12: 1 (0.6) <= 1 0 <= X_111_13: 1 (0.6) <= 1 0 <= X_111_14: 1 (0.8) <= 1 0 <= X_111_15: 1 (1) <= 1 0 <= X_111_16: 1 (1.4) <= 1 0 <= X_111_17: 1 (2) <= 1 0 <= X_111_18: 1 (2.8) <= 1 0 <= X_111_19: -16 (3.6) <= 1 0 <= X_112_0: 0 (7.1) <= 1 0 <= X_112_1: 0 (6.1) <= 1 0 <= X_112_2: 0 (5.3) <= 1 0 <= X_112_3: 0 (4.5) <= 1 0 <= X_112_4: 0 (3.8) <= 1 0 <= X_112_5: 1 (3.1) <= 1 0 <= X_112_6: 0 (2.6) <= 1 0 <= X_112_7: 0 (2.1) <= 1 0 <= X_112_8: 0 (1.6) <= 1 0 <= X_112_9: 0 (1.3) <= 1 0 <= X_112_10: 0 (1) <= 1 0 <= X_112_11: 0 (0.8) <= 1 0 <= X_112_12: 0 (0.6) <= 1 0 <= X_112_13: 0 (0.5) <= 1 0 <= X_112_14: 0 (0.5) <= 1 0 <= X_112_15: 0 (0.6) <= 1 0 <= X_112_16: 0 (0.8) <= 1 0 <= X_112_17: 0 (1.2) <= 1 0 <= X_112_18: 0 (1.7) <= 1 0 <= X_112_19: 0 (2.4) <= 1 If you want I tell you more details of our model. Thanks. 2013/2/22 Anders Peterson <an...@op...> > I have no idea... > > Are you saying that you define a (mixed) integer linear program, and you > get solutions where some integer variables are not at integer values? > > Did you check the Optimisation.State? Does it indicate that the problem is > solved correctly? > > Can you supply me with a self-contained directly-runnable test case that > clearly demonstrates how you do things, what you expect to happen and what > actually happens. > > /Anders > > > On 22 feb 2013, at 12:14, Francisco Verdejo <fra...@gm...> > wrote: > > > Hi friends, > > We are using an integer linear programming. All the variables are > binary. The problem is that the result of some variables are distinct than > 0 and 1. > > Why is it? > > > > Thanks. > > > ------------------------------------------------------------------------------ > > Everyone hates slow websites. So do we. > > Make your web apps faster with AppDynamics > > Download AppDynamics Lite for free today: > > > http://p.sf.net/sfu/appdyn_d2d_feb_______________________________________________ > > ojAlgo-user mailing list > > ojA...@li... > > https://lists.sourceforge.net/lists/listinfo/ojalgo-user > > > > ------------------------------------------------------------------------------ > Everyone hates slow websites. So do we. > Make your web apps faster with AppDynamics > Download AppDynamics Lite for free today: > http://p.sf.net/sfu/appdyn_d2d_feb > _______________________________________________ > ojAlgo-user mailing list > ojA...@li... > https://lists.sourceforge.net/lists/listinfo/ojalgo-user > |