GRB#

GRB#

Class for .NET enums and constants. The enums are used to get or setGurobi attributes or parameters.

Constants

The following list contains the set of constants needed by the Gurobi.NET interface. You would refer to them using aGRB. prefix (e.g.,GRB.Status.OPTIMAL).

// Model status codes (after call to optimize())/// <summary>/// Optimization status codes/// </summary>publicclassStatus{/// <summary>/// Model is loaded, but no solution information is available./// </summary>publicconstintLOADED=1;/// <summary>/// Model was solved to optimality (subject to tolerances) and an optimal/// solution is available./// </summary>publicconstintOPTIMAL=2;/// <summary>/// Model was proven to be infeasible./// </summary>publicconstintINFEASIBLE=3;/// <summary>/// Model was proven to be either infeasible or unbounded./// </summary>publicconstintINF_OR_UNBD=4;/// <summary>/// Model was proven to be unbounded./// </summary>publicconstintUNBOUNDED=5;/// <summary>/// Optimal objective was proven to be worse than the value specified/// in the Cutoff parameter./// </summary>publicconstintCUTOFF=6;/// <summary>/// Optimization terminated because the total number of simplex/// iterations performed exceeded the limit specified in the IterationLimit/// parameter./// </summary>publicconstintITERATION_LIMIT=7;/// <summary>/// Optimization terminated because the total number of branch-and-cut/// nodes explored exceeded the limit specified in the NodeLimit/// parameter./// </summary>publicconstintNODE_LIMIT=8;/// <summary>/// Optimization terminated because the total elapsed time/// exceeded the limit specified in the TimeLimit parameter./// </summary>publicconstintTIME_LIMIT=9;/// <summary>/// Optimization terminated because the number of solutions found/// reached the value specified in the SolutionLimit parameter./// </summary>publicconstintSOLUTION_LIMIT=10;/// <summary>/// Optimization was terminated by the user./// </summary>publicconstintINTERRUPTED=11;/// <summary>/// Optimization was terminated due to unrecoverable numerical/// difficulties./// </summary>publicconstintNUMERIC=12;/// <summary>/// Optimization terminated with a sub-optimal solution./// </summary>publicconstintSUBOPTIMAL=13;/// <summary>/// Optimization is still in progress./// </summary>publicconstintINPROGRESS=14;/// <summary>/// User specified objective limit (a bound on either the best objective/// or the best bound), and that limit has been reached./// </summary>publicconstintUSER_OBJ_LIMIT=15;/// <summary>/// Optimization terminated because the total elapsed work/// exceeded the limit specified in the WorkLimit parameter./// </summary>publicconstintWORK_LIMIT=16;/// <summary>/// Optimization terminated because the total amount of allocated/// memory exceeded the limit specified in the SoftMemLimit parameter./// </summary>publicconstintMEM_LIMIT=17;/// <summary>/// Model was solved to local optimality (subject to tolerances) and/// a first-order optimal solution point is available./// </summary>publicconstintLOCALLY_OPTIMAL=18;/// <summary>/// A first-order minimizer of the constraint violation was found./// </summary>publicconstintLOCALLY_INFEASIBLE=19;}/// <summary>/// Batch status codes/// </summary>publicclassBatchStatus{/// <summary>/// Batch object was created, but is not ready to be scheduled./// See the Batch Optimization section of the manual for more details./// </summary>publicconstintCREATED=1;/// <summary>/// The Batch object has been completely specified, and now is waiting/// for a job to finish processing the request./// See the Batch Optimization section of the manual for more details./// </summary>publicconstintSUBMITTED=2;/// <summary>/// Batch processing was aborted by the user./// See the Batch Optimization section of the manual for more details./// </summary>publicconstintABORTED=3;/// <summary>/// Batch processing failed./// See the Batch Optimization section of the manual for more details./// </summary>publicconstintFAILED=4;/// <summary>/// A Batch Job successfully processed the Batch request./// See the Batch Optimization section of the manual for more details./// </summary>publicconstintCOMPLETED=5;}// Constraint senses/// <summary>/// Less or equal constraint sense./// </summary>publicconstcharLESS_EQUAL='<';/// <summary>/// Greater or equal constraint sense./// </summary>publicconstcharGREATER_EQUAL='>';/// <summary>/// Equal constraint sense./// </summary>publicconstcharEQUAL='=';// Variable types/// <summary>/// Continuous variable./// </summary>publicconstcharCONTINUOUS='C';/// <summary>/// Binary variable./// </summary>publicconstcharBINARY='B';/// <summary>/// Integer variable./// </summary>publicconstcharINTEGER='I';/// <summary>/// Semi-continuous variable./// </summary>publicconstcharSEMICONT='S';/// <summary>/// Semi-integer variable./// </summary>publicconstcharSEMIINT='N';// Objective sense/// <summary>/// Minimization objective./// </summary>publicconstintMINIMIZE=1;/// <summary>/// Maximization objective./// </summary>publicconstintMAXIMIZE=-1;// SOS types/// <summary>/// SOS of type 1./// </summary>publicconstintSOS_TYPE1=1;/// <summary>/// SOS of type 2./// </summary>publicconstintSOS_TYPE2=2;// General constraint types/// <summary>/// General constraint maximum./// </summary>publicconstintGENCONSTR_MAX=0;/// <summary>/// General constraint minimum./// </summary>publicconstintGENCONSTR_MIN=1;/// <summary>/// General constraint absolute value./// </summary>publicconstintGENCONSTR_ABS=2;/// <summary>/// General constraint logical AND./// </summary>publicconstintGENCONSTR_AND=3;/// <summary>/// General constraint logical OR./// </summary>publicconstintGENCONSTR_OR=4;/// <summary>/// General constraint norm./// </summary>publicconstintGENCONSTR_NORM=5;/// <summary>/// General constraint nonlinear multivariate function./// </summary>publicconstintGENCONSTR_NL=6;/// <summary>/// General constraint indicator./// </summary>publicconstintGENCONSTR_INDICATOR=7;/// <summary>/// General constraint piecewise-linear./// </summary>publicconstintGENCONSTR_PWL=8;/// <summary>/// General constraint polynomial function./// </summary>publicconstintGENCONSTR_POLY=9;/// <summary>/// General constraint natural exponential function./// </summary>publicconstintGENCONSTR_EXP=10;/// <summary>/// General constraint exponential function./// </summary>publicconstintGENCONSTR_EXPA=11;/// <summary>/// General constraint natural logarithmic function./// </summary>publicconstintGENCONSTR_LOG=12;/// <summary>/// General constraint logarithmic function./// </summary>publicconstintGENCONSTR_LOGA=13;/// <summary>/// General constraint power function./// </summary>publicconstintGENCONSTR_POW=14;/// <summary>/// General constraint sine function./// </summary>publicconstintGENCONSTR_SIN=15;/// <summary>/// General constraint cosine function./// </summary>publicconstintGENCONSTR_COS=16;/// <summary>/// General constraint tangent function./// </summary>publicconstintGENCONSTR_TAN=17;/// <summary>/// General constraint logistic function./// </summary>publicconstintGENCONSTR_LOGISTIC=18;// Operation codes for general constraint nonlinear multivariate function/// <summary>/// Operation code for constant./// </summary>publicconstintOPCODE_CONSTANT=0;/// <summary>/// Operation code for variable./// </summary>publicconstintOPCODE_VARIABLE=1;/// <summary>/// Operation code for addition./// </summary>publicconstintOPCODE_PLUS=2;/// <summary>/// Operation code for subtraction./// </summary>publicconstintOPCODE_MINUS=3;/// <summary>/// Operation code for multiplication./// </summary>publicconstintOPCODE_MULTIPLY=4;/// <summary>/// Operation code for division./// </summary>publicconstintOPCODE_DIVIDE=5;/// <summary>/// Operation code for negation./// </summary>publicconstintOPCODE_UMINUS=6;/// <summary>/// Operation code for square./// </summary>publicconstintOPCODE_SQUARE=7;/// <summary>/// Operation code for square root./// </summary>publicconstintOPCODE_SQRT=8;/// <summary>/// Operation code for sin./// </summary>publicconstintOPCODE_SIN=9;/// <summary>/// Operation code for cos./// </summary>publicconstintOPCODE_COS=10;/// <summary>/// Operation code for tan./// </summary>publicconstintOPCODE_TAN=11;/// <summary>/// Operation code for the power function./// </summary>publicconstintOPCODE_POW=12;/// <summary>/// Operation code for exp./// </summary>publicconstintOPCODE_EXP=13;/// <summary>/// Operation code for log./// </summary>publicconstintOPCODE_LOG=14;/// <summary>/// Operation code for log2./// </summary>publicconstintOPCODE_LOG2=15;/// <summary>/// Operation code for log10./// </summary>publicconstintOPCODE_LOG10=16;/// <summary>/// Operation code for logistic function./// </summary>publicconstintOPCODE_LOGISTIC=17;/// <summary>/// Operation code for tanh function./// </summary>publicconstintOPCODE_TANH=18;/// <summary>/// Operation code for signpow function./// </summary>publicconstintOPCODE_SIGNPOW=19;// Basis status info/// <summary>/// Variable is basic./// </summary>publicconstintBASIC=0;/// <summary>/// Variable is non-basic at lower bound./// </summary>publicconstintNONBASIC_LOWER=-1;/// <summary>/// Variable is non-basic at upper bound./// </summary>publicconstintNONBASIC_UPPER=-2;/// <summary>/// Variable is superbasic./// </summary>publicconstintSUPERBASIC=-3;// Numeric constants/// <summary>/// Infinity value./// </summary>publicconstdoubleINFINITY=1e100;/// <summary>/// Undefined value./// </summary>publicconstdoubleUNDEFINED=1e101;/// <summary>/// Maximum integer value./// </summary>publicconstintMAXINT=2000000000;// Limits/// <summary>/// Maximum string length./// </summary>publicconstintMAX_STRLEN=512;/// <summary>/// Maximum name length./// </summary>publicconstintMAX_NAMELEN=255;/// <summary>/// Maximum tag length./// </summary>publicconstintMAX_TAGLEN=10240;/// <summary>/// Maximum concurrent threads./// </summary>publicconstintMAX_CONCURRENT=64;// Other constants/// <summary>/// Default compute server port./// </summary>publicconstintDEFAULT_CS_PORT=61000;// Version numbers/// <summary>/// Major number/// </summary>publicconstintVERSION_MAJOR=13;/// <summary>/// Minor number/// </summary>publicconstintVERSION_MINOR=0;/// <summary>/// Technical number/// </summary>publicconstintVERSION_TECHNICAL=0;// Callback constants/// <summary>/// Gurobi callback codes./// </summary>publicclassCallback{/// <summary>/// Periodic polling callback./// </summary>publicconstintPOLLING=0;/// <summary>/// Currently performing presolve./// </summary>publicconstintPRESOLVE=1;/// <summary>/// Currently in simplex./// </summary>publicconstintSIMPLEX=2;/// <summary>/// Currently in MIP./// </summary>publicconstintMIP=3;/// <summary>/// Found a new MIP incumbent./// </summary>publicconstintMIPSOL=4;/// <summary>/// Currently exploring a MIP node./// </summary>publicconstintMIPNODE=5;/// <summary>/// Currently in barrier./// </summary>publicconstintBARRIER=7;/// <summary>/// Printing a log message./// </summary>publicconstintMESSAGE=6;/// <summary>/// Currently in multi-objective optimization./// </summary>publicconstintMULTIOBJ=8;/// <summary>/// Currently computing an IIS./// </summary>publicconstintIIS=9;/// <summary>/// Currently in PDHG./// </summary>publicconstintPDHG=10;/// <summary>/// Currently in NL barrier./// </summary>publicconstintNLBAR=11;/// <summary>/// Returns the number of columns removed by presolve to this point./// </summary>publicconstintPRE_COLDEL=1000;/// <summary>/// Returns the number of rows removed by presolve to this point./// </summary>publicconstintPRE_ROWDEL=1001;/// <summary>/// Returns the number of constraint senses changed by presolve to this/// point./// </summary>publicconstintPRE_SENCHG=1002;/// <summary>/// Returns the number of bounds changed by presolve to this point./// </summary>publicconstintPRE_BNDCHG=1003;/// <summary>/// Returns the number of coefficients changed by presolve to this point./// </summary>publicconstintPRE_COECHG=1004;/// <summary>/// Returns the current simplex iteration count./// </summary>publicconstintSPX_ITRCNT=2000;/// <summary>/// Returns the current simplex objective value./// </summary>publicconstintSPX_OBJVAL=2001;/// <summary>/// Returns the current simplex primal infeasibility./// </summary>publicconstintSPX_PRIMINF=2002;/// <summary>/// Returns the current simplex dual infeasibility./// </summary>publicconstintSPX_DUALINF=2003;/// <summary>/// Returns 1 if the model has been perturbed./// </summary>publicconstintSPX_ISPERT=2004;/// <summary>/// Returns the current best objective value./// </summary>publicconstintMIP_OBJBST=3000;/// <summary>/// Returns the current best objective bound./// </summary>publicconstintMIP_OBJBND=3001;/// <summary>/// Returns the current explored node count./// </summary>publicconstintMIP_NODCNT=3002;/// <summary>/// Returns the current solution count./// </summary>publicconstintMIP_SOLCNT=3003;/// <summary>/// Returns the current cutting plane count./// </summary>publicconstintMIP_CUTCNT=3004;/// <summary>/// Returns the current unexplored node count./// </summary>publicconstintMIP_NODLFT=3005;/// <summary>/// Returns the current simplex iteration count./// </summary>publicconstintMIP_ITRCNT=3006;/// <summary>/// For a multi-scenario model, returns the number of scenarios that are still open./// </summary>publicconstintMIP_OPENSCENARIOS=3007;/// <summary>/// Returns the current phase of the MIP algorithm./// </summary>publicconstintMIP_PHASE=3008;/// <summary>/// Returns the new solution./// </summary>publicconstintMIPSOL_SOL=4001;/// <summary>/// Returns the objective value for the new solution./// </summary>publicconstintMIPSOL_OBJ=4002;/// <summary>/// Returns the current best objective value./// </summary>publicconstintMIPSOL_OBJBST=4003;/// <summary>/// Returns the current best objective bound./// </summary>publicconstintMIPSOL_OBJBND=4004;/// <summary>/// Returns the current explored node count./// </summary>publicconstintMIPSOL_NODCNT=4005;/// <summary>/// Returns the current solution count./// </summary>publicconstintMIPSOL_SOLCNT=4006;/// <summary>/// For a multi-scenario model, returns the number of scenarios that are still open./// </summary>publicconstintMIPSOL_OPENSCENARIOS=4007;/// <summary>/// Returns the current phase of the MIP algorithm./// </summary>publicconstintMIPSOL_PHASE=4008;/// <summary>/// Returns the status of the current node relaxation./// </summary>publicconstintMIPNODE_STATUS=5001;/// <summary>/// Returns the current node relaxation solution or ray./// </summary>publicconstintMIPNODE_REL=5002;/// <summary>/// Returns the current best objective value./// </summary>publicconstintMIPNODE_OBJBST=5003;/// <summary>/// Returns the current best objective bound./// </summary>publicconstintMIPNODE_OBJBND=5004;/// <summary>/// Returns the current explored node count./// </summary>publicconstintMIPNODE_NODCNT=5005;/// <summary>/// Returns the current solution count./// </summary>publicconstintMIPNODE_SOLCNT=5006;/// <summary>/// Returns the branching variable for the current node./// </summary>publicconstintMIPNODE_BRVAR=5007;/// <summary>/// For a multi-scenario model, returns the number of scenarios that are still open./// </summary>publicconstintMIPNODE_OPENSCENARIOS=5008;/// <summary>/// Returns the current phase of the MIP algorithm./// </summary>publicconstintMIPNODE_PHASE=5009;/// <summary>/// Returns the current barrier iteration count./// </summary>publicconstintBARRIER_ITRCNT=7001;/// <summary>/// Returns the current barrier primal objective value./// </summary>publicconstintBARRIER_PRIMOBJ=7002;/// <summary>/// Returns the current barrier dual objective value./// </summary>publicconstintBARRIER_DUALOBJ=7003;/// <summary>/// Returns the current barrier primal infeasibility./// </summary>publicconstintBARRIER_PRIMINF=7004;/// <summary>/// Returns the current barrier dual infeasibility./// </summary>publicconstintBARRIER_DUALINF=7005;/// <summary>/// Returns the current barrier complementarity violation./// </summary>publicconstintBARRIER_COMPL=7006;/// <summary>/// Returns the message that is being printed./// </summary>publicconstintMSG_STRING=6001;/// <summary>/// Returns the elapsed solver runtime (in seconds)./// </summary>publicconstintRUNTIME=6002;/// <summary>/// Returns the elapsed solver work (in work units)./// </summary>publicconstintWORK=6003;/// <summary>/// Returns the current size of allocated memory (in GB)./// </summary>publicconstintMEMUSED=6004;/// <summary>/// Returns the maximum size of allocated memory (in GB)./// </summary>publicconstintMAXMEMUSED=6005;/// <summary>/// Returns the number of objectives that have already been optimized./// </summary>publicconstintMULTIOBJ_OBJCNT=8001;/// <summary>/// Returns the current solution count./// </summary>publicconstintMULTIOBJ_SOLCNT=8002;/// <summary>/// Returns the current solution./// </summary>publicconstintMULTIOBJ_SOL=8003;/// <summary>/// Returns the iteration count of last objective solve./// </summary>publicconstintMULTIOBJ_ITRCNT=8004;/// <summary>/// Returns the objective value of best solution of last objective solve./// </summary>publicconstintMULTIOBJ_OBJBST=8005;/// <summary>/// Returns the objective bound of last objective solve./// </summary>publicconstintMULTIOBJ_OBJBND=8006;/// <summary>/// Returns the status of last objective solve./// </summary>publicconstintMULTIOBJ_STATUS=8007;/// <summary>/// Returns the MIP gap of last objective solve./// </summary>publicconstintMULTIOBJ_MIPGAP=8008;/// <summary>/// Returns the node count of last objective solve./// </summary>publicconstintMULTIOBJ_NODCNT=8009;/// <summary>/// Returns the open node count of last objective solve./// </summary>publicconstintMULTIOBJ_NODLFT=8010;/// <summary>/// Returns the runtime (in seconds) of last objective solve./// </summary>publicconstintMULTIOBJ_RUNTIME=8011;/// <summary>/// Returns the elapsed work (in work units) of last objective solve./// </summary>publicconstintMULTIOBJ_WORK=8012;/// <summary>/// Returns the minimum number of constraints in the IIS./// </summary>publicconstintIIS_CONSTRMIN=9001;/// <summary>/// Returns the maximum number of constraints in the IIS./// </summary>publicconstintIIS_CONSTRMAX=9002;/// <summary>/// Returns the estimated number of constraints in the IIS./// </summary>publicconstintIIS_CONSTRGUESS=9003;/// <summary>/// Returns the minimum number of bounds in the IIS./// </summary>publicconstintIIS_BOUNDMIN=9004;/// <summary>/// Returns the maximum number of bounds in the IIS./// </summary>publicconstintIIS_BOUNDMAX=9005;/// <summary>/// Returns the estimated number of bounds in the IIS./// </summary>publicconstintIIS_BOUNDGUESS=9006;/// <summary>/// Returns the current PDHG iteration count./// </summary>publicconstintPDHG_ITRCNT=10001;/// <summary>/// Returns the current PDHG primal objective value./// </summary>publicconstintPDHG_PRIMOBJ=10002;/// <summary>/// Returns the current PDHG dual objective value./// </summary>publicconstintPDHG_DUALOBJ=10003;/// <summary>/// Returns the current PDHG primal infeasibility./// </summary>publicconstintPDHG_PRIMINF=10004;/// <summary>/// Returns the current PDHG dual infeasibility./// </summary>publicconstintPDHG_DUALINF=10005;/// <summary>/// Returns the current PDHG complementarity violation./// </summary>publicconstintPDHG_COMPL=10006;/// <summary>/// Returns the current NL barrier iteration count./// </summary>publicconstintNLBAR_ITRCNT=11001;/// <summary>/// Returns the current NL barrier primal objective value./// </summary>publicconstintNLBAR_PRIMOBJ=11002;/// <summary>/// Returns the current NL barrier primal infeasibility./// </summary>publicconstintNLBAR_PRIMINF=11003;/// <summary>/// Returns the current NL barrier dual infeasibility./// </summary>publicconstintNLBAR_DUALINF=11004;/// <summary>/// Returns the current NL barrier complementarity violation./// </summary>publicconstintNLBAR_COMPL=11005;/// <summary>/// Default value for wheres flag/// </summary>publicconstintALL_BIT=int.MaxValue;// set all bits to 1}// Errors/// <summary>/// Gurobi error codes./// </summary>publicclassError{/// <summary>/// Available memory was exhausted./// </summary>publicconstintOUT_OF_MEMORY=10001;/// <summary>/// NULL input value provided for a required argument./// </summary>publicconstintNULL_ARGUMENT=10002;/// <summary>/// Invalid input value./// </summary>publicconstintINVALID_ARGUMENT=10003;/// <summary>/// Tried to query or set an unknown attribute./// </summary>publicconstintUNKNOWN_ATTRIBUTE=10004;/// <summary>/// Tried to query or set an attribute that could not be accessed./// </summary>publicconstintDATA_NOT_AVAILABLE=10005;/// <summary>/// Index for attribute query was out of range./// </summary>publicconstintINDEX_OUT_OF_RANGE=10006;/// <summary>/// Tried to query or set an unknown parameter./// </summary>publicconstintUNKNOWN_PARAMETER=10007;/// <summary>/// Tried to set a parameter to a value that is outside its valid range./// </summary>publicconstintVALUE_OUT_OF_RANGE=10008;/// <summary>/// Failed to obtain a Gurobi license./// </summary>publicconstintNO_LICENSE=10009;/// <summary>/// Attempted to solve a model that is larger than the limit for a/// trial license./// </summary>publicconstintSIZE_LIMIT_EXCEEDED=10010;/// <summary>/// Problem in callback./// </summary>publicconstintCALLBACK=10011;/// <summary>/// Failed to read the requested file./// </summary>publicconstintFILE_READ=10012;/// <summary>/// Failed to write the requested file./// </summary>publicconstintFILE_WRITE=10013;/// <summary>/// Numerical error during requested operation./// </summary>publicconstintNUMERIC=10014;/// <summary>/// Attempted to perform infeasibility analysis on a feasible model./// </summary>publicconstintIIS_NOT_INFEASIBLE=10015;/// <summary>/// Requested operation not valid for a MIP model./// </summary>publicconstintNOT_FOR_MIP=10016;/// <summary>/// Tried to access a model while optimization was in progress./// </summary>publicconstintOPTIMIZATION_IN_PROGRESS=10017;/// <summary>/// Constraint, variable, or SOS contained duplicate indices./// </summary>publicconstintDUPLICATES=10018;/// <summary>/// Error in reading or writing a MIP node file./// </summary>publicconstintNODEFILE=10019;/// <summary>/// non-PSD Q matrix in the objective or in a quadratic constraint./// </summary>publicconstintQ_NOT_PSD=10020;/// <summary>/// Equality quadratic constraints./// </summary>publicconstintQCP_EQUALITY_CONSTRAINT=10021;/// <summary>/// Network error./// </summary>publicconstintNETWORK=10022;/// <summary>/// Job rejected from Compute Server queue./// </summary>publicconstintJOB_REJECTED=10023;/// <summary>/// Operation is not supported in the current usage environment./// </summary>publicconstintNOT_SUPPORTED=10024;/// <summary>/// Result is larger than return value allows./// </summary>publicconstintEXCEED_2B_NONZEROS=10025;/// <summary>/// Problem with piecewise-linear objective function./// </summary>publicconstintINVALID_PIECEWIE_OBJ=10026;/// <summary>/// Not allowed to change UpdateMode parameter once model/// has been created./// </summary>publicconstintUPDATEMODE_CHANGE=10027;/// <summary>/// Problem launching Instant Cloud job./// </summary>publicconstintCLOUD=10028;/// <summary>/// An error occurred during model modification or update./// </summary>publicconstintMODEL_MODIFICATION=10029;/// <summary>/// An error occured with the client-server application./// </summary>publicconstintCSWORKER=10030;/// <summary>/// Multi-model tuning invoked on models of different types./// </summary>publicconstintTUNE_MODEL_TYPES=10031;/// <summary>/// Multi-model tuning invoked on models of different types./// </summary>publicconstintSECURITY=10032;/// <summary>/// Tried to access a constraint or variable that is not in the model./// </summary>publicconstintNOT_IN_MODEL=20001;/// <summary>/// Failed to create the requested model./// </summary>publicconstintFAILED_TO_CREATE_MODEL=20002;/// <summary>/// Internal Gurobi error./// </summary>publicconstintINTERNAL=20003;}// Cuts parameter values/// <summary>/// Constant for Cuts parameter -/// choose cuts control automatically./// </summary>publicconstintCUTS_AUTO=-1;/// <summary>/// Constant for Cuts parameter -/// shuts off cuts./// </summary>publicconstintCUTS_OFF=0;/// <summary>/// Constant for Cuts parameter -/// moderate cut generation./// </summary>publicconstintCUTS_CONSERVATIVE=1;/// <summary>/// Constant for Cuts parameter -/// aggressive cut generation./// </summary>publicconstintCUTS_AGGRESSIVE=2;/// <summary>/// Constant for Cuts parameter -/// very aggressive cut generation./// </summary>publicconstintCUTS_VERYAGGRESSIVE=3;// Presolve parameter values/// <summary>/// Constant for Presolve parameter -/// automatic presolve setting./// </summary>publicconstintPRESOLVE_AUTO=-1;/// <summary>/// Constant for Presolve parameter -/// turns off presolve./// </summary>publicconstintPRESOLVE_OFF=0;/// <summary>/// Constant for Presolve parameter -/// moderate presolve setting./// </summary>publicconstintPRESOLVE_CONSERVATIVE=1;/// <summary>/// Constant for Presolve parameter -/// aggressive presolve setting./// </summary>publicconstintPRESOLVE_AGGRESSIVE=2;// Method parameter values/// <summary>/// Constant for Method parameter -/// none equals to choose method automatically./// </summary>publicconstintMETHOD_NONE=-1;/// <summary>/// Constant for Method parameter -/// choose method automatically./// </summary>publicconstintMETHOD_AUTO=-1;/// <summary>/// Constant for Method and NodeMethod parameters -/// use primal simplex./// </summary>publicconstintMETHOD_PRIMAL=0;/// <summary>/// Constant for Method and NodeMethod parameters -/// use dual simplex./// </summary>publicconstintMETHOD_DUAL=1;/// <summary>/// Constant for Method and NodeMethod parameters -/// use barrier./// </summary>publicconstintMETHOD_BARRIER=2;/// <summary>/// Constant for Method parameters -/// use concurrent optimizer./// </summary>publicconstintMETHOD_CONCURRENT=3;/// <summary>/// Constant for Method parameter -/// use deterministic concurrent optimizer./// </summary>publicconstintMETHOD_DETERMINISTIC_CONCURRENT=4;/// <summary>/// Constant for Method parameter -/// use deterministic concurrent primal and dual simplex./// </summary>publicconstintMETHOD_DETERMINISTIC_CONCURRENT_SIMPLEX=5;/// <summary>/// Constant for Method and NodeMethod parameters -/// use PDHG./// </summary>publicconstintMETHOD_PDHG=6;// BarHomogeneous parameter values/// <summary>/// Constant for BarHomogeneous parameter -/// choose whether to use homogeneous barrier method automatically./// </summary>publicconstintBARHOMOGENEOUS_AUTO=-1;/// <summary>/// Constant for BarHomogeneous parameter -/// do not run the homogeneous barrier method./// </summary>publicconstintBARHOMOGENEOUS_OFF=0;/// <summary>/// Constant for BarHomogeneous parameter -/// use the homogeneous barrier method./// </summary>publicconstintBARHOMOGENEOUS_ON=1;// BarOrder parameter values/// <summary>/// Constant for BarOrder parameter -/// choose ordering method automatically./// </summary>publicconstintBARORDER_AUTOMATIC=-1;/// <summary>/// Constant for BarOrder parameter -/// choose Approximate Minimum Degree ordering./// </summary>publicconstintBARORDER_AMD=0;/// <summary>/// Constant for BarOrder parameter -/// choose Nested Dissection ordering./// </summary>publicconstintBARORDER_NESTEDDISSECTION=1;// MIPFocus parameter values/// <summary>/// Constant for MIPFocus parameter -/// strike a balance between finding new feasible solutions and improving/// the best bound./// </summary>publicconstintMIPFOCUS_BALANCED=0;/// <summary>/// Constant for MIPFocus parameter -/// focus on finding feasible solutions quickly./// </summary>publicconstintMIPFOCUS_FEASIBILITY=1;/// <summary>/// Constant for MIPFocus parameter -/// focus on proving optimality./// </summary>publicconstintMIPFOCUS_OPTIMALITY=2;/// <summary>/// Constant for MIPFocus parameter -/// focus on moving the best bound./// </summary>publicconstintMIPFOCUS_BESTBOUND=3;// SimplexPricing parameter values/// <summary>/// Constant for SimplexPricing parameter -/// choose Simplex pricing strategy automatically./// </summary>publicconstintSIMPLEXPRICING_AUTO=-1;/// <summary>/// Constant for SimplexPricing parameter -/// choose Partial Pricing as Simplex pricing strategy./// </summary>publicconstintSIMPLEXPRICING_PARTIAL=0;/// <summary>/// Constant for SimplexPricing parameter -/// choose Steepest Edge as Simplex pricing strategy./// </summary>publicconstintSIMPLEXPRICING_STEEPEST_EDGE=1;/// <summary>/// Constant for SimplexPricing parameter -/// choose Devex as Simplex pricing strategy./// </summary>publicconstintSIMPLEXPRICING_DEVEX=2;/// <summary>/// Constant for SimplexPricing parameter -/// choose Quick-Start Steepest Edge as Simplex pricing strategy./// </summary>publicconstintSIMPLEXPRICING_STEEPEST_QUICK=3;// VarBranch parameter values/// <summary>/// Constant for VarBranch parameter -/// choose branch variable selection strategy automatically./// </summary>publicconstintVARBRANCH_AUTO=-1;/// <summary>/// Constant for VarBranch parameter -/// choose Pseudo Reduced Cost Branching as branch variable selection/// strategy./// </summary>publicconstintVARBRANCH_PSEUDO_REDUCED=0;/// <summary>/// Constant for VarBranch parameter -/// choose Pseudo Shadow Price Branching as branch variable selection/// strategy./// </summary>publicconstintVARBRANCH_PSEUDO_SHADOW=1;/// <summary>/// Constant for VarBranch parameter -/// choose Maximum Infeasibility Branching as branch variable selection/// strategy./// </summary>publicconstintVARBRANCH_MAX_INFEAS=2;/// <summary>/// Constant for VarBranch parameter -/// choose Strong Branching as branch variable selection strategy./// </summary>publicconstintVARBRANCH_STRONG=3;// PartitionPlace parameter values/// <summary>/// Constant for PartitionPlace parameter -/// run partition heuristic before the root relaxation is solved./// </summary>publicconstintPARTITION_EARLY=16;/// <summary>/// Constant for PartitionPlace parameter -/// run partition heuristic at the start of the root cut loop./// </summary>publicconstintPARTITION_ROOTSTART=8;/// <summary>/// Constant for PartitionPlace parameter -/// run partition heuristic at the end of the root cut loop./// </summary>publicconstintPARTITION_ROOTEND=4;/// <summary>/// Constant for PartitionPlace parameter -/// run partition heuristic at the nodes of the branch-and-cut search./// </summary>publicconstintPARTITION_NODES=2;/// <summary>/// Constant for PartitionPlace parameter -/// run partition heuristic when the branch-and-cut search terminates./// </summary>publicconstintPARTITION_CLEANUP=1;// Callback phase values/// <summary>/// Constant for MIP_PHASE, MIPNODE_PHASE, and MIPSOL_PHASE/// callback return value.  MIP is currently performing/// the NoRel heuristic./// </summary>publicconstintMIP_PHASE_NOREL=0;/// <summary>/// Constant for MIP_PHASE, MIPNODE_PHASE, and MIPSOL_PHASE/// callback return value.  MIP is currently exploring/// the standard MIP search./// </summary>publicconstintMIP_PHASE_SEARCH=1;/// <summary>/// Constant for MIP_PHASE, MIPNODE_PHASE, and MIPSOL_PHASE/// callback return value.  MIP is currently in/// the solution improvement phase./// </summary>publicconstintMIP_PHASE_IMPROVE=2;// FeasRelax method parameter values/// <summary>/// minimize linearly weighted sum of penalties for feasrelax model./// </summary>publicconstintFEASRELAX_LINEAR=0;/// <summary>/// minimize quadratically weighted sum of penalties for feasrelax model./// </summary>publicconstintFEASRELAX_QUADRATIC=1;/// <summary>/// minimize weighted cardinality of relaxations for feasrelax model./// </summary>publicconstintFEASRELAX_CARDINALITY=2;

