Scippy

SCIP

Solving Constraint Integer Programs

struct_primal.h
Go to the documentation of this file.
1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2 /* */
3 /* This file is part of the program and library */
4 /* SCIP --- Solving Constraint Integer Programs */
5 /* */
6 /* Copyright (C) 2002-2016 Konrad-Zuse-Zentrum */
7 /* fuer Informationstechnik Berlin */
8 /* */
9 /* SCIP is distributed under the terms of the ZIB Academic License. */
10 /* */
11 /* You should have received a copy of the ZIB Academic License */
12 /* along with SCIP; see the file COPYING. If not email to scip@zib.de. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15 
16 /**@file struct_primal.h
17  * @brief datastructures for collecting primal CIP solutions and primal informations
18  * @author Tobias Achterberg
19  */
20 
21 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
22 
23 #ifndef __SCIP_STRUCT_PRIMAL_H__
24 #define __SCIP_STRUCT_PRIMAL_H__
25 
26 
27 #include "scip/def.h"
28 #include "scip/type_sol.h"
29 #include "scip/type_primal.h"
30 
31 #ifdef __cplusplus
32 extern "C" {
33 #endif
34 
35 /** primal data and solution storage */
37 {
38  SCIP_Longint nsolsfound; /**< number of primal CIP solutions found up to now */
39  SCIP_Longint nlimsolsfound; /**< number of primal CIP solutions respecting the objective limit found
40  * up to now */
41  SCIP_Longint nbestsolsfound; /**< number of new best primal CIP solutions found up to now */
42  SCIP_Longint nlimbestsolsfound; /**< number of new best primal CIP solutions respecting the objective limit
43  * found up to now */
44  SCIP_Real upperbound; /**< upper (primal) bound of CIP: objective value of best solution or user bound */
45  SCIP_Real cutoffbound; /**< upper bound for better primal solutions (if objective value is always
46  * integral, cutoffbound is equal to ceil(upperbound) - 1.0 (+eps) */
47  SCIP_SOL** sols; /**< primal CIP solutions */
48  SCIP_SOL** existingsols; /**< all existing primal solutions (feasible and infeasible) */
49  SCIP_SOL* currentsol; /**< internal solution for temporarily storing the current solution */
50  SCIP_SOL* primalray; /**< solution representing the primal ray for (infeasible or) unbounded problems;
51  * warning: this does not have to be a feasible solution */
52  int solssize; /**< size of sols array */
53  int nsols; /**< number of primal CIP solutions stored in sols array */
54  int existingsolssize; /**< size of existingsols array */
55  int nexistingsols; /**< number of primal CIP solutions stored in existingsols array */
56 };
57 
58 #ifdef __cplusplus
59 }
60 #endif
61 
62 #endif
SCIP_Real cutoffbound
Definition: struct_primal.h:45
SCIP_SOL * primalray
Definition: struct_primal.h:50
SCIP_SOL ** sols
Definition: struct_primal.h:47
SCIP_SOL * currentsol
Definition: struct_primal.h:49
SCIP_Longint nsolsfound
Definition: struct_primal.h:38
SCIP_Longint nbestsolsfound
Definition: struct_primal.h:41
SCIP_Longint nlimbestsolsfound
Definition: struct_primal.h:42
type definitions for storing primal CIP solutions
SCIP_Real upperbound
Definition: struct_primal.h:44
#define SCIP_Real
Definition: def.h:127
#define SCIP_Longint
Definition: def.h:112
type definitions for collecting primal CIP solutions and primal informations
common defines and data types used in all packages of SCIP
int existingsolssize
Definition: struct_primal.h:54
SCIP_Longint nlimsolsfound
Definition: struct_primal.h:39
SCIP_SOL ** existingsols
Definition: struct_primal.h:48