active set methods/ BFGS-grg : user defined

Please specify here the piece of code for computing the objective function, following the rules specified here
Important: the variables are x(j), j=1,...,n, the result is fx.
You may use local variables y(1),....,y(100), already initialized by zero, the integer variables i, j, k and the logicals bool1, bool2 and bool3.
You cannot define other variables yourself.
FX=X(1)*X(2)+X(3)*X(4)+ * X(5)**2

Please type the piece of code for computing your inequality constraints (if any) in the textarea below, following the rules specified here.
Important : the variable names are i and x(j), j=1,...,n, the result is always gxi.
You may use local variables y(1),....,y(100), already initialized by zero, the integer variables j, k and the logical variables bool1, bool2 and bool3.
You cannot define local variables yourself.
Attention : usually you will have many inequality constraints and which one is to be computed is specified by i. The name of the result however is always gxi. You must never change i or x, otherwise nonsense will occur.
How this is managed can be seen from the example below, which is for ng=5
GOTO ( 100 , 200 , 300 , 400 , 500 ) I C DAS IST FUER NG=5 100 CONTINUE GXI=x(1)+1.0d0 RETURN 200 CONTINUE GXI=-x(1)+2.d0 RETURN 300 CONTINUE GXI=x(2)+2.d0 RETURN 400 CONTINUE GXI=-x(2)+1.d0 RETURN 500 CONTINUE GXI=x(5) RETURN

Here you have the possibility to declare your inequality constraints which have the form ''constant + integer constant*variable'' or ''constant-integer constant*variable'' as bound constraints, which get special treatment in some situations.
Each such constraint is characterized by three integers: its index i, (the value by which it is selected), the index of the variable, x(j), and the integer constant which multiplies it. You may leave this field empty. The entries below are for the example above, where only bounds are present.

Please type the piece of code for computing the equality constraints in the textarea below. Important: the input variables are i and x(j), j=1,...,n, the result is hxi.
There will be different branches for this, normally, depending on i. How to do this is described in detail here, but it may suffice to look at the example below, which is for two equality constraints. Never change x or i, we have ''call by name'' here! You may make use of local variables (for intermediate storage e.g.) y(1),....,y(100), already initialized with 0, the counting variables j, k and the logicals bool1, bool2, bool3. Remember the special role of the first 6 columns! You cannot define variables yourself.
GOTO ( 100 , 200 ) I C nh=2 100 CONTINUE HXI=X(1)**2+X(2)**2+X(1)*X(2)-1.D0 RETURN 200 CONTINUE HXI=X(3)*X(4)-1.D0 RETURN