-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBT12.SIF
125 lines (78 loc) · 1.85 KB
/
BT12.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
***************************
* SET UP THE INITIAL DATA *
***************************
NAME BT12
* Problem :
* *********
* Source: problem 12 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-3
VARIABLES
X1
X2
X3
X4
X5
GROUPS
N OBJ
E CON1 X1 1.0 X2 1.0
E CON2
E CON3 X1 1.0
CONSTANTS
BT12 CON1 25.0
BT12 CON2 25.0
BT12 CON3 2.0
BOUNDS
FR BT12 'DEFAULT'
START POINT
* Start 1
XV BT12 'DEFAULT' 2.0
* Start 2
*XV BT12 'DEFAULT' 1.0
* Start 3
*XV BT12 'DEFAULT' 3.0
* Solution proposed in the paper (infeasible)
XV BT12 X1 15.811
XV BT12 X2 1.5811
XV BT12 X3 0.0
XV BT12 X4 15.083
XV BT12 X5 3.7164
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 0.01 X2SQ
E CON1 X3SQ -1.0
E CON2 X1SQ X2SQ
E CON2 X4SQ -1.0
E CON3 X5SQ -1.0
OBJECT BOUND
* Solution
*LO SOLTN 6.18811881
ENDATA
***********************
* SET UP THE FUNCTION *
* AND RANGE ROUTINES *
***********************
ELEMENTS BT12
INDIVIDUALS
T SQ
F X * X
G X 2.0 * X
H X X 2.0
ENDATA