1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
|
<?xml version="1.0" encoding="UTF-8"?>
<!--
*
* This help file was generated from fgoalattain.sci using help_from_sci().
*
-->
<refentry version="5.0-subset Scilab" xml:id="fgoalattain" xml:lang="en"
xmlns="http://docbook.org/ns/docbook"
xmlns:xlink="http://www.w3.org/1999/xlink"
xmlns:svg="http://www.w3.org/2000/svg"
xmlns:ns3="http://www.w3.org/1999/xhtml"
xmlns:mml="http://www.w3.org/1998/Math/MathML"
xmlns:scilab="http://www.scilab.org"
xmlns:db="http://docbook.org/ns/docbook">
<refnamediv>
<refname>fgoalattain</refname>
<refpurpose>Solves a multiobjective goal attainment problem</refpurpose>
</refnamediv>
<refsynopsisdiv>
<title>Calling Sequence</title>
<synopsis>
x = fgoalattain(fun,x0,goal,weight)
x = fgoalattain(fun,x0,goal,weight,A,b)
x = fgoalattain(fun,x0,goal,weight,A,b,Aeq,beq)
x = fgoalattain(fun,x0,goal,weight,A,b,Aeq,beq,lb,ub)
x = fgoalattain(fun,x0,goal,weight,A,b,Aeq,beq,lb,ub,nonlcon)
x = fgoalattain(fun,x0,goal,weight,A,b,Aeq,beq,lb,ub,nonlcon,options)
[x,fval] = fgoalattain(...)
[x,fval,attainfactor] = fgoalattain(...)
[x,fval,attainfactor,exitflag] = fgoalattain(...)
[x,fval,attainfactor,exitflag,output] = fgoalattain(...)
[x,fval,attainfactor,exitflag,output,lambda] = fgoalattain(...)
</synopsis>
</refsynopsisdiv>
<refsection>
<title>Parameters</title>
<variablelist>
<varlistentry><term>fun:</term>
<listitem><para> a function that accepts a vector x and returns a vector F</para></listitem></varlistentry>
<varlistentry><term>x0:</term>
<listitem><para> a nx1 or 1xn matrix of double, where n is the number of variables.</para></listitem></varlistentry>
<varlistentry><term>A:</term>
<listitem><para> a nil x n matrix of double, where n is the number of variables and</para></listitem></varlistentry>
<varlistentry><term>b:</term>
<listitem><para> a nil x 1 matrix of double, where nil is the number of linear</para></listitem></varlistentry>
<varlistentry><term>Aeq:</term>
<listitem><para> a nel x n matrix of double, where n is the number of variables</para></listitem></varlistentry>
<varlistentry><term>beq:</term>
<listitem><para> a nel x 1 matrix of double, where nel is the number of linear</para></listitem></varlistentry>
<varlistentry><term>lb:</term>
<listitem><para> a nx1 or 1xn matrix of double, where n is the number of variables.</para></listitem></varlistentry>
<varlistentry><term>ub:</term>
<listitem><para> a nx1 or 1xn matrix of double, where n is the number of variables.</para></listitem></varlistentry>
<varlistentry><term>nonlcon:</term>
<listitem><para> a function, the nonlinear constraints</para></listitem></varlistentry>
<varlistentry><term>options :</term>
<listitem><para> a list, containing the option for user to specify. See below for details.</para></listitem></varlistentry>
<varlistentry><term>x:</term>
<listitem><para> a nx1 matrix of double, the computed solution of the optimization problem</para></listitem></varlistentry>
<varlistentry><term>fval:</term>
<listitem><para> a vector of double, the value of functions at x</para></listitem></varlistentry>
<varlistentry><term>attainfactor:</term>
<listitem><para> The amount of over- or underachievement of the goals,γ at the solution.</para></listitem></varlistentry>
<varlistentry><term>exitflag:</term>
<listitem><para> a 1x1 matrix of floating point integers, the exit status</para></listitem></varlistentry>
<varlistentry><term>output:</term>
<listitem><para> a struct, the details of the optimization process</para></listitem></varlistentry>
<varlistentry><term>lambda:</term>
<listitem><para> a struct, the Lagrange multipliers at optimum</para></listitem></varlistentry>
</variablelist>
</refsection>
<refsection>
<title>Description</title>
<para>
fgoalattain solves the goal attainment problem, which is one formulation for minimizing a multiobjective optimization problem.
Finds the minimum of a problem specified by:
Minimise Y such that
</para>
<para>
<latex>
\begin{eqnarray}
\mbox{min}_{x,\gamma} & f(x)-weight \ast \gamma \leq goal \\
\mbox{subject to} & c(x) \leq 0 \\
& c_{eq}(x) = 0 \\
& Ax \leq b \\
& A_{eq} x = b_{eq} \\
& lb \leq x \leq ub
\end{eqnarray}
</latex>
</para>
<para>
The solver makes use of fmincon to find the minimum.
</para>
<para>
The fgoalattain finds out the maximum value of Y for the objectives evaluated at the starting point and
adds that as another variable to the vector x
This is passed to the fmincon function to get the optimised value of Y
Hence, the algorithm used mainly is "ipopt" to obtain the optimum solution
The relations between f(x), Y, weights and goals are added as additional non-linear inequality constraints
</para>
<para>
The options allows the user to set various parameters of the Optimization problem.
It should be defined as type "list" and contains the following fields.
<itemizedlist>
<listitem>Syntax : options= list("MaxIter", [---], "CpuTime", [---], "GradObj", ---, "GradCon", ---);</listitem>
<listitem>MaxIter : a Scalar, containing the Maximum Number of Iteration that the solver should take.</listitem>
<listitem>CpuTime : a Scalar, containing the Maximum amount of CPU Time that the solver should take.</listitem>
<listitem>GradObj : a function, representing the gradient function of the Objective in Vector Form.</listitem>
<listitem>GradCon : a function, representing the gradient of the Non-Linear Constraints (both Equality and Inequality) of the problem. It is declared in such a way that gradient of non-linear inequality constraints are defined first as a separate Matrix (cg of size m2 X n or as an empty), followed by gradient of non-linear equality constraints as a separate Matrix (ceqg of size m2 X n or as an empty) where m2 & m3 are number of non-linear inequality and equality constraints respectively.</listitem>
<listitem>Default Values : options = list("MaxIter", [3000], "CpuTime", [600]);</listitem>
</itemizedlist>
</para>
<para>
By default, the gradient options for fminimax are turned off and and fmincon does the gradient opproximation of minmaxObjfun. In case the GradObj option is off and GradConstr option is on, fminimax approximates minmaxObjfun gradient using numderivative toolbox.
</para>
<para>
If we can provide exact gradients, we should do so since it improves the convergence speed of the optimization algorithm.
</para>
<para>
Furthermore, we must enable the "GradObj" option with the statement :
<programlisting>
minimaxOptions = list("GradObj",fGrad);
</programlisting>
This will let fminimax know that the exact gradient of the objective function is known, so that it can change the calling sequence to the objective function. Note that, fGrad should be mentioned in the form of N x n where n is the number of variables, N is the number of functions in objective function.
</para>
<para>
The constraint function must have header :
<programlisting>
[c, ceq] = confun(x)
</programlisting>
where x is a n x 1 matrix of dominmaxUbles, c is a 1 x nni matrix of doubles and ceq is a 1 x nne matrix of doubles (nni : number of nonlinear inequality constraints, nne : number of nonlinear equality constraints).
On input, the variable x contains the current point and, on output, the variable c must contain the nonlinear inequality constraints and ceq must contain the nonlinear equality constraints.
</para>
<para>
By default, the gradient options for fminimax are turned off and and fmincon does the gradient opproximation of confun. In case the GradObj option is on and GradCons option is off, fminimax approximates confun gradient using numderivative toolbox.
</para>
<para>
If we can provide exact gradients, we should do so since it improves the convergence speed of the optimization algorithm.
</para>
<para>
Furthermore, we must enable the "GradCon" option with the statement :
<programlisting>
minimaxOptions = list("GradCon",confunGrad);
</programlisting>
This will let fminimax know that the exact gradient of the objective function is known, so that it can change the calling sequence to the objective function.
</para>
<para>
The constraint derivative function must have header :
<programlisting>
[dc,dceq] = confungrad(x)
</programlisting>
where dc is a nni x n matrix of doubles and dceq is a nne x n matrix of doubles.
</para>
<para>
The exitflag allows to know the status of the optimization which is given back by Ipopt.
<itemizedlist>
<listitem>exitflag=0 : Optimal Solution Found </listitem>
<listitem>exitflag=1 : Maximum Number of Iterations Exceeded. Output may not be optimal.</listitem>
<listitem>exitflag=2 : Maximum amount of CPU Time exceeded. Output may not be optimal.</listitem>
<listitem>exitflag=3 : Stop at Tiny Step.</listitem>
<listitem>exitflag=4 : Solved To Acceptable Level.</listitem>
<listitem>exitflag=5 : Converged to a point of local infeasibility.</listitem>
</itemizedlist>
</para>
<para>
For more details on exitflag see the ipopt documentation, go to http://www.coin-or.org/Ipopt/documentation/
</para>
<para>
The output data structure contains detailed informations about the optimization process.
It has type "struct" and contains the following fields.
<itemizedlist>
<listitem>output.Iterations: The number of iterations performed during the search</listitem>
<listitem>output.Cpu_Time: The total cpu-time spend during the search</listitem>
<listitem>output.Objective_Evaluation: The number of Objective Evaluations performed during the search</listitem>
<listitem>output.Dual_Infeasibility: The Dual Infeasiblity of the final soution</listitem>
</itemizedlist>
</para>
<para>
The lambda data structure contains the Lagrange multipliers at the end
of optimization. In the current version the values are returned only when the the solution is optimal.
It has type "struct" and contains the following fields.
<itemizedlist>
<listitem>lambda.lower: The Lagrange multipliers for the lower bound constraints.</listitem>
<listitem>lambda.upper: The Lagrange multipliers for the upper bound constraints.</listitem>
<listitem>lambda.eqlin: The Lagrange multipliers for the linear equality constraints.</listitem>
<listitem>lambda.ineqlin: The Lagrange multipliers for the linear inequality constraints.</listitem>
<listitem>lambda.eqnonlin: The Lagrange multipliers for the non-linear equality constraints.</listitem>
<listitem>lambda.ineqnonlin: The Lagrange multipliers for the non-linear inequality constraints.</listitem>
</itemizedlist>
</para>
<para>
</para>
</refsection>
<refsection>
<title>Examples</title>
<programlisting role="example"><![CDATA[
function f1 = fun(x)
f1(1)=2*x(1)*x(1)+x(2)*x(2)-48*x(1)-40*x(2)+304
f1(2)=-x(1)*x(1)-3*x(2)*x(2)
f1(3)=x(1)+3*x(2)-18
f1(4)=-x(1)-x(2)
f1(5)=x(1)+x(2)-8
endfunction
x0=[-1,1];
goal=[-5,-3,-2,-1,-4];
weight=abs(goal)
//xopt = [-0.0000011 -63.999998 -2.0000002 -8 3.485D-08]
//fval = [4 3.99]
//Run fgoalattain
[xopt,fval,attainfactor,exitflag,output,lambda]=fgoalattain(fun,x0,goal,weight)
]]></programlisting>
</refsection>
<refsection>
<title>Authors</title>
<simplelist type="vert">
<member>Prajwala TM, Sheetal Shalini , 2015</member>
</simplelist>
</refsection>
</refentry>
|
