library for polynomially constrained
mixed-integer programming

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

Hard  slay05h

Problem typeMINLPLib2
Objective sensemin
Variables230  (40 binary, 0 general integer, 190 continuous)
Nonlinear variables190
Nonlinear constraints0
Linear nonzeros800
Nonlinear nonzeros40
Download slay05h.pip.gz slay05h.gms.gz slay05h.mod.gz
Best known solutionslay05h.sol.gz
Best known objective22664.7
Best known bound22664.7
OriginatorSLay05H.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