nvs16.gms:
References:
- Tawarmalani, M, and Sahinidis, N, Exact Algorithms for Global Optimization of Mixed-Integer Nonlinear Programs. In Pardalos, P M, and Romeijn, E, Eds, Handbook of Global Optimization - Volume 2: Heuristic Approaches. Kluwer Academic Publishers, 2001.
- Gupta, O K, and Ravindran, A, Branch and Bound Experiments in Convex Nonlinear Integer Programming. Management Science 13 (1985), 1533-1546.
Point:
p1
Best known point (p1): Solution value 0.70 (global optimum, BARON certificate)
<![CDATA[
$offlisting
* MINLP written by GAMS Convert at 07/24/02 13:01:18
*
* Equation counts
* Total E G L N X C
* 1 1 0 0 0 0 0
*
* Variable counts
* x b i s1s s2s sc si
* Total cont binary integer sos1 sos2 scont sint
* 3 1 0 2 0 0 0 0
* FX 0 0 0 0 0 0 0 0
*
* Nonzero counts
* Total const NL DLL
* 3 1 2 0
*
* Solve m using MINLP minimizing objvar;
Variables i1,i2,objvar;
Integer Variables i1,i2;
Equations e1;
e1.. - (sqr(1.5 - i1*(1 - i2)) + sqr(2.25 - i1*(1 - sqr(i2))) + sqr(2.625 - i1
*(1 - POWER(i2,3)))) + objvar =E= 0;
* set non default bounds
i1.up = 200;
i2.up = 200;
$if set nostart $goto modeldef
* set non default levels
i1.l = 1;
i2.l = 1;
* set non default marginals
$label modeldef
Model m / all /;
m.limrow=0; m.limcol=0;
$if NOT '%gams.u1%' == '' $include '%gams.u1%'
$if not set MINLP $set MINLP MINLP
Solve m using %MINLP% minimizing objvar;
]]></plaintext></body></div>