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
|
// Copyright (C) 2016 EDF
// All Rights Reserved
// This code is published under the GNU Lesser General Public License (GNU LGPL)
#ifndef TRANSITIONSTEPBASE_H
#define TRANSITIONSTEPBASE_H
#include <vector>
#include <memory>
#include <Eigen/Dense>
#include "geners/BinaryFileArchive.hh"
#include "StOpt/regression/GridAndRegressedValue.h"
/** \file TransitionStepBase.h
* \brief Base class to optimize on a time step in methods by Monte Carlo but without regression
* \author Xavier Warin
*/
namespace StOpt
{
/// \class TransitionStepBase TransitionStepBase.h
/// Defines one step of dynamic programming without regression
class TransitionStepBase
{
public :
/// \brief One step for dynamic programming in optimization
/// \param p_phiIn for each regime the function value at the next time step
/// \return solution obtained after one step of dynamic programming and the optimal control
virtual std::pair< std::shared_ptr< std::vector< Eigen::ArrayXXd > >, std::shared_ptr<std::vector< Eigen::ArrayXXd > > > oneStep(const std::vector< Eigen::ArrayXXd > &p_phiIn) const = 0 ;
};
}
#endif
|
