POLIP

library for polynomially constrained
mixed-integer programming


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

Open  squfl030-100

Namesqufl030-100
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables3030  (30 binary, 0 general integer, 3000 continuous)
Nonlinear variables3000
Constraints3100
Nonlinear constraints0
Linear nonzeros9000
Nonlinear nonzeros3030
Download squfl030-100.pip.gz squfl030-100.gms.gz squfl030-100.mod.gz
Best known solutionsqufl030-100.sol.gz
Best known objective363.094
Best known bound123.989
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