POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  slay05m

Nameslay05m
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables71  (40 binary, 0 general integer, 31 continuous)
Nonlinear variables31
Constraints78
Nonlinear constraints12
Linear nonzeros255
Nonlinear nonzeros77
Download slay05m.pip.gz slay05m.gms.gz slay05m.mod.gz
Best known solutionslay05m.sol.gz
Best known objective22664.7
Best known bound22664.7
OriginatorSLay05M.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