POLIP

library for polynomially constrained
mixed-integer programming


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

Open  sssd25-08persp

Namesssd25-08persp
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables256  (224 binary, 0 general integer, 32 continuous)
Nonlinear variables32
Constraints65
Nonlinear constraints24
Linear nonzeros584
Nonlinear nonzeros72
Download sssd25-08persp.pip.gz sssd25-08persp.gms.gz sssd25-08persp.mod.gz
Best known solutionsssd25-08persp.sol.gz
Best known objective472099
Best known bound289962
Originator
FormulatorStefan Vigerske
DonatorStefan Vigerske
References Elhedli2006 GuenluekLinderoth2010 GuenluekLinderoth2012
Links MINLP Library 2
Additional informationStochastic Service System Design. Servers are modeled as M/M/1 queues, and a set of customers must be assigned to the servers which can be operated at different service levels. The objective is to minimize assignment and operating costs. Perspective reformulation of sssd25-08. Application: Service System Design

© by maintainers  |     |  imprint