PIPS
|
Go to the source code of this file.
Data Structures | |
struct | problem |
========================================================================= More... | |
struct | initpb |
Macros | |
#define | MAXCOLONNES 200 /**08 variables 10-10 */ |
(-) choix du pivot (simplexe primal) More... | |
#define | MAXLIGNES 500 /**50 contraintes 10-10 */ |
#define | MAXNX MAXCOLONNES+9 |
#define | MAXMX MAXLIGNES+9 |
#define | AKCOLONNES MAXNX+1 |
#define | AKLIGNES MAXMX+1 |
#define | MTDAI 0 /**methode DUAL ALL INTEGERS */ |
#define | MTDI2 1 /**methode surrogate uniforme dual all integers */ |
#define | VRFIN 0 /**solution finie */ |
..................... More... | |
#define | VRVID 1 /**polyedre vide */ |
#define | VRINF 2 /**solution infinie */ |
#define | VRINS 3 /**nombre de pivotages insuffisant, bouclage possible */ |
#define | VRDEB 4 /**debordement de tableaux */ |
#define | VRCAL 5 /**appel errone */ |
#define | VRBUG 6 /**bug */ |
#define | VROVF 7 /**overflow */ |
Typedefs | |
typedef struct problem * | Pproblem |
========================================================================= More... | |
typedef struct problem | problem |
typedef struct initpb * | Pinitpb |
typedef struct initpb | initpb |
#define AKCOLONNES MAXNX+1 |
Definition at line 57 of file iproblem.h.
#define AKLIGNES MAXMX+1 |
Definition at line 58 of file iproblem.h.
#define MAXCOLONNES 200 /**08 variables 10-10 */ |
(-) choix du pivot (simplexe primal)
Definition at line 53 of file iproblem.h.
#define MAXLIGNES 500 /**50 contraintes 10-10 */ |
Definition at line 54 of file iproblem.h.
#define MAXMX MAXLIGNES+9 |
Definition at line 56 of file iproblem.h.
#define MAXNX MAXCOLONNES+9 |
Definition at line 55 of file iproblem.h.
Definition at line 110 of file iproblem.h.
#define MTDI2 1 /**methode surrogate uniforme dual all integers */ |
Definition at line 111 of file iproblem.h.
#define VRBUG 6 /**bug */ |
Definition at line 119 of file iproblem.h.
#define VRCAL 5 /**appel errone */ |
Definition at line 118 of file iproblem.h.
#define VRDEB 4 /**debordement de tableaux */ |
Definition at line 117 of file iproblem.h.
#define VRFIN 0 /**solution finie */ |
.....................
resultat du solveur .......................
Definition at line 113 of file iproblem.h.
#define VRINF 2 /**solution infinie */ |
Definition at line 115 of file iproblem.h.
#define VRINS 3 /**nombre de pivotages insuffisant, bouclage possible */ |
Definition at line 116 of file iproblem.h.
#define VROVF 7 /**overflow */ |
Definition at line 120 of file iproblem.h.
#define VRVID 1 /**polyedre vide */ |
Definition at line 114 of file iproblem.h.
=========================================================================
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
=========================================================================