PIPS
|
========================================================================= More...
#include <iproblem.h>
Data Fields | |
int | result |
int | jinfini |
int | nvar |
column in case of infinite vale of function More... | |
int | mcontr |
nombre de variables originales More... | |
int | nvpos |
nombre de fonctions et contraintes originales More... | |
FILE * | ftrace |
nombre de variables originales contraintes (rangees en tete). More... | |
int | dyn |
numero "file system" pour "trace" More... | |
int | dyit |
int | ntrace |
int | ntrac2 |
niveau "trace" (execution accompagnee de commentaires) 0: aucune impression >= 1: volume d'information croit avec le niveau 4: comportement probleme decrit en "latex" More... | |
int | ntrac3 |
int | fourier |
int | varc |
(3) elimination FOURIER-MOTZKIN 0: elimination non appliquee 1: cas triviaux ( >= 2: lorsque le nombre d'inequations decroit >= 3: lorsque le nombre d'inequations n'augmente pas More... | |
int | forcer |
(0-1) introduction variables contraintes 0 "strategie simplexe" 1 pivot unitaire sinon "strategie simplexe" 2 pivot unitaire sinon variable unique ajoutee >= 3 mise au point More... | |
int | remove |
in any case non negative variables More... | |
int | meth |
redundant inequalities are removed More... | |
int | met2 |
(0-1) methode finale de resolution More... | |
int | met3 |
int | met4 |
int | met5 |
int | met6 |
int | met7 |
int | met8 |
int | turbo |
int | critermax |
int | choixpiv |
int | choixprim |
(0-1) choix du pivot (simplexe dual) 0 plus petit pivot 1 plus grand pivot More... | |
int | negal |
nature contraintes 0 egalite 1 inequation <= -1 inequation >= 2 fonction a minimiser -2 fonction a maximiser 3 fonction d'accompagnement More... | |
int | icout |
int | minimum |
int | mx |
int | nx |
int | ic1 |
int | tmax |
int | niter |
int | itdirect |
int | nredun |
int | numero |
int | numax |
int | lastfree |
int | nub |
int | ntp |
int | vdum |
int | nturb |
Value | ak [AKLIGNES][AKCOLONNES] |
Value | dk [AKLIGNES] |
int | b [AKCOLONNES+1] |
int | g [AKLIGNES] |
int | vredun [AKLIGNES] |
note g[0] inutilise More... | |
Value | ibound [AKCOLONNES+1+AKLIGNES] |
Value | ilbound [AKCOLONNES+1+AKLIGNES] |
int | utilb [AKCOLONNES+1+AKLIGNES] |
float | rbound [AKCOLONNES+1+AKLIGNES] |
float | rlbound [AKCOLONNES+1+AKLIGNES] |
int | frequency [AKCOLONNES+1+AKLIGNES] |
Value | tturb [30][AKCOLONNES] |
Value | dturb [30] |
int | jturb [30] |
int | state |
int | tilt |
int | marque |
int | repere |
int | lu |
int | cu |
int | vbest |
int | bloquer |
Value | decrement |
Value | bestlow |
Value | bestup |
float | rrbest |
int | nstep |
.......... More... | |
int | majstep |
int | itemp |
float | ftemp |
int | mcdeb |
nt croix; More... | |
int | nxdeb |
int | mcfin |
int | nxfin |
int | niveau |
=========================================================================
SIMPLEXE for integer variables
ALL-INTEGER METHODS
Jean Claude SOGNO
Projet CHLOE – INRIA ROCQUENCOURT
Juin 1994
========================================================================= ========================================================================= Duong NGUYEN QUE
Adaption to abstract computation: janusvalue
CRI-ENSMP
=========================================================================
Definition at line 15 of file iproblem.h.
Value problem::ak[AKLIGNES][AKCOLONNES] |
Definition at line 84 of file iproblem.h.
Referenced by copystructure().
int problem::b[AKCOLONNES+1] |
Definition at line 86 of file iproblem.h.
Referenced by copystructure().
Value problem::bestlow |
Definition at line 99 of file iproblem.h.
Referenced by choose(), and computebounds().
Value problem::bestup |
Definition at line 99 of file iproblem.h.
Referenced by choose(), computebounds(), and failuresp().
int problem::bloquer |
Definition at line 98 of file iproblem.h.
Referenced by failure(), and failuresp().
int problem::choixpiv |
Definition at line 48 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::choixprim |
(0-1) choix du pivot (simplexe dual) 0 plus petit pivot 1 plus grand pivot
Definition at line 51 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::critermax |
Definition at line 47 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::cu |
Definition at line 98 of file iproblem.h.
Referenced by eclater(), and presence().
Value problem::decrement |
Definition at line 99 of file iproblem.h.
Referenced by computebounds(), lowbound(), and upperbound().
Definition at line 85 of file iproblem.h.
Referenced by copystructure(), eclater(), failure(), fastplus(), and iprimalplus().
Value problem::dturb[30] |
Definition at line 96 of file iproblem.h.
Referenced by cutiteration(), and ipivotage2().
int problem::dyit |
Definition at line 26 of file iproblem.h.
Referenced by dynam().
int problem::dyn |
numero "file system" pour "trace"
Definition at line 25 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::forcer |
(0-1) introduction variables contraintes 0 "strategie simplexe" 1 pivot unitaire sinon "strategie simplexe" 2 pivot unitaire sinon variable unique ajoutee >= 3 mise au point
Definition at line 43 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::fourier |
Definition at line 33 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::frequency[AKCOLONNES+1+AKLIGNES] |
Definition at line 94 of file iproblem.h.
float problem::ftemp |
Definition at line 104 of file iproblem.h.
FILE* problem::ftrace |
nombre de variables originales contraintes (rangees en tete).
Usuellement =0 en calcul de dependances
Definition at line 22 of file iproblem.h.
Referenced by copystructure(), dynam(), sc_janus_feasibility(), and sc_to_iproblem().
Definition at line 87 of file iproblem.h.
Referenced by copystructure().
Value problem::ibound[AKCOLONNES+1+AKLIGNES] |
Definition at line 89 of file iproblem.h.
Referenced by ajout(), boundssum(), choose(), computebounds(), copybound(), listehb(), lowbound(), majlowbounds(), majuu(), reduction(), upperbound(), and voirbornes().
int problem::ic1 |
Definition at line 74 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::icout |
Definition at line 72 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
Value problem::ilbound[AKCOLONNES+1+AKLIGNES] |
Definition at line 90 of file iproblem.h.
Referenced by ajout(), boundssum(), choose(), computebounds(), copybound(), lowbound(), majlowbounds(), majuu(), reduction(), and voirbornes().
int problem::itdirect |
Definition at line 77 of file iproblem.h.
Referenced by dynam(), and sc_to_iproblem().
int problem::itemp |
Definition at line 104 of file iproblem.h.
int problem::jinfini |
Definition at line 17 of file iproblem.h.
int problem::jturb[30] |
Definition at line 97 of file iproblem.h.
Referenced by cutiteration(), and dualentier().
int problem::lastfree |
Definition at line 79 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::lu |
Definition at line 98 of file iproblem.h.
Referenced by eclater(), and presence().
int problem::majstep |
Definition at line 102 of file iproblem.h.
int problem::marque |
Definition at line 98 of file iproblem.h.
Referenced by iprimalplus(), and recup().
int problem::mcdeb |
nt croix;
Definition at line 107 of file iproblem.h.
int problem::mcfin |
Definition at line 107 of file iproblem.h.
int problem::mcontr |
nombre de variables originales
Definition at line 19 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::met2 |
(0-1) methode finale de resolution
Definition at line 46 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::met3 |
Definition at line 46 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::met4 |
Definition at line 46 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::met5 |
Definition at line 46 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::met6 |
Definition at line 46 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::met7 |
Definition at line 46 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::met8 |
Definition at line 46 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::meth |
redundant inequalities are removed
Definition at line 45 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::minimum |
Definition at line 73 of file iproblem.h.
Referenced by copystructure(), init_janus(), integerrealline(), iprimalplus(), is2(), isolve(), and sc_to_iproblem().
int problem::mx |
Definition at line 74 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::negal |
nature contraintes 0 egalite 1 inequation <= -1 inequation >= 2 fonction a minimiser -2 fonction a maximiser 3 fonction d'accompagnement
nt e[MAXLIGNES+1] ; nt d[MAXLIGNES+1] ; rhs nt a[MAXLIGNES+1][MAXCOLONNES+1] ; matrix coefficients ........... local data .............................................
Definition at line 71 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::niter |
Definition at line 76 of file iproblem.h.
Referenced by copystructure(), dynam(), and sc_to_iproblem().
int problem::niveau |
Definition at line 108 of file iproblem.h.
int problem::nredun |
Definition at line 77 of file iproblem.h.
Referenced by init_janus(), is2(), and sc_to_iproblem().
int problem::nstep |
..........
. visualization local data ....................................
Definition at line 102 of file iproblem.h.
int problem::ntp |
Definition at line 81 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::ntrac2 |
niveau "trace" (execution accompagnee de commentaires) 0: aucune impression >= 1: volume d'information croit avec le niveau 4: comportement probleme decrit en "latex"
Definition at line 31 of file iproblem.h.
Referenced by copystructure(), sc_janus_feasibility(), and sc_to_iproblem().
int problem::ntrac3 |
Definition at line 32 of file iproblem.h.
Referenced by copystructure(), integertoreal(), and sc_to_iproblem().
int problem::ntrace |
Definition at line 27 of file iproblem.h.
Referenced by copystructure(), sc_janus_feasibility(), and sc_to_iproblem().
int problem::nturb |
Definition at line 83 of file iproblem.h.
Referenced by cutiteration(), dualentier(), and sc_to_iproblem().
int problem::nub |
Definition at line 80 of file iproblem.h.
Referenced by sc_to_iproblem().
int problem::numax |
Definition at line 78 of file iproblem.h.
Referenced by copybound(), copystructure(), reduction(), and sc_to_iproblem().
int problem::numero |
Definition at line 78 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::nvar |
column in case of infinite vale of function
Definition at line 18 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::nvpos |
nombre de fonctions et contraintes originales
Definition at line 20 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::nx |
Definition at line 74 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::nxdeb |
Definition at line 107 of file iproblem.h.
int problem::nxfin |
Definition at line 107 of file iproblem.h.
float problem::rbound[AKCOLONNES+1+AKLIGNES] |
Definition at line 92 of file iproblem.h.
Referenced by lowbound(), and upperbound().
int problem::remove |
in any case non negative variables
Definition at line 44 of file iproblem.h.
Referenced by copystructure(), is2(), and sc_to_iproblem().
int problem::repere |
Definition at line 98 of file iproblem.h.
Referenced by iprimalplus(), reducedpb(), and splitpb().
int problem::result |
Definition at line 16 of file iproblem.h.
float problem::rlbound[AKCOLONNES+1+AKLIGNES] |
Definition at line 93 of file iproblem.h.
Referenced by lowbound().
float problem::rrbest |
Definition at line 100 of file iproblem.h.
Referenced by lowbound().
int problem::state |
Definition at line 98 of file iproblem.h.
Referenced by choose(), computebounds(), copystructure(), failuresp(), iprimalplus(), majlowbounds(), pseudocopie(), upperbound(), and vid().
int problem::tilt |
Definition at line 98 of file iproblem.h.
Referenced by choose(), computebounds(), failure(), failuresp(), and lowbound().
int problem::tmax |
Definition at line 75 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
Value problem::tturb[30][AKCOLONNES] |
Definition at line 95 of file iproblem.h.
Referenced by cutiteration(), and ipivotage2().
int problem::turbo |
Definition at line 47 of file iproblem.h.
Referenced by copystructure(), dualentier(), ipivotage2(), and sc_to_iproblem().
int problem::utilb[AKCOLONNES+1+AKLIGNES] |
Definition at line 91 of file iproblem.h.
Referenced by majlowbounds(), and upperbound().
int problem::varc |
(3) elimination FOURIER-MOTZKIN 0: elimination non appliquee 1: cas triviaux ( >= 2: lorsque le nombre d'inequations decroit >= 3: lorsque le nombre d'inequations n'augmente pas
Definition at line 38 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
int problem::vbest |
Definition at line 98 of file iproblem.h.
Referenced by choose(), computebounds(), eclater(), failuresp(), lowbound(), and splitpb().
int problem::vdum |
Definition at line 82 of file iproblem.h.
Referenced by copystructure(), and sc_to_iproblem().
note g[0] inutilise
Definition at line 88 of file iproblem.h.