POLIP

library for polynomially constrained
mixed-integer programming


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

Open  squfl020-040persp

Namesqufl020-040persp
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables1620  (20 binary, 0 general integer, 1600 continuous)
Nonlinear variables1600
Constraints840
Nonlinear constraints800
Linear nonzeros3219
Nonlinear nonzeros1600
Download squfl020-040persp.pip.gz squfl020-040persp.gms.gz squfl020-040persp.mod.gz
Best known solutionsqufl020-040persp.sol.gz
Best known objective209.255
Best known bound209.253
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 squfl020-040. Application: Facility Location

© by maintainers  |     |  imprint