POLIP

library for polynomially constrained
mixed-integer programming


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

Open  squfl015-060persp

Namesqufl015-060persp
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables1815  (15 binary, 0 general integer, 1800 continuous)
Nonlinear variables1800
Constraints960
Nonlinear constraints900
Linear nonzeros3614
Nonlinear nonzeros1800
Download squfl015-060persp.pip.gz squfl015-060persp.gms.gz squfl015-060persp.mod.gz
Best known solutionsqufl015-060persp.sol.gz
Best known objective366.622
Best known bound366.62
Originator
FormulatorStefan Vigerske
DonatorStefan Vigerske
References GuenluekLeeWeismantel2007 GuenluekLinderoth2010 GuenluekLinderoth2012
Links MINLP Library 2
Additional information Separable quadratic uncapacitated facility location problem. A set of customers, each having unit demand, has to be satisfied by open facilities. The objective is to minimize the sum of the fixed cost for operating facilities and the shipping cost which is proportional to the square of the quantity delivered to each customer. Perspective reformulation of squfl015-060. Application: Facility Location

© by maintainers  |     |  imprint