-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBT10.SIF
104 lines (64 loc) · 1.57 KB
/
BT10.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
***************************
* SET UP THE INITIAL DATA *
***************************
NAME BT10
* Problem :
* *********
* Source: problem 10 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 as stated in the paper seems to contain a typo.
* In order to make the second constraint feasible at the proposed
* solution, the sign of x2 in the second constraint has been set
* to - instead of +.
* The problem is not convex.
* SIF input: Ph. Toint, June 1993.
* classification LOR2-AN-2-2
VARIABLES
X1
X2
GROUPS
N OBJ X1 -1.0
E CON1 X2 1.0
E CON2 X2 -1.0
BOUNDS
FR BT10 'DEFAULT'
START POINT
* Start 1
XV BT10 'DEFAULT' 2.0
* Start 2
*XV BT10 'DEFAULT' 20.0
* Start 3
*XV BT10 'DEFAULT' 50.0
ELEMENT TYPE
EV SQ X
EV CB X
ELEMENT USES
T X1SQ SQ
V X1SQ X X1
T X1CB CB
V X1CB X X1
GROUP USES
E CON1 X1CB -1.0
E CON2 X1SQ 1.0
OBJECT BOUND
* Solution
*LO SOLTN -1.0
ENDATA
***********************
* SET UP THE FUNCTION *
* AND RANGE ROUTINES *
***********************
ELEMENTS BT10
INDIVIDUALS
T SQ
F X * X
G X 2.0 * X
H X X 2.0
T CB
F X * X * X
G X 3.0 * X * X
H X X 6.0 * X
ENDATA