Lotka Volterra fishing problem (Bocop) - Revision history

FelixMueller at 17:51, 31 January 2016

2016-01-31T17:51:54Z

← Older revision		Revision as of 17:51, 31 January 2016
Line 1:		Line 1:
	This is a [[:Category: Bocop \| Bocop]] implementation of [[Lotka ~~VOlterra~~ fishing problem]].		This is a [[:Category: Bocop \| Bocop]] implementation of [[Lotka Volterra fishing problem]].
	== Problem.def ==		== Problem.def ==
	<source lang="cpp">		<source lang="cpp">

FelixMueller at 17:51, 31 January 2016

2016-01-31T17:51:45Z

← Older revision		Revision as of 17:51, 31 January 2016
Line 1:		Line 1:
			This is a [[:Category: Bocop \| Bocop]] implementation of [[Lotka VOlterra fishing problem]].
	== Problem.def ==		== Problem.def ==
	<source lang="cpp">		<source lang="cpp">

FelixMueller at 13:47, 31 January 2016

2016-01-31T13:47:24Z

← Older revision		Revision as of 13:47, 31 January 2016
Line 1:		Line 1:

	== Problem.def ==		== Problem.def ==
	<source lang="~~ampl~~">		<source lang="cpp">
	# This file defines all dimensions and parameters		# This file defines all dimensions and parameters
	# values for your problem :		# values for your problem :
Line 61:		Line 61:

	== Problem.constants ==		== Problem.constants ==
	<source lang="~~ampl~~">		<source lang="cpp">
	# This file contains the values of the constants of your problem.		# This file contains the values of the constants of your problem.
	# Number of constants used in your problem :		# Number of constants used in your problem :

FelixMueller: /* Problem.bounds */

2016-01-31T13:47:09Z

Problem.bounds

← Older revision		Revision as of 13:47, 31 January 2016
Line 72:		Line 72:

	== Problem.bounds ==		== Problem.bounds ==
	<source lang="~~ampl~~">		<source lang="cpp">
	# This file contains all the bounds of your problem.		# This file contains all the bounds of your problem.
	# Bounds are stored in standard format :		# Bounds are stored in standard format :
Line 100:		Line 100:
	# Bounds for the path constraints :		# Bounds for the path constraints :
	</source>		</source>


	== criterion.tpp ==		== criterion.tpp ==

FelixMueller at 13:46, 31 January 2016

2016-01-31T13:46:34Z

← Older revision		Revision as of 13:46, 31 January 2016
Line 61:		Line 61:

	== Problem.constants ==		== Problem.constants ==
	<source lang="~~text~~">		<source lang="ampl">
	# This file contains the values of the constants of your problem.		# This file contains the values of the constants of your problem.
	# Number of constants used in your problem :		# Number of constants used in your problem :
Line 72:		Line 72:

	== Problem.bounds ==		== Problem.bounds ==
	<source lang="~~text~~">		<source lang="ampl">
	# This file contains all the bounds of your problem.		# This file contains all the bounds of your problem.
	# Bounds are stored in standard format :		# Bounds are stored in standard format :

FelixMueller: /* Problem.def */

2016-01-31T13:45:53Z

Problem.def

← Older revision		Revision as of 13:45, 31 January 2016
Line 1:		Line 1:

	== Problem.def ==		== Problem.def ==
	<source lang="~~text~~">		<source lang="ampl">
	# This file defines all dimensions and parameters		# This file defines all dimensions and parameters
	# values for your problem :		# values for your problem :

PaulScharnhorst at 09:20, 21 January 2016

2016-01-21T09:20:43Z

← Older revision		Revision as of 09:20, 21 January 2016
Line 137:		Line 137:
	// HERE : description of the function for the initial and final conditions		// HERE : description of the function for the initial and final conditions
	// Please give a function or a value for each element of boundaryconditions		// Please give a function or a value for each element of boundaryconditions
	boundary_conditions[0] = initial_state[0];		boundary_conditions[0] = initial_state[0];
	boundary_conditions[1] = initial_state[1];		boundary_conditions[1] = initial_state[1];
	boundary_conditions[2] = initial_state[2];		boundary_conditions[2] = initial_state[2];

