[Scip] ZPL reader / Solution process deterministic?

[Thorsten Koch]

Hi Moritz,

Am 09.09.2010 08:34, schrieb Moritz Drexl:
> Hi all and thanks for answering my last question!
>  
> I have two more questions:
>  
> 1) I noticed that when reading my zimpl files directly in scip (via read file.zpl) the LPs get solved faster than with the indirect version where I generate an .lp file first and then read it in scip (read file.lp). What does the zimpl file reader do that zimpl itself doesn't do (or vice versa)?

if you read the zimpl model directly, some rows or columns may be
permutated compared to the generated .lp file.
This can lead (depending on the model) to quite different solver runs.
This is known and to a certain degree
unavoidable.

> 
> 2) I was wondering whether the solution process of scip is deterministic if all input and parameters are constant, or maybe if there is some randomness involved in choosing heuristics/branching rules/etc. If so, is there a way to make scip run deterministically?
> 
It should be deterministic if there are no bugs (uninitialized
variables) and the cpu behaves deterministic in the above sense.

Best regards,
Thorsten


> Regards,
> Moritz
> 
> 
> _______________________________________________
> Scip mailing list
> Scip at zib.de
> http://listserv.zib.de/mailman/listinfo/scip

-- 
The important thing is not to stop questioning.
Curiosity has its own reason for existing.          -- Albert Einstein
______________________________________________________________________
Dr. Thorsten Koch / Konrad-Zuse-Zentrum für Informationstechnik Berlin
www.zib.de/koch  /          Takustraße 7, 14195 Berlin-Dahlem, Germany
koch at zib.de     /                     Phone +49-30-84185-213, Fax -269
_______________/  DFG Research Center "Matheon"  http://www.matheon.de

Kooperativer Bibliotheksverbund Berlin Brandenburg  http://www.kobv.de
______________________________________________________________________