POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  nvs11

Namenvs11
Classificationc|bi|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables3  (0 binary, 3 general integer, 0 continuous)
Nonlinear variables0
Constraints0
Nonlinear constraints3
Linear nonzeros0
Nonlinear nonzeros25
Download nvs11.pip.gz nvs11.gms.gz nvs11.mod.gz
Best known solutionnvs11.sol.gz
Best known objective-431
Best known bound-431
OriginatorNick Sahinidis Models of Gupta and Ravindran
FormulatorStefan Vigerske
DonatorStefan Vigerske
References TawarmalaniSahinidis2002 BrookeDrudMeeraus1985
Links MINLP Library 2
Additional information

© by maintainers  |     |  imprint