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 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388
|
/****************************************************************
Copyright (C) 2011 AMPL Optimization LLC; written by David M. Gay.
Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted,
provided that the above copyright notice appear in all copies and that
both that the copyright notice and this permission notice and warranty
disclaimer appear in supporting documentation.
The author and AMPL Optimization LLC disclaim all warranties with
regard to this software, including all implied warranties of
merchantability and fitness. In no event shall the author be liable
for any special, indirect or consequential damages or any damages
whatsoever resulting from loss of use, data or profits, whether in an
action of contract, negligence or other tortious action, arising out
of or in connection with the use or performance of this software.
****************************************************************/
#include "nlp.h"
#define SKIP_NL2_DEFINES
#undef f_OPNUM
#include "psinfo.h"
#include "jacpdim.h"
#undef cde
#undef ps_func
struct
MPEC_Adjust {
int *cc; /* indices of constraints originally involved in complementarities */
int *cce; /* end of cc array */
int *ck; /* kind of complementarity modification */
real *rhs1; /* start of added constraint right-hand sides */
cgrad **Cgrda; /* linear terms added to existing constraints */
int incc; /* for incrementing constraint lhs and rhs */
int incv; /* for incrementing variable lhs and rhs */
int m0; /* original number of constraints */
int n0; /* original number of variables */
};
static expr_n ZeroExpr = { f_OPNUM_ASL, 0. };
static void
reverse(int *a, int *b)
{
int t;
while(--b > a) {
t = *b;
*b = *a;
*a++ = t;
}
}
void
mpec_adjust_ASL(ASL *asl)
{
MPEC_Adjust *mpa;
cde *cd;
cde2 *cd2;
cgrad **Cgrd, **Cgrd1, **Cgrda, *cg, *cg1, *ncg, **pcg;
char *hx0;
int *cc, *ck, *cv, *ind1, *ind2, *vm;
int i, incc, incv, j, k, m, m0, n, n0, n1, n2, nb, ncc, ncc0, nib, nib0;
int nnv, v1, v2, v3, v4;
real *Lc, *Lc0, *Lc1, *Lv, *Lv0, *Lv1, *Uc, *Uc0, *Uc1, *Uv, *Uv0, *Uv1;
real a, b, *x;
size_t nz, nz0, nznew;
extern void f_OPVARVAL_ASL(), f2_VARVAL_ASL();
n = n0 = n_var;
n2 = asl->i.n_var0;
nib = niv + nbv;
n1 = n - nib;
nib0 = n - nib; /* offset of first linear integer or binary variable */
m = m0 = n_con;
nz = nz0 = nZc;
cv = cvar;
Cgrd = Cgrad;
Cgrd1 = Cgrd + m;
incc = incv = 1;
Lc0 = LUrhs;
if (!(Uc0 = Urhsx)) {
Uc0 = Lc0 + 1;
incc = 2;
}
Lv0 = LUv;
if (!(Uv0 = Uvx)) {
Uv0 = Lv0 + 1;
incv = 2;
}
ncc = ncc0 = n_cc;
Lc1 = Lc0 + m*incc;
Uc1 = Uc0 + m*incc;
Lv1 = Lv0 + n*incv;
Uv1 = Uv0 + n*incv;
for(i = k = 0; i < m0; ++i)
if ((j = cv[i])) {
++k;
Lc = Lc0 + incc*i;
Uc = Uc0 + incc*i;
nb = (*Lc > negInfinity) + (*Uc < Infinity);
/* nb == 0 or 1 */
if (!nb) {
m += 2;
n += 4;
nz += 6;
++ncc;
}
else {
Lv = Lv0 + incv*(j-1);
if (*Lv != 0.) {
++m;
++n;
nz += 2;
}
/* Even if constraint i has the form v >= 0, */
/* add a new variable v1 >= 0 and change the */
/* constraint to v1 = v - rhs, in case v is */
/* involved in more than one complementarity */
++n;
++nz;
}
}
if (k != ncc0) {
fprintf(Stderr,
"\nERROR: mpec_adjust saw %d rather than %d incoming complementarities.\n",
k, ncc0);
exit(1);
}
n_var = n;
n_con = m;
asl->i.n_var1 += nnv = n - n0;
if (n_obj)
adjust_zerograds_ASL(asl, nnv);
if (n_conjac[1] >= m0)
n_conjac[1] = m;
nzc = nZc = nz;
n_cc = ncc;
nznew = nz - nz0;
ncg = (cgrad*)M1alloc(2*(ncc + ncc0)*sizeof(int) + nznew*sizeof(cgrad)
+ ncc0*sizeof(cgrad*) + sizeof(MPEC_Adjust));
asl->i.mpa = mpa = (MPEC_Adjust*)(ncg + nznew);
Cgrda = mpa->Cgrda = (cgrad**)(mpa + 1);
asl->i.ccind1 = ind1 = (int*)(Cgrda + ncc0);
asl->i.ccind2 = ind2 = ind1 + ncc;
mpa->cc = cc = ind2 + ncc;
mpa->ck = ck = mpa->cce = cc + ncc0;
mpa->m0 = m0;
mpa->n0 = n0 - nib;
mpa->rhs1 = Lc1;
mpa->incc = incc;
mpa->incv = incv;
if (nib) {
vm = get_vcmap_ASL(asl, ASL_Sufkind_var);
/* Three reverse calls move nib values of vm up nnv places. */
j = n0 - nib;
reverse(vm+j, vm + n0 + nnv);
reverse(vm+j, vm + j + nnv);
reverse(vm + j + nnv, vm + n0 + nnv);
i = n0 + nnv;
while(--i >= n0) {
j = i - nnv;
Lv0[incv*i] = Lv0[incv*j];
Uv0[incv*i] = Uv0[incv*j];
}
if ((x = X0)) {
i = n0 + nnv;
while(--i >= n0)
x[i] = x[i-nnv];
for(i = n0 - nnv; i < n0; ++i)
x[i] = 0.;
if ((hx0 = havex0)) {
for(i = n0 + nnv; --i >= n0; )
hx0[i] = hx0[i-nnv];
for(i = n0 - nnv;i < n0; ++i)
hx0[i] = 0;
}
}
Lv1 -= j = incv*nib;
Uv1 -= j;
}
else if ((x = X0)) {
memset(x + n0, 0, nnv*sizeof(real));
if ((hx0 = havex0))
memset(hx0 + n0, 0, nnv);
}
#define vset(x,y) *x = y; x += incv;
for(i = 0; i < m0; ++i)
if ((j = cv[i])) {
if (j > nib0)
j += nnv;
*cc++ = i;
pcg = &Cgrd[i];
cg = 0;
while((cg1 = *pcg))
pcg = &(cg = cg1)->next;
*Cgrda++ = cg;
Lc = Lc0 + incv*i;
Uc = Uc0 + incc*i;
Lv = Lv0 + incv*--j;
Uv = Uv0 + incv*j;
a = *Lc;
b = *Uc;
*ck++ = nb = (a > negInfinity) + (b < Infinity);
if (nb == 0) {
/* change L <= v = _svar[j] <= U */
/* and -Infinity <= body <= Infinity into */
/* v1 = v - L >= 0, v2 = U - v >= 0, */
/* v3 - v4 = body, v3 >= 0, v4 >= 0, */
/* v1 complements v3, v2 complements v4 */
*Lc = *Uc = 0.;
*ind1++ = v1 = n1++;
*ind1++ = v2 = n1++;
*ind2++ = v3 = n1++;
*ind2++ = v4 = n1++;
for(k = 0; k < 4; ++k) {
vset(Lv1, 0.);
vset(Uv1, Infinity);
}
ncg[1].varno = n2+3;
ncg[1].coef = 1.;
ncg[1].next = 0;
ncg[0].varno = n2+2;
ncg[0].coef = -1.;
ncg[0].next = &ncg[1];
*pcg = ncg;
ncg += 2;
ncg[1].varno = n2;
ncg[1].coef = -1.;
ncg[1].next = 0;
ncg[0].varno = j;
ncg[0].coef = 1.;
ncg[0].next = &ncg[1];
*Lc1 = *Uc1 = *Lv;
Lc1 += incc;
Uc1 += incc;
*Cgrd1++ = ncg;
ncg += 2;
ncg[1].varno = n2+1;
ncg[1].coef = 1.;
ncg[1].next = 0;
ncg[0].varno = j;
ncg[0].coef = 1.;
ncg[0].next = &ncg[1];
*Lc1 = *Uc1 = *Uv;
Lc1 += incc;
Uc1 += incc;
*Cgrd1++ = ncg;
ncg += 2;
n2 += 4;
}
else {
/*nb == 1*/
v1 = j;
if (*Lv != 0.) {
/* For v = _svar[j], replace */
/* v >= a with v1 = v - a, v1 >= 0, or */
/* v <= b with v1 = b - v, v1 >= 0 */
v1 = n1++;
vset(Lv1, 0.);
vset(Uv1, Infinity);
ncg[1].varno = n2++;
ncg[1].next = 0;
ncg[0].varno = j;
ncg[0].coef = 1.;
ncg[0].next = &ncg[1];
if (*Lv > negInfinity) {
ncg[1].coef = -1.;
*Lc1 = *Uc1 = *Lv;
}
else {
ncg[1].coef = 1.;
*Lc1 = *Uc1 = *Uv;
}
Lc1 += incc;
Uc1 += incc;
*Cgrd1++ = ncg;
ncg += 2;
}
*ind1++ = v1;
*ind2++ = n1++;
ncg->varno = n2++;
ncg->next = 0;
vset(Lv1, 0.);
vset(Uv1, Infinity);
if (*Lv > negInfinity) {
ncg->coef = -1.;
*Uc = *Lc;
}
else {
ncg->coef = 1.;
*Lc = *Uc;
}
*pcg = ncg++;
}
}
#undef vset
i = m0;
asl->i.n_con1 += k = m - m0;
switch(asl->i.ASLtype) {
case ASL_read_pfg:
memset(((ASL_pfg*)asl)->P.cps + m0, 0, k*sizeof(ps_func));
cd = ((ASL_pfg*)asl)->I.con_de_;
goto have_cd;
case ASL_read_f:
case ASL_read_fg:
cd = ((ASL_fg*)asl)->I.con_de_;
have_cd:
while(i < m)
cd[i++].e = (expr*)&ZeroExpr;
break;
case ASL_read_fgh:
cd2 = ((ASL_fgh*)asl)->I.con2_de_;
goto have_cd2;
case ASL_read_pfgh:
memset(((ASL_pfgh*)asl)->P.cps + m0, 0, k*sizeof(ps_func2));
cd2 = ((ASL_pfgh*)asl)->I.con2_de_;
have_cd2:
while(i < m)
cd2[i++].e = (expr2*)&ZeroExpr;
}
}
void
mpec_auxvars_ASL(ASL *asl, real *c, real *x)
{
/* Adjust variables added by mpec_adjust_ASL() so the constraints */
/* added by mpec_adjust_ASL() are satisfied. */
MPEC_Adjust *mpa;
cgrad **Cg, **Cga, *cg;
int *cc, *cce, *ck, *cv, i, incc, incv, j, m0, n0, *vmi;
real *Lc, *Lc0, *Lc1, *Lv0, *ca, t;
mpa = asl->i.mpa;
cv = cvar;
cc = mpa->cc;
cce = mpa->cce;
ck = mpa->ck;
Cga = mpa->Cgrda;
m0 = mpa->m0;
n0 = mpa->n0;
Cg = Cgrad + m0;
ca = c + m0;
Lc0 = LUrhs;
Lc1 = mpa->rhs1;
Lv0 = LUv;
incc = mpa->incc;
incv = mpa->incv;
vmi = get_vminv_ASL(asl);
do {
t = c[i = *cc++];
c[i] = 0.;
j = cv[i] - 1;
for(cg = *Cga++; cg->varno < n0; cg = cg->next);
Lc = Lc0 + i*incc;
if (!*ck++) {
if (t >= 0.)
x[vmi[cg->varno]] = t;
else {
cg = cg->next;
x[vmi[cg->varno]] = -t;
}
cg = (*Cg++)->next;
x[vmi[cg->varno]] = x[j] - *Lc1;
*ca++ = *Lc1;
Lc1 += incc;
cg = (*Cg++)->next;
x[vmi[cg->varno]] = *Lc1 - x[j];
*ca++ = *Lc1;
Lc1 += incc;
}
else {
x[vmi[cg->varno]] = cg->coef*(*Lc - t);
c[i] = *Lc;
if (Lv0[incv*j] != 0.) {
cg = (*Cg++)->next;
x[vmi[cg->varno]] = cg->coef*(*Lc1 - x[j]);
*ca++ = *Lc1;
Lc1 += incc;
}
}
} while(cc < cce);
}
|