PaGMO  1.1.5
snopt_toyprob.cpp
1 /*****************************************************************************
2  * Copyright (C) 2004-2015 The PaGMO development team, *
3  * Advanced Concepts Team (ACT), European Space Agency (ESA) *
4  * *
5  * https://github.com/esa/pagmo *
6  * *
7  * act@esa.int *
8  * *
9  * This program is free software; you can redistribute it and/or modify *
10  * it under the terms of the GNU General Public License as published by *
11  * the Free Software Foundation; either version 2 of the License, or *
12  * (at your option) any later version. *
13  * *
14  * This program is distributed in the hope that it will be useful, *
15  * but WITHOUT ANY WARRANTY; without even the implied warranty of *
16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
17  * GNU General Public License for more details. *
18  * *
19  * You should have received a copy of the GNU General Public License *
20  * along with this program; if not, write to the *
21  * Free Software Foundation, Inc., *
22  * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
23  *****************************************************************************/
24 
25 #include <string>
26 
27 #include "base.h"
28 #include "snopt_toyprob.h"
29 
30 namespace pagmo { namespace problem {
31 
33 
37 {
38  const double lb[] = {0,-10};
39  const double ub[] = {10,10};
40  set_lb(lb);
41  set_ub(ub);
42 }
43 
46 {
47  return base_ptr(new snopt_toyprob(*this));
48 }
49 
52 {
53  f[0] = x[1];
54 }
55 
58 {
59  c[0] = x[0] * x[0] + 4 * x[1] * x[1] - 4;
60  c[1] = (x[0] - 2) * (x[0] - 2) + x[1] * x[1] - 5;
61 }
62 
64 void snopt_toyprob::set_sparsity(int& lenG, std::vector<int>& iGfun, std::vector<int>& jGvar) const
65 {
66  //Initial point
67  decision_vector x0(2);
68  x0[0] = 1; x0[1] = 1;
69  //Numerical procedure
70  this->estimate_sparsity(x0, lenG, iGfun, jGvar);
71 }
72 
73 std::string snopt_toyprob::get_name() const
74 {
75  return "SNOPT toy problem";
76 }
77 
78 }}
79 
80 BOOST_CLASS_EXPORT_IMPLEMENT(pagmo::problem::snopt_toyprob)
Root PaGMO namespace.
boost::shared_ptr< base > base_ptr
Alias for shared pointer to base problem.
Definition: problem/base.h:62
std::vector< double > decision_vector
Decision vector type.
Definition: types.h:40
std::string get_name() const
Get problem's name.
Base problem class.
Definition: problem/base.h:148
base_ptr clone() const
Clone method.
void set_lb(const decision_vector &)
Set lower bounds from pagmo::decision_vector.
void set_sparsity(int &, std::vector< int > &, std::vector< int > &) const
Implementation of the sparsity structure.
void set_ub(const decision_vector &)
Set upper bounds from pagmo::decision_vector.
std::vector< double > fitness_vector
Fitness vector type.
Definition: types.h:42
void estimate_sparsity(const decision_vector &, int &lenG, std::vector< int > &iGfun, std::vector< int > &jGvar) const
Heuristics to estimate the sparsity pattern of the problem.
snopt_toyprob()
Default constructor.
std::vector< double > constraint_vector
Constraint vector type.
Definition: types.h:44
void objfun_impl(fitness_vector &, const decision_vector &) const
Implementation of the objective function.
Test problem from SNOPT.
Definition: snopt_toyprob.h:57
void compute_constraints_impl(constraint_vector &, const decision_vector &) const
Implementation of the constraint function.