CPLEX 11

More documents

Recommendations

Info

CPLEX 11 26feasoptmode (integer)The parameter FeasOptMode allows different strategies in finding feasible relaxation in one or two phases.In its first phase, it attempts to minimize its relaxation of the infeasible model. That is, it attempts to finda feasible solution that requires minimal change. In its second phase, it finds an optimal solution (using theoriginal objective) among those that require only as much relaxation as it found necessary in the first phase.Values of the parameter FeasOptMode indicate two aspects: (1) whether to stop in phase one or continue tophase two and (2) how to measure the minimality of the relaxation (as a sum of required relaxations; as thenumber of constraints and bounds required to be relaxed; as a sum of the squares of required relaxations).(default = 0).feaspref (real)0 Minimize sum of relaxations. Minimize the sum of all required relaxations in first phase only1 Minimize sum of relaxations and optimize. Minimize the sum of all required relaxations in first phaseand execute second phase to find optimum among minimal relaxations2 Minimize number of relaxations. Minimize the number of constraints and bounds requiring relaxationin first phase only3 Minimize number of relaxations and optimize. Minimize the number of constraints and bounds requiringrelaxation in first phase and execute second phase to find optimum among minimal relaxations4 Minimize sum of squares of relaxations. Minimize the sum of squares of required relaxations in firstphase only5 Minimize sum of squares of relaxations and optimize. Minimize the sum of squares of required relaxationsin first phase and execute second phase to find optimum among minimal relaxationsYou can express the costs associated with relaxing a bound or right hand side value during a feasopt runthrough the .feaspref option. The input value denotes the users willingness to relax a constraint or bound.More precisely, the reciprocal of the specified value is used to weight the relaxation of that constraint orbound. The user may specify a preference value less than or equal to 0 (zero), which denotes that thecorresponding constraint or bound must not be relaxed.(default = 1)flowcovers (integer)Determines whether or not flow cover cuts should be generated during optimization.(default = 0)-1 Do not generate flow cover cuts0 Determined automatically1 Generate flow cover cuts moderately2 Generate flow cover cuts aggressivelyflowpaths (integer)Determines whether or not flow path cuts should be generated during optimization. At the default of 0,generation is continued only if it seems to be helping.(default = 0)-1 Do not generate flow path cuts0 Determined automatically1 Generate flow path cuts moderately2 Generate flow path cuts aggressivelyfpheur (integer)Controls the use of the feasibility pump heuristic for mixed integer programming (MIP) models.(default = 0)
CPLEX 11 27-1 Turns Feasible Pump heuristic off0 Automatic1 Apply the feasibility pump heuristic with an emphasis on finding a feasible solution2 Apply the feasibility pump heuristic with an emphasis on finding a feasible solution with a goodobjective valuefraccand (integer)Limits the number of candidate variables for generating Gomory fractional cuts.(default = 200)fraccuts (integer)Determines whether or not Gomory fractional cuts should be generated during optimization.(default = 0)-1 Do not generate Gomory fractional cuts0 Determined automatically1 Generate Gomory fractional cuts moderately2 Generate Gomory fractional cuts aggressivelyfracpass (integer)Sets the upper limit on the number of passes that will be performed when generating Gomory fractionalcuts on a mixed integer model. Ignored if parameter fraccuts is set to a nonzero value.(default = 0)0 0 Automatically determined>0 Maximum passes to performgubcovers (integer)Determines whether or not GUB (Generalized Upper Bound) cover cuts should be generated during optimization.The default of 0 indicates that the attempt to generate GUB cuts should continue only if it seemsto be helping.(default = 0)-1 Do not generate GUB cover cuts0 Determined automatically1 Generate GUB cover cuts moderately2 Generate GUB cover cuts aggressivelyheurfreq (integer)This option specifies how often to apply the node heuristic. Setting to a positive number applies the heuristicat the requested node interval.(default = 0)iis (integer)-1 Do not use the node heuristic0 Determined automaticallyFind an IIS (Irreducably Inconsistent Set of constraints) and write an IIS report to the GAMS solutionlisting if the model is found to be infeasible. Legal option values are yes or no.(default = 0)
Page 1 and 2: CPLEX 11Contents1 Introduction . .
Page 3 and 4: CPLEX 11 33.2 Quadratically Constra
Page 5 and 6: CPLEX 11 5and integer variables, ev
Page 7 and 8: CPLEX 11 7ModelName.NodLim = x;Maxi
Page 9 and 10: CPLEX 11 9epopteprhsnetepoptneteprh
Page 11 and 12: CPLEX 11 11solnpoolpoprepeat method
Page 13 and 14: CPLEX 11 136.4 Running Out of Memor
Page 15 and 16: CPLEX 11 157 GAMS/Cplex Log FileCpl
Page 17 and 18: CPLEX 11 1713 1.2882968e+02 5.21381
Page 19 and 20: CPLEX 11 19-1, the aggregator is ap
Page 21 and 22: CPLEX 11 21bndstrenind (integer)Use
Page 23 and 24: CPLEX 11 23cutup (real)Upper Cutoff
Page 25: CPLEX 11 25epint (real)Integrality
Page 29 and 30: CPLEX 11 294 Barrier5 Sifting6 Conc
Page 31 and 32: CPLEX 11 311 Generate MIR cuts mode
Page 33 and 34: CPLEX 11 33objdif (real)A means for
Page 35 and 36: CPLEX 11 35-1 Reduced-cost pricing.
Page 37 and 38: CPLEX 11 375 Sifting6 Concurrent du
Page 39 and 40: CPLEX 11 39rinsheur (integer)Cplex
Page 41 and 42: CPLEX 11 41The solution pool relati
Page 43 and 44: CPLEX 11 433 Network optimizer foll
Page 45: CPLEX 11 45workdir (string)The name

CPLEX 11

Create successful ePaper yourself

Delete template?

Save as template?