con2uncon.cpp

/*****************************************************************************
 *   Copyright (C) 2004-2015 The PaGMO development team,                     *
 *   Advanced Concepts Team (ACT), European Space Agency (ESA)               *
 *                                                                           *
 *   https://github.com/esa/pagmo                                            *
 *                                                                           *
 *   act@esa.int                                                             *
 *                                                                           *
 *   This program is free software; you can redistribute it and/or modify    *
 *   it under the terms of the GNU General Public License as published by    *
 *   the Free Software Foundation; either version 2 of the License, or       *
 *   (at your option) any later version.                                     *
 *                                                                           *
 *   This program is distributed in the hope that it will be useful,         *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of          *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the           *
 *   GNU General Public License for more details.                            *
 *                                                                           *
 *   You should have received a copy of the GNU General Public License       *
 *   along with this program; if not, write to the                           *
 *   Free Software Foundation, Inc.,                                         *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.               *
 *****************************************************************************/

#include <cmath>
#include <algorithm>

#include "../exceptions.h"
#include "../types.h"
#include "con2uncon.h"

namespace pagmo { namespace problem {

con2uncon::con2uncon(const base &problem, const method_type method):
        base_meta(problem,
                 problem.get_dimension(),
                 problem.get_i_dimension(),
                 problem.get_f_dimension(),
                 0,
                 0,
                 std::vector<double>()),
        m_method(method)
{
        if((m_method < 0) || (m_method > 1)) {
                pagmo_throw(value_error,"the problem method must be either OPTIMALITY or FEASIBILITY.");
        }
}

base_ptr con2uncon::clone() const
{
        return base_ptr(new con2uncon(*this));
}

void con2uncon::objfun_impl(fitness_vector &f, const decision_vector &x) const
{
        switch(m_method) {
        case(OPTIMALITY): {
                m_original_problem->objfun(f,x);
                break;
        }
        case(FEASIBILITY): {
                // get the constraints dimension
                problem::base::c_size_type prob_c_dimension = m_original_problem->get_c_dimension();
                problem::base::c_size_type number_of_eq_constraints =
                                m_original_problem->get_c_dimension() -
                                m_original_problem->get_ic_dimension();

                constraint_vector c(m_original_problem->get_c_dimension(),0);
                m_original_problem->compute_constraints(c,x);

                const std::vector<double> &c_tol = m_original_problem->get_c_tol();

                double c_func = 0.;

                // update equality constraints
                for(problem::base::c_size_type j=0; j<number_of_eq_constraints; j++) {
                        if(!m_original_problem->test_constraint(c,j)) {
                                c_func += ( std::abs(c.at(j)) - c_tol.at(j) ) * ( std::abs(c.at(j)) - c_tol.at(j) );
                        }
                }

                // update inequality constraints
                for(problem::base::c_size_type j=number_of_eq_constraints; j<prob_c_dimension; j++) {
                        if(!m_original_problem->test_constraint(c,j)) {
                                        c_func += c.at(j) - c_tol.at(j);
                        }
                }

                std::fill(f.begin(),f.end(), 0.);

                //checking overflow
                if(c_func > boost::numeric::bounds<double>::highest()){
                        f[0] = boost::numeric::bounds<double>::highest(); 
                }
                else{
                        f[0] = c_func;
                }

                break;
        }
        }
}


std::string con2uncon::human_readable_extra() const
{
        std::ostringstream oss;
        oss << m_original_problem->human_readable_extra() << std::endl;
        oss << "\n\tcon2unconed with method ";
        switch(m_method){
        case OPTIMALITY: {
                oss << "OPTIMALITY ";
                break;
        }
        case FEASIBILITY: {
                oss << "FEASIBILITY ";
                break;
        }
        }
        oss << std::endl;
        return oss.str();
}

std::string con2uncon::get_name() const
{
        std::string method;

        switch(m_method){
        case OPTIMALITY: {
                method = "OPTIMALITY ";
                break;
        }
        case FEASIBILITY: {
                method = "FEASIBILITY ";
                break;
        }
        }
        return m_original_problem->get_name() + " [con2uncon, method_" + method + "]";
}

}}

BOOST_CLASS_EXPORT_IMPLEMENT(pagmo::problem::con2uncon)