Lotka Volterra fishing problem (JuMP) - Revision history

FelixMueller at 14:59, 19 January 2016

2016-01-19T14:59:55Z

← Older revision		Revision as of 14:59, 19 January 2016
Line 3:		Line 3:
	Although not necessary in JuMP the code was divided into three parts (following AMPL) - model file, data file and run file. The run file calls the other files and performs additional tasks such as printing results.		Although not necessary in JuMP the code was divided into three parts (following AMPL) - model file, data file and run file. The run file calls the other files and performs additional tasks such as printing results.

	The control function <math> u(t) ~~</math> was relaxed to the domain <math>~~ [0,1] </math>.		The control function was relaxed, i.e. <math> u(t) \in [0,1] </math>.

	Model file ("lotka_mod.jl"):		Model file ("lotka_mod.jl"):

2016-01-19T14:59:13Z

← Older revision		Revision as of 14:59, 19 January 2016
Line 2:		Line 2:
	The problem was discretized and the ODEs are solved using the explicit Euler method.		The problem was discretized and the ODEs are solved using the explicit Euler method.
	Although not necessary in JuMP the code was divided into three parts (following AMPL) - model file, data file and run file. The run file calls the other files and performs additional tasks such as printing results.		Although not necessary in JuMP the code was divided into three parts (following AMPL) - model file, data file and run file. The run file calls the other files and performs additional tasks such as printing results.

			The control function <math> u(t) </math> was relaxed to the domain <math> [0,1] </math>.

	Model file ("lotka_mod.jl"):		Model file ("lotka_mod.jl"):

2016-01-19T13:57:51Z

← Older revision		Revision as of 13:57, 19 January 2016
Line 1:		Line 1:
	This is an implementation of the Lotka-Volterra fishing problem using JuMP.		This is an implementation of the [[Lotka Volterra fishing problem]] using JuMP.
	The problem was discretized and the ODEs are solved using the explicit Euler method.		The problem was discretized and the ODEs are solved using the explicit Euler method.
	Although not necessary in JuMP the code was divided into three parts (following AMPL) - model file, data file and run file. The run file calls the other files and performs additional tasks such as printing results.		Although not necessary in JuMP the code was divided into three parts (following AMPL) - model file, data file and run file. The run file calls the other files and performs additional tasks such as printing results.

2016-01-19T12:42:27Z

← Older revision		Revision as of 12:42, 19 January 2016
Line 14:		Line 14:
	@defVar(m, x[ii=1:n_x, tt=1:N])		@defVar(m, x[ii=1:n_x, tt=1:N])
	@defVar(m, L_control <= u[tt=1:N] <= U_control)		@defVar(m, L_control <= u[tt=1:N] <= U_control)
	~~#@defVar(m, u[tt=1:N], Bin)~~

	#set objective function		#set objective function

2016-01-19T12:41:08Z

@@ Line 1: / Line 1: @@
-JuMP code will be added!
+This is an implementation of the Lotka-Volterra fishing problem using JuMP.
-Currently this is a test page.
+Model file ("lotka_mod.jl"):
-[[Category:Julia/JuMP]]
+#declaring the model

2016-01-12T17:51:24Z

2015-12-03T13:35:17Z

Created page with "JuMP code will be added! Currently this is a test page. Category:JuMP"

New page

JuMP code will be added!

Currently this is a test page.

[[Category:JuMP]]