Example program for dgglse

This example solves the least squares problem
minimize x c-Ax2   subject to   Bx=d  
where
c = -1.50 -2.14 1.23 -0.54 -1.68 0.82 ,  
A = -0.57 -1.28 -0.39 0.25 -1.93 1.08 -0.31 -2.14 2.30 0.24 0.40 -0.35 -1.93 0.64 -0.66 0.08 0.15 0.30 0.15 -2.13 -0.02 1.03 -1.43 0.50 ,  
B = 1.0 0 -1.0 0 0 1.0 0 -1.0  
and
d = 0 0 .  
The constraints Bx=d  correspond to x1 = x3  and x2 = x4 .