POLIP

library for polynomially constrained
mixed-integer programming


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

Open  squfl015-060

Namesqufl015-060
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables915  (15 binary, 0 general integer, 900 continuous)
Nonlinear variables900
Constraints960
Nonlinear constraints0
Linear nonzeros2700
Nonlinear nonzeros914
Download squfl015-060.pip.gz squfl015-060.gms.gz squfl015-060.mod.gz
Best known solutionsqufl015-060.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. Application: Facility Location

© by maintainers  |     |  imprint