GRB.CharAttr#

This enum is used to get or set char-valued attributes (throughGRBModel.Get orGRBModel.Set). Pleaserefer to theAttributes section to see a list ofall attributes and their purpose.

GRB.DoubleAttr#

This enum is used to get or set double-valued attributes (throughGRBModel.Get orGRBModel.Set). Pleaserefer to theAttributes section to see a list ofall attributes and their purpose.

GRB.DoubleParam#

This enum is used to get or set double-valued parameters (throughGRBModel.Get,GRBModel.Set,GRBEnv.Get,GRBEnv.Set, orGRBCallback.Set). Please refer to theParameters section to see a list of all parameters and theirpurpose.

GRB.IntAttr#

This enum is used to get or set int-valued attributes (throughGRBModel.Get orGRBModel.Set). Pleaserefer to theAttributes section to see a list ofall attributes and their purpose.

GRB.IntParam#

This enum is used to get or set int-valued parameters (throughGRBModel.Get,GRBModel.Set,GRBEnv.Get,GRBEnv.Set, orGRBCallback.Set). Please refer to theParameters section to see a list of all parameters and theirpurpose.

GRB.StringAttr#

This enum is used to get or set string-valued attributes (throughGRBModel.Get orGRBModel.Set). Pleaserefer to theAttributes section to see a list ofall attributes and their purpose.

GRB.StringParam#

This enum is used to get or set string-valued parameters (throughGRBModel.Get,GRBModel.Set,GRBEnv.Get,GRBEnv.Set, orGRBCallback.Set). Please refer to theParameters section to see a list of all parameters and theirpurpose.