# SP7 is a QP-problem with 5 redundant constraints at the solution
# written in AMPL by Yu-Ju Kuo and Hans D. Mittelmann, 6/2001
param N;
param NH;
param NG;
var X{1..N}:=0;
minimize obj:0.5D0*(X[1]**2+X[2]**2+X[3]**2+X[4]**2);
s.t. hx1:X[4]-X[1]-X[2]=0;  
s.t. gx1: X[4]+X[3]-3.D0>=0;
s.t. gx2: 2.D0*X[4]+X[3]-5.D0>=0;
s.t. gx3: X[4]+2.D0*X[3]-4.D0>=0;
s.t. gx4{i in 4..6}: X[i-3]-1.D0>=0;
s.t. gx7:X[4]-2.e0>=0;

data;
param N:=4;
param NH:=1;
param NG:=7;