POLIP

library for polynomially constrained
mixed-integer programming


polip :: contents / contributors / instances / archive / bibliography

Hard  slay06m

Nameslay06m
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables103  (60 binary, 0 general integer, 43 continuous)
Nonlinear variables43
Constraints118
Nonlinear constraints17
Linear nonzeros386
Nonlinear nonzeros105
Download slay06m.pip.gz slay06m.gms.gz slay06m.mod.gz
Best known solutionslay06m.sol.gz
Best known objective32757
Best known bound32757
OriginatorSLay06M.gms from CMU-IBM MINLP project page
FormulatorStefan Vigerske
DonatorStefan Vigerske
References Sawaya2006
Links MINLP Library 2
Additional informationDetermine the optimal placement of a set of units with fixed width and length such that the Euclidean distance between their center point and a predefined "safety point" is minimized. Application: Layout

© by maintainers  |     |  imprint