POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  sssd08-04persp

Namesssd08-04persp
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables60  (44 binary, 0 general integer, 16 continuous)
Nonlinear variables16
Constraints28
Nonlinear constraints12
Linear nonzeros140
Nonlinear nonzeros36
Download sssd08-04persp.pip.gz sssd08-04persp.gms.gz sssd08-04persp.mod.gz
Best known solutionsssd08-04persp.sol.gz
Best known objective182023
Best known bound182023
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 sssd08-04. Application: Service System Design

© by maintainers  |     |  imprint