1#@ s*: Label=FastTest
2#@ *: DakotaConfig=HAVE_NPSOL
3#@ s0: UserMan=textbook_opt_ouu1
4#@ [taxonomy:start]
5#@ s0: [analysis:Optimization]
6#@ s0: [method:SQP]
7#@ s0: [goal:Local]
8#@ s0: [goal:BoundAndNonLinearConstraints]
9#@ s0: [variable:Continuous]
10#@ s0: [model:Smooth]
11#@ s0: [model:EstimatedFirstDerivatives]
12#@ [taxonomy:end]
13
14# DAKOTA Input File: dakota_ouu1_tb.in
15# Dakota Input File: textbook_opt_ouu1.in		#s0
16# Optimization under uncertainty
17# using a version of the Textbook test problem that
18# has been modified to have six uncertain variables.
19
20environment
21  top_method_pointer = 'OPTIM'
22
23###########################
24# begin opt specification #
25###########################
26method
27  id_method = 'OPTIM'
28## (NPSOL requires a software license; if not available, try	      #s0
29## conmin_mfd or optpp_q_newton instead)     			      #s0
30  npsol_sqp
31    convergence_tolerance = 1.e-10
32    model_pointer = 'OPTIM_M'
33
34model
35  id_model = 'OPTIM_M'
36  nested
37    sub_method_pointer = 'UQ'
38    primary_response_mapping   = 0. 0. 1. 0. 0. 1. 0. 0. 0.	#s0
39    secondary_response_mapping = 0. 0. 0. 0. 0. 0. 0. 0. 1.	#s0
40#   primary_response_mapping   = 1. 1. 0.	      	 	#s1
41#   secondary_response_mapping = 0. 0. 1.			#s1
42#   primary_response_mapping   = 0. 1. 0. 0. 0. 0.		#s2,#s3
43#   secondary_response_mapping = 0. 0. 1. 0. 0. 0.		#s2,#s3
44#   			         0. 0. 0. 0. 1. 0.		#s2,#s3
45#   primary_response_mapping   = 0. 0. -1. 0. 0. 0. 0. 0. 0.	#s4,#s6
46#   secondary_response_mapping = 0. 0.  0. 0. 0. 1. 0. 0. 0.	#s4,#s6
47#   			         0. 0.  0. 0. 0. 0. 0. 0. 1.	#s4,#s6
48#   primary_response_mapping =  -1. 0. 0.	      	 	#s5
49#   secondary_response_mapping = 0. 1. 0.			#s5
50#   			         0. 0. 1.			#s5
51#   primary_response_mapping   = 0. 0. 1. 0. 0. 0. 0. 0. 0.	#s7,#s9
52#   secondary_response_mapping = 0. 0. 0. 0. 0. 1. 0. 0. 0.	#s7,#s9
53#   			         0. 0. 0. 0. 0. 0. 0. 0. 1.	#s7,#s9
54#   primary_response_mapping   = 1. 0. 0.	      	 	#s8
55#   secondary_response_mapping = 0. 1. 0.			#s8
56#   			         0. 0. 1.			#s8
57  variables_pointer  = 'OPTIM_V'
58  responses_pointer  = 'OPTIM_R'
59
60variables
61  id_variables = 'OPTIM_V'
62  continuous_design = 2
63    initial_point    1.8    1.0
64    upper_bounds     2.164  4.0
65    lower_bounds     1.5    0.0
66    descriptors      'd1'   'd2'
67
68responses
69# minimize p_fail_r1 + p_fail_r2
70# s.t.     p_fail_r3 <= 0.1
71#
72# minimize var_r1
73# s.t.     l <= mean_r2 <= u
74#          l <= mean_r3 <= u
75#
76# maximize beta_r1
77# s.t.     beta_r2 >= 2.
78#          beta_r3 >= 2.
79#
80# minimize z_r1
81# s.t.     z_r2 <= 1.2e+05
82#          z_r3 <= 3.5e+05
83#
84# NOTE: This specifies the TOTAL RESPONSE for the optimization,
85#       which is a combination of nested & interface responses.
86  id_responses = 'OPTIM_R'
87  objective_functions = 1
88  nonlinear_inequality_constraints = 1		#s0,#s1
89    upper_bounds = .1				#s0,#s1
90# nonlinear_inequality_constraints = 2		#s2,#s3,#s4,#s5,#s6,#s7,#s8,#s9
91#   lower_bounds = 1.e+5 1.e+5			#s2,#s3
92#   upper_bounds = 1.e+6 1.e+6			#s2,#s3
93#   lower_bounds = 2.     2.			#s4,#s5,#s6
94#   upper_bounds = 1.e+50 1.e+50		#s4,#s5,#s6
95#   upper_bounds = 1.2e+05 3.5e+05		#s7,#s8,#s9
96  numerical_gradients				#s0,#s1,#s3,#s6,#s9
97    method_source dakota			#s0,#s1,#s3,#s6,#s9
98    interval_type central			#s0,#s1,#s3,#s6,#s9
99    fd_step_size = 1.e-1			#s0,#s1
100#   fd_step_size = 1.e-2			#s3,#s6,#s9
101# analytic_gradients				#s2,#s4,#s5,#s7,#s8
102  no_hessians
103
104##########################
105# begin UQ specification #
106##########################
107method
108  id_method = 'UQ'
109  sampling
110    model_pointer = 'UQ_M'
111    samples = 50  sample_type lhs
112    seed = 1					#s0,#s1
113#   seed = 12347 fixed_seed			#s2,#s3,#s4,#s5,#s6,#s7,#s8,#s9
114    response_levels = 3.6e+11 1.2e+05 3.5e+05	#s0,#s1,#s4,#s5,#s6
115#   compute reliabilities			#s4,#s5,#s6
116#   reliability_levels = 2. 2. 2.		#s7,#s8,#s9
117    distribution complementary			#s0,#s1,#s4,#s5,#s6,#s7,#s8,#s9
118# final_moments none				#s1,#s5,#s8
119# final_moments central				#s2,#s3
120
121model
122  id_model = 'UQ_M'
123  single
124    interface_pointer = 'UQ_I'
125  variables_pointer = 'UQ_V'
126  responses_pointer = 'UQ_R'
127
128variables
129  id_variables = 'UQ_V'
130  continuous_design = 2
131  normal_uncertain = 2
132    means          =  248.89 593.33
133    std_deviations =   12.4   29.7
134    descriptors    =  'nuv1'  'nuv2'
135  uniform_uncertain = 2
136    lower_bounds =  199.3  474.63
137    upper_bounds =  298.5  712.
138    descriptors  =  'uuv1'  'uuv2'
139  weibull_uncertain = 2
140    alphas       =    12. 30.
141    betas        =   250. 590.
142    descriptors  =  'wuv1'  'wuv2'
143
144interface
145  id_interface = 'UQ_I'
146  analysis_drivers = 'text_book_ouu'
147    direct
148# Proliferate as comment to user manual:
149#    fork asynch evaluation_concurrency = 5		#s0
150
151responses
152  id_responses = 'UQ_R'
153  response_functions = 3
154  no_gradients						#s0,#s1,#s3,#s6,#s9
155# analytic_gradients					#s2,#s4,#s5,#s7,#s8
156  no_hessians
157