POLIP

library for polynomially constrained
mixed-integer programming


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

Open  squfl015-080persp

Namesqufl015-080persp
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables2415  (15 binary, 0 general integer, 2400 continuous)
Nonlinear variables2400
Constraints1280
Nonlinear constraints1200
Linear nonzeros4814
Nonlinear nonzeros2400
Download squfl015-080persp.pip.gz squfl015-080persp.gms.gz squfl015-080persp.mod.gz
Best known solutionsqufl015-080persp.sol.gz
Best known objective402.489
Best known bound402.484
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 squfl015-080. Application: Facility Location

© by maintainers  |     |  imprint