pub_lp.h
Go to the documentation of this file.
31/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
59/** sorts column entries such that LP rows precede non-LP rows and inside both parts lower row indices precede higher ones
108/** gets the basis status of a column in the LP solution; only valid for LPs with status SCIP_LPSOLSTAT_OPTIMAL
109 * and with SCIPisLPSolBasic(scip) == TRUE; returns SCIP_BASESTAT_ZERO for columns not in the current SCIP_LP
134/** returns whether the associated variable is of integral type (binary, integer, implicit integer) */
170/** get number of nonzero entries in column vector, that correspond to rows currently in the SCIP_LP;
172 * @warning This method is only applicable on columns, that are completely linked to their rows (e.g. a column
173 * that is in the current LP and the LP was solved, or a column that was in a solved LP and didn't change afterwards
192/** gets node number of the last node in current branch and bound run, where strong branching was used on the
206/** gets the age of a column, i.e., the total number of successive times a column was in the LP and was 0.0 in the solution */
220/* In optimized mode, the function calls are overwritten by defines to reduce the number of function calls and
264/** locks an unmodifiable row, which forbids further changes; has no effect on modifiable rows */
270/** unlocks a lock of an unmodifiable row; a row with no sealed lock may be modified; has no effect on modifiable rows */
283/** returns the degree of parallelism between the hyperplanes defined by the two row vectors v, w:
294/** returns the degree of orthogonality between the hyperplanes defined by the two row vectors v, w:
305/** sorts row entries such that LP columns precede non-LP columns and inside both parts lower column indices precede
319/** get number of nonzero entries in row vector, that correspond to columns currently in the SCIP_LP;
321 * @warning This method is only applicable on rows, that are completely linked to their columns (e.g. a row
322 * that is in the current LP and the LP was solved, or a row that was in a solved LP and didn't change afterwards
383/** gets the basis status of a row in the LP solution; only valid for LPs with status SCIP_LPSOLSTAT_OPTIMAL
384 * and with SCIPisLPSolBasic(scip) == TRUE; returns SCIP_BASESTAT_BASIC for rows not in the current SCIP_LP
415/** returns TRUE iff the activity of the row (without the row's constant) is always integral in a feasible solution */
508/* In optimized mode, the function calls are overwritten by defines to reduce the number of function calls and
533#define SCIProwGetOriginCons(row) ((SCIP_CONS*) ((SCIP_ROWORIGINTYPE) row->origintype == SCIP_ROWORIGINTYPE_CONS ? (row)->origin : NULL))
534#define SCIProwGetOriginSepa(row) ((SCIP_SEPA*) ((SCIP_ROWORIGINTYPE) row->origintype == SCIP_ROWORIGINTYPE_SEPA ? (row)->origin : NULL))
common defines and data types used in all packages of SCIP
SCIP_Longint SCIPcolGetStrongbranchNode(SCIP_COL *col)
Definition: lp.c:17173
SCIP_BOUNDTYPE SCIPboundtypeOpposite(SCIP_BOUNDTYPE boundtype)
Definition: lp.c:17203
SCIP_Real SCIProwGetOrthogonality(SCIP_ROW *row1, SCIP_ROW *row2, char orthofunc)
Definition: lp.c:7788
SCIP_Real SCIProwGetScalarProduct(SCIP_ROW *row1, SCIP_ROW *row2)
Definition: lp.c:7008
SCIP_Real SCIProwGetParallelism(SCIP_ROW *row1, SCIP_ROW *row2, char orthofunc)
Definition: lp.c:7724
SCIP_CONSHDLR * SCIProwGetOriginConshdlr(SCIP_ROW *row)
Definition: lp.c:17456
SCIP_Longint SCIProwGetNLPsAfterCreation(SCIP_ROW *row)
Definition: lp.c:17555
Definition: struct_lp.h:136
Definition: struct_cons.h:47
Definition: struct_cons.h:127
Definition: struct_lp.h:202
Definition: struct_sepa.h:47
Definition: struct_var.h:208
data structures for LP management
type definitions for constraints and constraint handlers
type definitions for LP management
type definitions for specific LP solvers interface
type definitions for miscellaneous datastructures
type definitions for separators
type definitions for problem variables