lpexact_bounding.h
Go to the documentation of this file.
31/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
70 SCIP_Bool* primalfeasible, /**< pointer to store whether the solution is primal feasible, or NULL */
common defines and data types used in all packages of SCIP
internal methods for exact LP management
SCIP_RETCODE SCIPlpExactComputeSafeBound(SCIP_LP *lp, SCIP_LPEXACT *lpexact, SCIP_SET *set, SCIP_MESSAGEHDLR *messagehdlr, BMS_BLKMEM *blkmem, SCIP_STAT *stat, SCIP_EVENTQUEUE *eventqueue, SCIP_PROB *prob, SCIP_Bool *lperror, SCIP_Bool usefarkas, SCIP_Real *safebound, SCIP_Bool *primalfeasible, SCIP_Bool *dualfeasible)
Definition: lpexact_bounding.c:2304
memory allocation routines
public methods for LP management
Definition: struct_event.h:237
Definition: struct_lpexact.h:263
Definition: struct_lp.h:275
Definition: struct_message.h:46
Definition: struct_prob.h:49
Definition: struct_set.h:75
Definition: struct_stat.h:62
Definition: heur_padm.c:135
type definitions for LP management
type definitions for exact LP management
type definitions for miscellaneous datastructures
type definitions for storing and manipulating the main problem
type definitions for rational numbers
type definitions for global SCIP settings
type definitions for storing primal CIP solutions
type definitions for problem statistics
type definitions for problem variables