Automatic constraint propagation and linearization methods in SIMONEK

This article deals with manual and automatic constraint propagation, orthogonalization and linearization used to reduce search space in a particular modeling environment. Meanwhile, it presents industrial and educational scheduling problems. The article introduces the SIMONEK modeling language, some heuristics and search techniques, and deals with some automatically obtainable constraints. Examples of solving the presented problems and a remodeled ILP problem are also presented. Finally, common methods to formulate linear models from non-linear real-world problems in the particular modeling language are presented.