-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBT8.SIF
118 lines (76 loc) · 1.75 KB
/
BT8.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
***************************
* SET UP THE INITIAL DATA *
***************************
NAME BT8
* Problem :
* *********
* Source: problem 8 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 is not convex.
* SIF input: Ph. Toint, June 1993.
* classification QQR2-AN-5-2
VARIABLES
X1
X2
X3
X4
X5
GROUPS
N OBJ
E CON1 X1 1.0
E CON2
CONSTANTS
BT8 CON1 1.0
BT8 CON2 1.0
BOUNDS
FR BT8 'DEFAULT'
START POINT
* Start 1
XV BT8 X1 1.0
XV BT8 X2 1.0
XV BT8 X3 1.0
XV BT8 X4 0.0
XV BT8 X5 0.0
* Start 2
*XV BT8 X1 7.0
*XV BT8 X2 7.0
*XV BT8 X3 7.0
*XV BT8 X4 0.0
*XV BT8 X5 0.0
ELEMENT TYPE
EV SQ X
ELEMENT USES
T X1SQ SQ
V X1SQ X X1
T X2SQ SQ
V X2SQ X X2
T X3SQ SQ
V X3SQ X X3
T X4SQ SQ
V X4SQ X X4
T X5SQ SQ
V X5SQ X X5
GROUP USES
E OBJ X1SQ X2SQ
E OBJ X3SQ
E CON1 X4SQ -1.0 X2SQ
E CON2 X1SQ X2SQ
E CON2 X5SQ -1.0
OBJECT BOUND
* Solution
*LO SOLTN 1.0
ENDATA
***********************
* SET UP THE FUNCTION *
* AND RANGE ROUTINES *
***********************
ELEMENTS BT8
INDIVIDUALS
T SQ
F X * X
G X 2.0 * X
H X X 2.0
ENDATA