# qpdegen is similar to nlpdegen. It has a quadratic objective,
# hence it is a convex QP with redundant constraints.
# written in AMPL by Yu-Ju Kuo and Hans D. Mittelmann, 6/2001
param N:=5;
param NH:=7;
param NG:=5;
var  X{i in 1..N}:=exp(abs(i));
minimize obj : X[1]**2+2.e0*X[2]**2+3.e0*X[3]**2+4.e0*X[4]**2+5.e0*X[5]**2
    +X[1]+0.5e0*X[2]+0.3e0*X[3]+0.1e0*X[4]+0.01e0*X[5];
s.t. hx1 :  X[1]-X[2]=0;
s.t. hx2 :  X[2]-X[3]=0;
s.t. hx3 :  X[3]-X[4]=0;
s.t. hx4 :  X[4]-X[5]=0;
s.t. hx5 :  X[1]-X[5]=0;
s.t. hx6 :  X[2]-X[4]=0;
s.t. hx7 :  X[3]-X[5]=0;
s.t. gi{i in 1..NG}:X[i]>=0;