POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  clay0303m

Nameclay0303m
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables36  (21 binary, 0 general integer, 15 continuous)
Nonlinear variables15
Constraints27
Nonlinear constraints39
Linear nonzeros92
Nonlinear nonzeros224
Download clay0303m.pip.gz clay0303m.gms.gz clay0303m.mod.gz
Best known solutionclay0303m.sol.gz
Best known objective26669.1
Best known bound26669.1
OriginatorCLay0303M.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