POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  clay0205m

Nameclay0205m
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables83  (50 binary, 0 general integer, 33 continuous)
Nonlinear variables33
Constraints86
Nonlinear constraints49
Linear nonzeros292
Nonlinear nonzeros265
Download clay0205m.pip.gz clay0205m.gms.gz clay0205m.mod.gz
Best known solutionclay0205m.sol.gz
Best known objective8092.5
Best known bound8092.5
OriginatorCLay0205M.gms from CMU-IBM MINLP project page
FormulatorStefan Vigerske
DonatorStefan Vigerske
References Sawaya2006
Links MINLP Library 2
Additional informationNon overlapping rectangular units must be placed within the confines of certain designated areas such that the cost of connecting these units is minimized. Application: Layout

© by maintainers  |     |  imprint