-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBT13.SIF
133 lines (91 loc) · 2.34 KB
/
BT13.SIF
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
***************************
* SET UP THE INITIAL DATA *
***************************
NAME BT13
* Problem :
* *********
* Source: problem 13 in
* P.T. Boggs and J.W. Tolle,
* "A strategy for global convergence in a sequential
* quadratic programming algorithm",
* SINUM 26(3), pp. 600-623, 1989.
* The problem has been modified by adding a lower bound of 0.0 on x5
* in order to make it bounded below.
* The problem is not convex.
* SIF input: Ph. Toint, June 1993.
* classification LQR2-AY-5-1
VARIABLES
X1
X2
X3
X4
X5
GROUPS
N OBJ X5 1.0
E CON1
BOUNDS
FR BT13 'DEFAULT'
LO BT13 X5 0.0
START POINT
* Start 1
XV BT13 X1 1.0
XV BT13 X2 2.0
XV BT13 X3 3.0
XV BT13 X4 3.0
XV BT13 X5 228.0
ELEMENT TYPE
EV SQ X
EV ISQ2 X Y
IV ISQ2 Z
EV ISQ3 X Y
IV ISQ3 Z
EV ISQ4 X Y
IV ISQ4 Z
ELEMENT USES
T X1SQ SQ
V X1SQ X X1
T X5SQ SQ
V X5SQ X X5
T C1 ISQ2
V C1 X X1
V C1 Y X2
T C2 ISQ3
V C2 X X2
V C2 Y X3
T C3 ISQ4
V C3 X X3
V C3 Y X4
GROUP USES
E CON1 X1SQ C1
E CON1 C2 C3
E CON1 X5SQ -1.0
OBJECT BOUND
* Solution
*LO SOLTN 0.0
ENDATA
***********************
* SET UP THE FUNCTION *
* AND RANGE ROUTINES *
***********************
ELEMENTS BT13
INDIVIDUALS
T SQ
F X * X
G X 2.0 * X
H X X 2.0
T ISQ2
R Z X 1.0 Y -2.0
F Z * Z
G Z Z + Z
H Z Z 2.0
T ISQ3
R Z X 1.0 Y -3.0
F Z * Z
G Z Z + Z
H Z Z 2.0
T ISQ4
R Z X 1.0 Y -4.0
F Z * Z
G Z Z + Z
H Z Z 2.0
ENDATA