Scippy

SCIP

Solving Constraint Integer Programs

type_lp.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-2014 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 type_lp.h
17  * @brief type definitions for LP management
18  * @author Tobias Achterberg
19  */
20 
21 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
22 
23 #ifndef __SCIP_TYPE_LP_H__
24 #define __SCIP_TYPE_LP_H__
25 
26 #ifdef __cplusplus
27 extern "C" {
28 #endif
29 
30 /** solution status after solving LP */
31 enum SCIP_LPSolStat
32 {
33  SCIP_LPSOLSTAT_NOTSOLVED = 0, /**< LP was not solved, no solution exists */
34  SCIP_LPSOLSTAT_OPTIMAL = 1, /**< LP was solved to optimality */
35  SCIP_LPSOLSTAT_INFEASIBLE = 2, /**< LP is primal infeasible */
36  SCIP_LPSOLSTAT_UNBOUNDEDRAY = 3, /**< LP has a primal unbounded ray */
37  SCIP_LPSOLSTAT_OBJLIMIT = 4, /**< objective limit was reached during optimization */
38  SCIP_LPSOLSTAT_ITERLIMIT = 5, /**< iteration limit was reached during optimization */
39  SCIP_LPSOLSTAT_TIMELIMIT = 6, /**< time limit was reached during optimization */
40  SCIP_LPSOLSTAT_ERROR = 7 /**< an error occured during optimization */
41 };
42 typedef enum SCIP_LPSolStat SCIP_LPSOLSTAT;
43 
44 /** type of variable bound: lower or upper bound */
45 enum SCIP_BoundType
46 {
47  SCIP_BOUNDTYPE_LOWER = 0, /**< lower bound */
48  SCIP_BOUNDTYPE_UPPER = 1 /**< upper bound */
49 };
50 typedef enum SCIP_BoundType SCIP_BOUNDTYPE;
51 
52 /** type of row side: left hand or right hand side */
53 enum SCIP_SideType
54 {
55  SCIP_SIDETYPE_LEFT = 0, /**< left hand side */
56  SCIP_SIDETYPE_RIGHT = 1 /**< right hand side */
57 };
58 typedef enum SCIP_SideType SCIP_SIDETYPE;
59 
60 /** type of origin of row */
61 enum SCIP_RowOriginType
62 {
63  SCIP_ROWORIGINTYPE_UNSPEC = 0, /**< unspecified origin of row */
64  SCIP_ROWORIGINTYPE_CONS = 1, /**< row created by constraint handler */
65  SCIP_ROWORIGINTYPE_SEPA = 2 /**< row created by separator */
66 };
67 typedef enum SCIP_RowOriginType SCIP_ROWORIGINTYPE;
68 
69 /** type of LP algorithm */
70 enum SCIP_LPAlgo
71 {
72  SCIP_LPALGO_PRIMALSIMPLEX = 0, /**< primal simplex */
73  SCIP_LPALGO_DUALSIMPLEX = 1, /**< dual simplex */
74  SCIP_LPALGO_BARRIER = 2, /**< barrier algorithm */
75  SCIP_LPALGO_BARRIERCROSSOVER = 3 /**< barrier algorithm with crossover */
76 };
77 typedef enum SCIP_LPAlgo SCIP_LPALGO;
78 
79 typedef struct SCIP_ColSolVals SCIP_COLSOLVALS; /**< collected values of a column which depend on the LP solution */
80 typedef struct SCIP_RowSolVals SCIP_ROWSOLVALS; /**< collected values of a row which depend on the LP solution */
81 typedef struct SCIP_LpSolVals SCIP_LPSOLVALS; /**< collected values of the LP data which depend on the LP solution */
82 
83 /** column of an LP
84  *
85  * - \ref ColumnMethods "List of all available methods"
86  */
87 typedef struct SCIP_Col SCIP_COL;
88 
89 /** row of an LP
90  *
91  * - \ref RowMethods "List of all available methods"
92  */
93 typedef struct SCIP_Row SCIP_ROW;
94 
95 /** LP structure
96  *
97  * - \ref LPMethods "List of all available methods"
98  */
99 typedef struct SCIP_Lp SCIP_LP;
100 
101 #ifdef __cplusplus
102 }
103 #endif
104 
105 #endif
106