MINLPLib
A Library of Mixed-Integer and Continuous Nonlinear Programming Instances
Home // Instances // Documentation // Download // Statistics
tls4 - point p2
Solution was obtained by a novel simplicial-approximation based algorithm (Goyal and Ierapetritou, 2003a, 2003b) in 6.57 CPU seconds. The same solutions is also obtained using GAMS/SBB with conopt2 as the nodesolver in 588.65 CPU sec. Goyal, V., and M.G. Ierapetritou: (2003a), MINLP Optimization using simplicial approximation method for classes of nonconvex problems, (Accepted for publication: Nonconvex Optimization and Its Applications), Kluwer Academic Publishers Goyal, V., and M.G. Ierapetritou: (2003b), Computational Experiences with a Simplicial-Approximation Based Algorithm for MINLP Optimization, (submitted for publication: Comp. & Chem. Eng.)
Formatsⓘ | gdx sol |
Added to libraryⓘ | 17 Jul 2003 |
Objective Valueⓘ | 9.300000 |
Infeasibilityⓘ | 0 |
Variables with value 0.0 are omitted in the following.
b1 1.000000000000000 b2 1.000000000000000 i5 49.000000000000000 i6 16.000000000000000 i7 1.000000000000000 i8 1.000000000000000 x9 9.000000000000000 x10 1.000000000000000 x11 9.000000000000000 x12 4.000000000000000 x13 1.000000000000000 x14 16.000000000000000 x15 4.000000000000000 x16 4.000000000000000 x17 4.000000000000000 x18 9.000000000000000 x19 1.000000000000000 x20 16.000000000000000 x21 9.000000000000000 x22 1.000000000000000 x23 9.000000000000000 x24 1.000000000000000 b30 1.000000000000000 b35 1.000000000000000 b47 1.000000000000000 b55 1.000000000000000 b58 1.000000000000000 b69 1.000000000000000 b72 1.000000000000000 b77 1.000000000000000 b82 1.000000000000000 b87 1.000000000000000 b96 1.000000000000000 b99 1.000000000000000 b103 1.000000000000000 objvar 9.300000000000001
Last updated: 2024-08-26 Git hash: 6cc1607f