POLIP

library for polynomially constrained
mixed-integer programming


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

Open  squfl010-040

Namesqufl010-040
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables410  (10 binary, 0 general integer, 400 continuous)
Nonlinear variables400
Constraints440
Nonlinear constraints0
Linear nonzeros1200
Nonlinear nonzeros410
Download squfl010-040.pip.gz squfl010-040.gms.gz squfl010-040.mod.gz
Best known solutionsqufl010-040.sol.gz
Best known objective240.599
Best known bound240.597
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