-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathHS33.SIF
109 lines (72 loc) · 1.71 KB
/
HS33.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
***************************
* SET UP THE INITIAL DATA *
***************************
NAME HS33
* Problem :
* *********
* Source: problem 33 in
* W. Hock and K. Schittkowski,
* "Test examples for nonlinear programming codes",
* Lectures Notes in Economics and Mathematical Systems 187, Springer
* Verlag, Heidelberg, 1981.
* SIF input: A.R. Conn, April 1990
* classification OQR2-AN-3-2
VARIABLES
X1
X2
X3
GROUPS
N OBJ X3 1.0
G CON1
G CON2
CONSTANTS
HS33 CON2 4.0
BOUNDS
UP HS33 X3 5.0
START POINT
XV HS33 'DEFAULT' 0.0
HS33 X3 3.0
ELEMENT TYPE
EV SQ V1
EV 3PROD V1
ELEMENT USES
T E1 3PROD
V E1 V1 X1
T E2 SQ
V E2 V1 X1
T E3 SQ
V E3 V1 X2
T E4 SQ
V E4 V1 X3
GROUP USES
E OBJ E1
E CON1 E4 E3 -1.0
E CON1 E2 -1.0
E CON2 E2 E3
E CON2 E4
OBJECT BOUND
* Solution
*LO SOLTN -4.0
ENDATA
***********************
* SET UP THE FUNCTION *
* AND RANGE ROUTINES *
***********************
ELEMENTS HS33
TEMPORARIES
R X1M1
R X1M2
R X1M3
INDIVIDUALS
T 3PROD
A X1M1 V1 - 1.0
A X1M2 V1 - 2.0
A X1M3 V1 - 3.0
F X1M1 * X1M2 * X1M3
G V1 X1M1 * X1M2 + X1M2 *X1M3 + X1M3 * X1M1
H V1 V1 2.0 * ( X1M1 + X1M2 + X1M3 )
T SQ
F V1 * V1
G V1 2.0 * V1
H V1 V1 2.0
ENDATA