POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  slay04m

Nameslay04m
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables45  (24 binary, 0 general integer, 21 continuous)
Nonlinear variables21
Constraints48
Nonlinear constraints6
Linear nonzeros156
Nonlinear nonzeros46
Download slay04m.pip.gz slay04m.gms.gz slay04m.mod.gz
Best known solutionslay04m.sol.gz
Best known objective9859.66
Best known bound9859.66
OriginatorSLay04M.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