ex5_2_2_case1.gms:
References:
- Floudas, C A, Pardalos, P M, Adjiman, C S, Esposito, W R, Gumus, Z H, Harding, S T, Klepeis, J L, Meyer, C A, and Schweiger, C A, Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers, 1999.
- Haverly, C A, Studies of the Behavior of Recursion for the Pooling Problem. ACM SIGMAP Bull 25 (1978), 19-28.
- Original source: Global Model of Chapter 5 ex5.2.2_case1.gms from Floudas e.a. Test Problems
Point:
p1
Best known point: p1 with value -400.0000
<![CDATA[
* NLP written by GAMS Convert at 07/19/01 13:39:37
*
* Equation counts
* Total E G L N X
* 7 5 0 2 0 0
*
* Variable counts
* x b i s1s s2s sc si
* Total cont binary integer sos1 sos2 scont sint
* 10 10 0 0 0 0 0 0
* FX 0 0 0 0 0 0 0 0
*
* Nonzero counts
* Total const NL DLL
* 30 23 7 0
*
* Solve m using NLP minimizing objvar;
Variables x1,x2,x3,x4,x5,x6,x7,x8,x9,objvar;
Positive Variables x1,x2,x3,x4,x5,x6,x7,x8,x9;
Equations e1,e2,e3,e4,e5,e6,e7;
e1.. - 9*x1 - 15*x2 + 6*x3 + 16*x4 + 10*x5 + 10*x6 - objvar =E= 0;
e2.. - x3 - x4 + x8 + x9 =E= 0;
e3.. x1 - x5 - x8 =E= 0;
e4.. x2 - x6 - x9 =E= 0;
e5.. x7*x8 - 2.5*x1 + 2*x5 =L= 0;
e6.. x7*x9 - 1.5*x2 + 2*x6 =L= 0;
e7.. x7*x8 + x7*x9 - 3*x3 - x4 =E= 0;
* set non default bounds
x1.up = 100;
x2.up = 200;
x3.up = 500;
x4.up = 500;
x5.up = 500;
x6.up = 500;
x7.up = 500;
x8.up = 500;
x9.up = 500;
* set non default levels
* set non default marginals
Model m / all /;
m.limrow=0; m.limcol=0;
$if NOT '%gams.u1%' == '' $include '%gams.u1%'
Solve m using NLP minimizing objvar;
]]></plaintext></body></div>