POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  slay06h

Nameslay06h
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables342  (60 binary, 0 general integer, 282 continuous)
Nonlinear variables282
Constraints435
Nonlinear constraints0
Linear nonzeros1200
Nonlinear nonzeros54
Download slay06h.pip.gz slay06h.gms.gz slay06h.mod.gz
Best known solutionslay06h.sol.gz
Best known objective32757
Best known bound32757
OriginatorSLay06H.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