1## DAKOTA INPUT FILE - dakota_var_views_dace.in
2
3# This file contains tests of the variable views override capability
4# in the context of DACE methods.  It covers continuous variables
5# (discrete are covered in another test set) and considers only
6# default and 'active all' views to catch the most egregious problems.
7# Mix-and-match tests will be captured separately.
8
9method,
10        dace oas seed = 5				#s0,#s7
11          samples = 49 symbols = 7			#s0,#s7
12#       fsu_quasi_mc halton    	 			#s1,#s8
13#	  samples = 50					#s1,#s8
14#       psuade_moat  					#s2,#s9
15#         samples = 84					#s2,#s9
16#         partitions = 3				#s2,#s9
17#         seed = 50270 					#s2,#s9
18#       vector_parameter_study				#s3,#s10
19#         step_vector = .1 .1				#s3
20#         step_vector = .1 .1 .1 .1 .1 .1 .1 .1		   #s10
21#	  num_steps = 4	   				#s3,#s10
22#       list_parameter_study				#s4,#s11
23#         list_of_points = 1.1 1.2 1.3 1.4 1.5 1.6	#s4,#s11
24#                          1.7 1.8 1.9 2.0 2.1 2.2	#s4,#s11
25#         		   1.1 1.2 1.3 1.4 1.5 1.6	   #s11
26#                          1.7 1.8 1.9 2.0 2.1 2.2	   #s11
27#         		   1.1 1.2 1.3 1.4 1.5 1.6	   #s11
28#                          1.7 1.8 1.9 2.0 2.1 2.2	   #s11
29#         		   1.1 1.2 1.3 1.4 1.5 1.6	   #s11
30#                          1.7 1.8 1.9 2.0 2.1 2.2	   #s11
31#       centered_parameter_study       	       		#s5,#s12
32#         step_vector = .05 .05				#s5
33#         step_vector = .05 .05	.05 .05 .05 .05 .05 .05	   #s12
34#         steps_per_variable = 5			#s5,#s12
35#       multidim_parameter_study			#s6,#s13
36#         partitions = 2				#s6,#s13
37
38variables,
39#	active all			#s7,#s8,#s9,#s10,#s11,#s12,#s13
40	continuous_design = 2
41	  initial_point     0.   0.
42	  upper_bounds      2.   2.
43	  lower_bounds     -2.  -2.
44	  descriptors      'x1' 'x2'
45	uniform_uncertain = 2
46	  upper_bounds      3.   3.	#s0,#s1,#s2,#s3,#s4,#s5,#s6
47	  lower_bounds     -1.  -1.	#s0,#s1,#s2,#s3,#s4,#s5,#s6
48#	  upper_bounds      2.   2.	#s7,#s8,#s9,#s10,#s11,#s12,#s13
49#	  lower_bounds     -2.  -2.	#s7,#s8,#s9,#s10,#s11,#s12,#s13
50	  descriptors      'x3' 'x4'
51	interval_uncertain = 2
52	  num_intervals     1    1
53	  interval_probs    1.   1.
54	  upper_bounds      3.   3.	#s0,#s1,#s2,#s3,#s4,#s5,#s6
55	  lower_bounds     -1.  -1.	#s0,#s1,#s2,#s3,#s4,#s5,#s6
56#	  upper_bounds      2.   2.	#s7,#s8,#s9,#s10,#s11,#s12,#s13
57#	  lower_bounds     -2.  -2.	#s7,#s8,#s9,#s10,#s11,#s12,#s13
58	  descriptors      'x5' 'x6'
59	continuous_state = 2
60	  initial_state     1.   1.	#s0,#s1,#s2,#s3,#s4,#s5,#s6
61	  upper_bounds      3.   3.	#s0,#s1,#s2,#s3,#s4,#s5,#s6
62	  lower_bounds     -1.  -1.	#s0,#s1,#s2,#s3,#s4,#s5,#s6
63#	  initial_state     0.   0.	#s7,#s8,#s9,#s10,#s11,#s12,#s13
64#	  upper_bounds      2.   2.	#s7,#s8,#s9,#s10,#s11,#s12,#s13
65#	  lower_bounds     -2.  -2.	#s7,#s8,#s9,#s10,#s11,#s12,#s13
66	  descriptors      'x7' 'x8'
67
68interface,
69	direct
70	  analysis_driver =       'text_book'
71
72responses,
73	objective_functions = 1
74	nonlinear_inequality_constraints = 2
75	no_gradients
76	no_hessians
77