PaulScharnhorst: Created page with " == Problem.def == # This file defines all dimensions and parameters # values for your problem : # Initial and final time : time.free string none time.in..."

2016-01-21T09:20:06Z

Created page with " == Problem.def == <source lang="text"> # This file defines all dimensions and parameters # values for your problem : # Initial and final time : time.free string none time.in..."

New page

== Problem.def ==
<source lang="text">
# This file defines all dimensions and parameters
# values for your problem :

# Initial and final time :
time.free string none
time.initial double 0
time.final double 12

# Dimensions :
state.dimension integer 3
control.dimension integer 1
algebraic.dimension integer 0
parameter.dimension integer 0
constant.dimension integer 2
boundarycond.dimension integer 3
constraint.dimension integer 0

# Discretization :
discretization.steps integer 100
discretization.method string lobatto

# Optimization :
optimization.type string single
batch.type integer 0
batch.index integer 0
batch.nrange integer 1
batch.lowerbound double 0
batch.upperbound double 0
batch.directory string none

# Initialization :
initialization.type string from_init_file
initialization.file string none

# Parameter identification :
paramid.type string false
paramid.separator string ,
paramid.file string no_directory
paramid.dimension integer 0

# Names :
state.0 string x0
state.1 string x1
state.2 string x2
control.0 string w
boundarycond.0 string x00
boundarycond.1 string x10
boundarycond.2 string x20
constant.0 string c0
constant.1 string c1

# Solution file :
solution.file string problem.sol

# Iteration output frequency :
iteration.output.frequency integer 0
</source>

== Problem.constants ==
<source lang="text">
# This file contains the values of the constants of your problem.
# Number of constants used in your problem :
2

# Values of the constants :
0.4
0.2
</source>

== Problem.bounds ==
<source lang="text">
# This file contains all the bounds of your problem.
# Bounds are stored in standard format :
# [lower bound] [upper bound] [type of bound]

# Dimensions (boundary conditions, state, control, algebraic
# variables, optimization parameters, path constraints) :
3 3 1 0 0 0
0.5 0.5 equal
0.7 0.7 equal
0 0 equal

# Bounds for the initial and final conditions :

# Bounds for the state variables :
>0:1:0 0 0 free
>1:1:1 0 0 free
>2:1:2 0 0 free
0 1 both

# Bounds for the control variables :

# Bounds for the algebraic variables :

# Bounds for the optimization parameters :

# Bounds for the path constraints :
</source>

== criterion.tpp ==
<source lang="cpp">
#include "header_criterion"
{
// HERE : description of the function for the criterion
// "criterion" is a function of all variables X[]
criterion = final_state[2];
}
</source>

== dynamics.tpp ==
<source lang="cpp">
#include "header_dynamics"
{
// HERE : description of the function for the dynamics
// Please give a function or a value for the dynamics of each state variable
double c0 = constants[0];
double c1 = constants[1];

Tdouble x0 = state[0];
Tdouble x1 = state[1];
Tdouble x2 = state[2];

state_dynamics[0] = x0-x0*x1-c0*x0*control[0];
state_dynamics[1] = -x1+x0*x1-c1*x1*control[0];
state_dynamics[2] = (x0-1)*(x0-1)+(x1-1)*(x1-1);
}
</source>

== boundarycond.tpp ==
<source lang="cpp">
#include "header_boundarycond"
{
// HERE : description of the function for the initial and final conditions
// Please give a function or a value for each element of boundaryconditions
boundary_conditions[0] = initial_state[0];
boundary_conditions[1] = initial_state[1];
boundary_conditions[2] = initial_state[2];
}
</source>
[[Category:Bocop]]