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
|
// Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
// Copyright (C) 2009 - INRIA - Michael Baudin
//
// This file must be used under the terms of the CeCILL.
// This source file is licensed as described in the file COPYING, which
// you should have received as part of this distribution. The terms
// are also available at
// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
//
// optimbase_isinnonlincons --
// Returns %t if the given point satisfies inequality constraints.
// Returns %f if the given point does not satisfies inequality constraints.
// Arguments
// x : the point to analyse
// isfeasible : = %t or %f
//
function [ this , isfeasible ] = optimbase_isinnonlincons ( this , x )
isfeasible = %t
if ( this.nbineqconst > 0) then
if ( this.withderivatives ) then
[ this , f , g , c , gc , index ] = optimbase_function ( this , x , 2 );
else
[ this , f , c , index ] = optimbase_function ( this , x , 5 );
end
for ic = 1 : this.nbineqconst
if ( c ( ic ) < 0.0 ) then
this = optimbase_log ( this , sprintf ( "Inequality constraint #%d/%d is not satisfied for x", ...
ic , this.nbineqconst ) )
isfeasible = %f
break
end
end
end
endfunction
|
