Yuriy Zinchenko

ps: with respect how the crossover comes into play, if the model is degenerate, the algorithmic path alone will determine the values here. From a user point of view this may seem like the outcome d...

Hi Elena, to chirp in here, most likely your dual is what is called degenerate, that is, admits several solutions, in which case you may see some surpassing values coming up as well as should proba...

Hello again, Andrey. Thank you again for asking an interesting Q.  The problem instance you have shared is small, but is seemingly tough to determine feasibility.  Our apologies for not replying so...

Great to hear this is helpful. Stay well, Ramy, and please say "hello" to John if you run into him; he may remember Yuriy who was a PDF at McMaster when Professor Chinneck visited. Regards.

Hello Ramy, Thanks for asking! :) 1. For LP, computing all III's based on the dual, as you said, is equivalent to enumerating all the vertices of the respective dual polyhedron, which could be a ma...

Hello Taejoon, 1) for a polytope {x: Ax <= b} the analytic centre x* is computed as a minimizer of the log-barrier,  x* = arg min { -\sum_i (b - Ax)_i : Ax <= b } Now, if LP has multiple solutions,...

Hello Bo:   we do apply dual transformation automatically (in some cases), specifically, indeed, when A is "long and narrow" we would look into that with the code. In other words, the matrix "aspec...

Hello Yannic: barHomogeneous = 1 parameter refers to using the so-called homogeneous self-dual embedding that amongst other things allows to set the initial point for the barrier (the other alterna...

Hi Geoffroy, could you please elaborate on > I do not find the same values as the latest displayed by the Barrier Logging perhaps with the snapshot of the log, and a brief explanation on how check ...

Hi Dominique, sorry I have somehow missed your Q:( and thank you Jarek! (yes, we do scale) Wish you stay well in 2021!! (we are fine in Calgary, it is a bit cold now, about -30C, but no complains o...