POLIP

library for polynomially constrained
mixed-integer programming


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

Open  squfl030-150persp

Namesqufl030-150persp
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables9030  (30 binary, 0 general integer, 9000 continuous)
Nonlinear variables9000
Constraints4650
Nonlinear constraints4500
Linear nonzeros18024
Nonlinear nonzeros9000
Download squfl030-150persp.pip.gz squfl030-150persp.gms.gz squfl030-150persp.mod.gz
Best known solutionsqufl030-150persp.sol.gz
Best known objective430.577
Best known bound148.13
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 squfl030-150. Application: Facility Location

© by maintainers  |     |  imprint