1#@ s0: DakotaConfig=HAVE_NPSOL
2#@ s1: DakotaConfig=HAVE_NPSOL
3#@ s2: DakotaConfig=HAVE_NPSOL
4#@ s3: DakotaConfig=HAVE_NPSOL
5#@ s4: DakotaConfig=HAVE_NPSOL
6#@ s5: DakotaConfig=HAVE_DOT
7#@ s6: DakotaConfig=HAVE_DOT
8#@ s7: DakotaConfig=HAVE_DOT
9#@ s8: DakotaConfig=HAVE_DOT
10#@ s9: DakotaConfig=HAVE_DOT
11#@ s20: DakotaConfig=HAVE_NLPQL
12#@ s21: DakotaConfig=HAVE_NLPQL
13#@ s22: DakotaConfig=HAVE_NLPQL
14#@ s23: DakotaConfig=HAVE_NLPQL
15#@ s24: DakotaConfig=HAVE_NLPQL
16# DAKOTA INPUT FILE : dakota_cyl_head.in
17# This file covers a testing matrix in which NPSOL, DOT, CONMIN, and OPT++
18# each solve the cyl_head problem with 5 different formulations:
19# (1) minimization w/ 3 nonlinear 1-sided ineq
20# (2) minimization w/ 3 nonlinear 1-sided ineq plus 1 linear 1-sided ineq
21# (3) minimization w/ 3 nonlinear 1-sided ineq plus 1 linear eq
22# (4) minimization w/ 2 nonlinear 2-sided ineq plus 1 nonlinear eq
23# (5) maximization w/ 3 nonlinear 1-sided ineq (non-default bounds)
24
25environment,
26	  tabular_data
27
28method,
29	npsol_sqp					#s0,#s1,#s2,#s3,#s4
30#	dot_sqp						#s5,#s6,#s7,#s8,#s9
31#	conmin_mfd     					#s10,#s11,#s12,#s13,#s14
32#	optpp_q_newton					#s15,#s16,#s17,#s18,#s19
33#	nlpql_sqp					#s20,#s21,#s22,#s23,#s24
34#	reduced_sqp
35	  convergence_tolerance = 1.e-8
36#	scaling						#s9
37
38variables,
39	continuous_design = 2
40	  initial_point    1.8          1.0
41	  upper_bounds     2.164        4.0
42	  lower_bounds     1.5          0.0
43	  descriptors      'intake_dia' 'flatness'
44#	linear_inequality_constraint_matrix = 1. 1.	#s1,#s6,#s11,#s16,#s21
45#	linear_inequality_upper_bounds = 3.7		#s1,#s6,#s11,#s16,#s21
46#	linear_equality_constraint_matrix = 1. 1.	#s2,#s7,#s12,#s17,#s22
47#	linear_equality_targets = 3.7			#s2,#s7,#s12,#s17,#s22
48#	scale_type = 'value'						#s9
49#	scales     = 1.8 1.0						#s9
50
51interface,
52  direct
53	  analysis_drivers =  'cyl_head'
54
55responses,
56	objective_functions = 1
57#	sense = "maximize"				    #s4,#s9,#s14,#s19,#s24
58	nonlinear_inequality_constraints = 3		    #s0,#s1,#s2,#s4,#s5,#s6,#s7,#s9,#s10,#s11,#s12,#s14,#s15,#s16,#s17,#s19,#s20,#s21,#s22,#s24
59#	nonlinear_inequality_lower_bounds = -.25 -.25 -.25  #s4,#s9,#s14,#s19,#s24
60#	nonlinear_inequality_upper_bounds = 1e50 1e50 1e50  #s4,#s9,#s14,#s19,#s24
61#	nonlinear_inequality_constraints = 2		    #s3,#s8,#s13,#s18,#s23
62#	nonlinear_inequality_lower_bounds = -.2 -.2	    #s3,#s8,#s13,#s18,#s23
63#	nonlinear_inequality_upper_bounds =  .2  .2	    #s3,#s8,#s13,#s18,#s23
64#	nonlinear_equality_constraints = 1   	 	    #s3,#s8,#s13,#s18,#s23
65#	nonlinear_equality_targets = -.2 		    #s3,#s8,#s13,#s18,#s23
66	analytic_gradients
67#	numerical_gradients
68#	  method_source dakota
69#	  interval_type central
70#	  fd_gradient_step_size = 1.e-4
71	no_hessians
72