-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCONGIGMZ.SIF
101 lines (62 loc) · 1.66 KB
/
CONGIGMZ.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
***************************
* SET UP THE INITIAL DATA *
***************************
NAME CONGIGMZ
* Problem :
* *********
* A constrained nonlinear minmax problem.
* This problem is a constrained variant of problem G1GOMEZ1: the linear
* constraints C4 and C5 have been added.
* Source:
* M.C. Pinar and S.A. Zenios,
* "Approximately Exact Smoothing Functions for Exact Penalty Methods",
* Institute for Numerical Analysis, TUD, Lyngby, Denmark.
* SIF input: Ph. Toint, August 1993.
* classification LQR2-AN-3-5
VARIABLES
X1
X2
Z
GROUPS
XN OBJ Z 1.0
XG C1 Z 1.0
XG C1 X1 5.0 X2 -1.0
XG C2 Z 1.0 X2 -4.0
XG C3 Z 1.0
XG C3 X1 -5.0 X2 -1.0
XL C4 X1 1.0 X2 1.0
XL C5
CONSTANTS
CONGIGMZ C4 -10.0
CONGIGMZ C5 -4.0
BOUNDS
FR CONGIGMZ 'DEFAULT'
START POINT
XV CONGIGMZ X1 2.0
XV CONGIGMZ X2 2.0
XV CONGIGMZ Z 2.0
ELEMENT TYPE
EV SQ X
ELEMENT USES
T X1SQ SQ
ZV X1SQ X X1
T X2SQ SQ
ZV X2SQ X X2
GROUP USES
E C2 X1SQ -1.0 X2SQ -1.0
E C5 X1SQ 2.0 X2SQ -1.0
OBJECT BOUND
* Solution
*LO SOLTN 28.0
ENDATA
***********************
* SET UP THE FUNCTION *
* AND RANGE ROUTINES *
***********************
ELEMENTS CONGIGMZ
INDIVIDUALS
T SQ
F X * X
G X X + X
H X X 2.0
ENDATA