-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBURKEHAN.SIF
77 lines (46 loc) · 999 Bytes
/
BURKEHAN.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
***************************
* SET UP THE INITIAL DATA *
***************************
NAME BURKEHAN
* Problem :
* *********
* Source: an infeasible problem
* J. V. Burke and S. P. Han,
* "A robust SQP method",
* Mathematical Programming 43 1989:277-303
* SIF input: Nick Gould, May 2008
* classification QOR2-AN-1-1
VARIABLES
X
GROUPS
N OBJ X 1.0
L CON
CONSTANTS
X BURKEHAN CON -1.0
BOUNDS
XM BURKEHAN X
XU BURKEHAN X 0.0
START POINT
BURKEHAN X 10.0
ELEMENT TYPE
EV SQ V1
ELEMENT USES
T E SQ
V E V1 X
GROUP USES
E CON E
OBJECT BOUND
* Solution (infeasible)
*LO SOLTN 0.0
ENDATA
***********************
* SET UP THE FUNCTION *
* AND RANGE ROUTINES *
***********************
ELEMENTS BURKEHAN
INDIVIDUALS
T SQ
F V1 * V1
G V1 V1 + V1
H V1 V1 2.0
ENDATA