Class CTestOpt

constr3.cpp:22–104

}

class CTestOpt : public CBiteOptDeep
{
public:
	int con_notmet;
	double real_value;

	virtual void getMinValues( double* const p ) const
	{
		int i;

		for( i = 0; i < ::N; i++ )
		{
			p[ i ] = -10.0;
		}
	}

	virtual void getMaxValues( double* const p ) const
	{
		int i;

		for( i = 0; i < ::N; i++ )
		{
			p[ i ] = 10.0;
		}
	}

	double penalty( const double v )
	{
		if( v > tol )
		{
			con_notmet++;
			return( v - tol );
		}

		return( 0.0 );
	}

	virtual double optcost( const double* const p0 )
	{
		double p[ ::N ];
		int i;

		for( i = 0; i < ::N; i++ )
		{
			p[ i ] = applyRound( p0[ i ]);
		}

		double cost = sqr(p[0])+sqr(p[1])+p[0]*p[1]-14*p[0]-16*p[1]+sqr(p[2]-10)+
			4*sqr(p[3]-5)+sqr(p[4]-3)+2*sqr(p[5]-1)+5*sqr(p[6])+
			7*sqr(p[7]-11)+2*sqr(p[8]-10)+sqr(p[9]-7)+45;

		const int n_con = 8;
		double pn[ n_con ];
		con_notmet = 0;

		pn[ 0 ] = penalty( 4*p[0]+5*p[1]-3*p[6]+9*p[7]-105 );
		pn[ 1 ] = penalty( 10*p[0]-8*p[1]-17*p[6]+2*p[7] );
		pn[ 2 ] = penalty( -8*p[0]+2*p[1]+5*p[8]-2*p[9]-12 );