exmpl_9_3-1_shortestpath.gms
* NLP written by GAMS Convert at 06/27/07 15:16:39
*
* Equation counts
* Total E G L N X C
* 8 8 0 0 0 0 0
*
* Variable counts
* x b i s1s s2s sc si
* Total cont binary integer sos1 sos2 scont sint
* 13 13 0 0 0 0 0 0
* FX 0 0 0 0 0 0 0 0
*
* Nonzero counts
* Total const NL DLL
* 37 37 0 0
*
* Solve m using NLP minimizing objvar;
Variables x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,objvar;
Positive Variables x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12;
Equations e1,e2,e3,e4,e5,e6,e7,e8;
e1.. - x1 - x2 - x3 =E= -1;
e2.. x1 - x4 - x5 =E= 0;
e3.. x2 + x4 - x6 - x7 - x8 =E= 0;
e4.. x3 + x6 - x9 =E= 0;
e5.. x5 + x7 - x10 - x11 =E= 0;
e6.. x8 + x9 + x10 - x12 =E= 0;
e7.. x11 + x12 =E= 1;
e8.. - 2*x1 - 5*x2 - 4*x3 - 2*x4 - 7*x5 - x6 - 4*x7 - 3*x8 - 4*x9 - x10
- 5*x11 - 7*x12 + objvar =E= 0;
* set non default bounds
* 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;