POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  slay07m

Nameslay07m
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables141  (84 binary, 0 general integer, 57 continuous)
Nonlinear variables57
Constraints165
Nonlinear constraints24
Linear nonzeros540
Nonlinear nonzeros142
Download slay07m.pip.gz slay07m.gms.gz slay07m.mod.gz
Best known solutionslay07m.sol.gz
Best known objective64748.8
Best known bound64748.8
OriginatorSLay07M.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