POLIP

library for polynomially constrained
mixed-integer programming


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

Open  squfl020-050

Namesqufl020-050
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables1020  (20 binary, 0 general integer, 1000 continuous)
Nonlinear variables1000
Constraints1050
Nonlinear constraints0
Linear nonzeros3000
Nonlinear nonzeros1019
Download squfl020-050.pip.gz squfl020-050.gms.gz squfl020-050.mod.gz
Best known solutionsqufl020-050.sol.gz
Best known objective230.202
Best known bound230.199
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