|
#define | FTRACE XX->ftrace |
| ========================================================================= More...
|
|
#define | VRESULT XX->result |
| ................ More...
|
|
#define | NITER XX->niter |
|
#define | MC XX->mcontr |
| ............... More...
|
|
#define | NV XX->nvar |
|
#define | NP XX->nvpos |
|
#define | PMETH XX->meth |
|
#define | PMET2 XX->met2 |
|
#define | PMET3 XX->met3 |
|
#define | PDICO XX->met4 |
|
#define | MSR XX->met5 |
|
#define | PRECR XX->met6 |
|
#define | PCOMP XX->met7 |
|
#define | REDON XX->met8 |
|
#define | DYN XX->dyn |
|
#define | VISU XX->ntrace |
|
#define | VIS2 XX->ntrac2 |
|
#define | VIS3 XX->ntrac3 |
|
#define | TMORE 20 |
|
#define | VARC XX->varc |
|
#define | FORCER XX->forcer |
|
#define | PFOURIER XX->fourier |
|
#define | CRITERMAX XX->critermax |
|
#define | CHOIXPIV XX->choixpiv |
|
#define | CHOIXPRIM XX->choixprim |
|
#define | VW1 (XX->ntrac2>=1) |
|
#define | VW2 (XX->ntrac2>=2) |
|
#define | VW3 (XX->ntrac2>=3) |
|
#define | VW4 (XX->ntrac2>=4) |
|
#define | VW5 (XX->ntrac2>=5) |
|
#define | VW6 (XX->ntrac2>=6) |
|
#define | VW7 (XX->ntrac2>=7) |
|
#define | VW8 (XX->ntrac2>=8) |
|
#define | A(A, B) II->a[A][B] |
| ............... More...
|
|
#define | D(A) II->d[A] /**remplace int d[MAXLIGNES+1]; */ |
|
#define | E(A) II->e[A] /**remplace int e[MAXLIGNES+1]; */ |
|
#define | AK(A, B) XX->ak[A][B] |
| ............... More...
|
|
#define | DK(A) XX->dk[A] |
|
#define | B(A) XX->b[A] /**define bb(A) *(&XX->b[0]+A) ok */ |
|
#define | G(A) XX->g[A] |
|
#define | ZVB 1 /**bad problem parameters */ |
| ............... More...
|
|
#define | ZVO 1 /**overflow */ |
|
#define | ZVS 1 /**step signale */ |
|
#define | ZVP1 3 /**pivoting, iteration is indicated */ |
|
#define | ZVP2 6 /**after pivoting, global set *//***/ |
|
#define | ZVTS 3 /**tableau en fin de step */ |
|
#define | ZVA1 2 /**nature and number of constraints */ |
| initial problem
More...
|
|
#define | ZVA4 4 /**initial global set */ |
|
#define | ZVVF 4 /**constrained feature is specified by an inequality */ |
| Variables status
More...
|
|
#define | ZVU1 2 /**unimodular change is indicated */ |
| Extended Euclid Algorithm
More...
|
|
#define | ZVEV 3 /**empty equation is removed */ |
| define ZVU2 4 More...
|
|
#define | ZVG2 1 /**polyedron proved empty by GCD test */ |
| define ZVE4 4 More...
|
|
#define | ZVI1 2 /**inequality division is indicated */ |
| define ZVG3 3 More...
|
|
#define | ZVI3 3 /**inequality division is shown */ |
|
#define | ZVF1 2 /**fourier elimination is indicated */ |
| fourier
More...
|
|
#define | ZVF2 5 /**after fourier 2-2, before removing col, global set */ |
|
#define | ZVF3 4 /**after fourier elimination global set */ |
|
#define | ZVFEC 2 /**empty column */ |
|
#define | ZVFW 2 /**warning, a column is empty and functions are not */ |
|
#define | ZVNPC 6 /**global set after possible columns permutation */ /***/ |
| Non-negative variables
More...
|
|
#define | ZVN1 4 /**chosen inequality is indicated */ |
|
#define | ZVN2 2 /**rhs of chosen inequality is positive */ |
|
#define | ZVNW 2 /**warning, all columns of free variables are empty */ |
|
#define | ZVNG 5 /**gcd of coefficients of free variables */ |
|
#define | ZVC1 3 /**cutting operation */ |
| cut
More...
|
|
#define | ZVCP1 4 /**global set before pivoting */ |
| define ZVC2 4 More...
|
|
#define | ZVCP2 7 /**global set after pivoting, before removing cut *//***/ |
|
#define | ZVCP3 6 /**global set after pivoting */ /**redondant avec ZVP2 *//***/ |
|
#define | ZVR1 2 /**redundant inequality is indicated */ |
| redundant inequalities
More...
|
|
#define | ZVR3 4 /**final global set if redundancies *//***/ |
|
#define | ZVR4 4 /**global set before redundant inequality is removed */ |
|
#define | ZVDS 3 /**surrogate constraint is indicated */ |
| dual
More...
|
|
#define | ZVDEND 3 /**global set after dual */ |
|
#define | ZVSAT2 2 /**one more satisfaction is specified*/ |
| constraint satisfaction
More...
|
|
#define | ZVSAT3 3 /**global set after one more satisfaction or contradiction */ |
|
#define | ZVSAT4 4 /**details concerning satisfaction */ |
|
#define | ZVPRI 2 /**when improved cost function */ |
| primal
More...
|
|
#define | ZVL 1 /**solver result */ |
| last
More...
|
|
#define | ZVL2 3 /**global set */ |
|
#define | ZVBR1 1 /** */ |
| branch
More...
|
|
#define | ZVBR2 2 /** */ |
|
#define | ZVBR3 3 /**details */ |
|
#define | ZVBR4 4 /**details */ |
|
#define | NSTEP XX->nstep |
| ............... More...
|
|
#define | MAJSTEP XX->majstep |
|
#define | NEGAL XX->negal |
|
#define | ICOUT XX->icout |
|
#define | MX XX->mx |
|
#define | NX XX->nx |
|
#define | NREDUN XX->nredun |
|
#define | VREDUN(A) XX->vredun[A] |
|
#define | TMAX XX->tmax |
|
#define | NUMERO XX->numero |
|
#define | NUMAX XX->numax |
|
#define | NUB XX->nub |
|
#define | LASTFREE XX->lastfree |
|
#define | IC1 XX->ic1 |
|
#define | NTP XX->ntp |
|
#define | VDUM XX->vdum /**variables for trace */ |
|
#define | XBUG(A) return xbug(XX,A) |
|
#define | XDEB(A) return xdeb(XX,A) |
|