POLIP

library for polynomially constrained
mixed-integer programming


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

Open  squfl025-040persp

Namesqufl025-040persp
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables2025  (25 binary, 0 general integer, 2000 continuous)
Nonlinear variables2000
Constraints1040
Nonlinear constraints1000
Linear nonzeros4022
Nonlinear nonzeros2000
Download squfl025-040persp.pip.gz squfl025-040persp.gms.gz squfl025-040persp.mod.gz
Best known solutionsqufl025-040persp.sol.gz
Best known objective197.334
Best known bound197.332
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 squfl025-040. Application: Facility Location

© by maintainers  |     |  imprint