MatPlanWDM v0.5: cplexErrorMsg (Inform) - File Exchange

No BSD License

Highlights from
MatPlanWDM v0.5

Dynamic(varargin) MATPLANWDM Application M-file for matplanwdm.fig
MultiHourAnalysis(varargin) MATPLANWDM Application M-file for matplanwdm.fig
WhatIfAnalysis(varargin) MATPLANWDM Application M-file for matplanwdm.fig
about(varargin) ABOUTOPNETV1 Application M-file for about.fig
columnNormalization(varargin) COLUMNNORMALIZATION M-file for columnNormalization.fig
matplanwdm(varargin) MATPLANWDM Application M-file for matplanwdm.fig
metadataFigure(varargin)
metadataFigureDynamic(varargi...
metadataFigure_MH(varargin)
metadataWhatIfFigure(varargin...
onPopulationDistanceTraffic(v... ONPOPULATIONDISTANCETRAFFIC M-file for onPopulationDistanceTraffic.fig
rowNormalization(varargin) ROWNORMALIZATION M-file for rowNormalization.fig
totalNormalization(varargin) TOTALNORMALIZATION M-file for totalNormalization.fig
trafficGeneration(varargin) TRAFFICGENERATION M-file for trafficGeneration.fig
... libraryRWA_kShortestRWA
... libraryWA_minConv
... MILP_MH
... calculateConversionMetrics
... MILP
... libraryWA_graphTransformation
HPSR2001_minTransceivers(traf... Algorithm for traffic grooming in optical networks to minimize the number of transceivers
HPSR2001_minTransceivers_MH(m... Algorithm for traffic grooming in optical networks to minimize the number of transceivers
IO_formatEditString(editStrin... IO_formatEditString
IO_readTraffFile(fullpathname... IO_readTraffFile
IO_readTraffString(traffStrin... IO_readTraffString
IO_writeTraffFile(traff_traff... IO_writeTraffFile
IO_writeTraffString(traff_tra... IO_writeTraffString
[actions ,infoWhatHappenedWit... >>>dynamicAlgorithm
[distanceMatrix]=calculateDis... calculateDistanceMatrix
[distancesMatrix, linkDistanc... calculateNetMetrics
[exitMsg exitFlag x, slack, v... callSolver_CPLEX
[h, min, sec]=sec2time(second... sec2time
[listOfPendingEvents,serialNu... >>>removeTopPendingEvent
[netState]=processAction(acti...
[sequenceOfNodeIDs , sequence... lightpathPathComputation
activityFunction(timezoneOffs...
acumulateDynamicNetMetrics (d... >>>calculateDynamicNetMetrics
addConstraint(constraintsMatr... addConstraint
array2vect (arrayA) array2vect
calculateDynamicNetMetrics (d... >>>calculateDynamicNetMetrics
calculateMetrics(phys, netSta... >>>[stat,lightpathsRoutes,listOfSerialNumberFlowsPerLp] = calculateMetrics(phys, netState)
calculateStaticNetMetrics(phy... calculateNetMetrics
checkNetState(netState , phys... checkNetState
checkNetState_MH(netState_mh ... checkNetState_MH
checkPhys(phys) checkPhys
cplexErrorMsg (Inform) cplexErrorMsg
designMetadataTextReport(meta... designMetadataTextReport;
designResultsTextReport (exit... designResultsTextReport
dynResultsTextReport (dynStat... designResultsTextReport
eventDispatcherMainLoop (maxS... >>>eventDispatcherMainLoop
f=statusbar(p,f) Display a status/progress bar and inform about the elapsed
generateFlow (generatorParame...
hour(d)
io_readXML(XMLfilename) COMMENTS:
io_readXML(XMLfilename) COMMENTS:
io_writeXML(metadata, phys, n... COMMENTS:
io_writeXML(metadata, phys, s... COMMENTS:
libraryFR_CSPF(traff_trafficM... libraryFR_CSPF
libraryFR_SPF(traff_trafficMa... libraryFR_SPF
libraryFR_optimalFlowAssignme... libraryFR_optimalFlowAssignment
libraryGraph_capacityShortest... libraryGraph_capacityShortestPath
libraryGraph_kshortestPath (k... libraryGraph_kshortestPath
libraryGraph_minCostFlow (ing... libraryGraph_minCostFlow
libraryGraph_shortestPath (li... libraryGraph_shortestPath
libraryTA_KondaHPSR2001 (traf... libraryTA_KondaHPSR2001
libraryTA_trivialAssignment (... libraryTA_trivialAssignment
libraryTFA_KondaHPSR2001 (tra... libraryTFA_KondaHPSR2001
libraryVTD_HLDA(traff_traffic... HLDA (Heuristic Logical Design Algorithm)
libraryVTD_MLDA(traff_traffic... MLDA (Minimum-Delay Logical Topology Design Algorithm)
libraryVTD_RLDA(traff_traffic... RLDA (Random Logical Design Algorithm)
libraryVTD_TILDA(traff_traffi... TILDA (Traffic Independent Logical Design Algorithm)
listOfPendingEvents=addEventT... >>>addEventToListOfPendingEvents
makeRowVector (vector) makeRowVector
minute(d) MINUTE Minute of date or time.
netStateTextReport (netState) netStateTextReport
nextPendingEvent(listOfPendin... >>>nextPendingEvent
physXMLfileTextReport(metadat... designMetadataTextReport;
plainText_netStateReport (net... netStateTextReport
plotLightpath (nodesPlaceMatr... plotLightpath
plotTopology (nodesPlaceMatri... plotTopology
plotTrafficFlow (nodesPlaceMa... plotTrafficFlow
processAlgorithmParameters (a... processAlgorithmParameters
randraw(distribName, distribP... % EFFICIENT RANDOM VARIATES GENERATOR
second(d) SECOND Seconds of date or time.
testingAlgorithm1 (trafficMat...
testingAlgorithm1_MH (mh_traf...
trafficGenerator(nodePopulati... trafficGenerator
trans_edgeTable2topologyMat(e... trans_edgeTable2topologyMat
trans_fijsd2flowRoutingMatrix... trans_fijsd2flowRoutingMatrix
trans_flowTable2trafficMatrix... trans_flowTable2trafficMatrix
trans_pijmw2LPRoutingMatrix(p... trans_pijmw2LPRoutingMatrix
trans_topologyMat2edgeTable(t... trans_topologyMat2edgeTable
trans_trafficMatrix2flowTable... trans_trafficMatrix2flowTable
tsp_ga(varargin) TSP_GA Finds a (near) optimal solution to the Traveling Salesman Problem (TSP)
vect2array (vectorA, dimArray... vect2array
x(~out); end;
GUILightpathFlowPopupMenu.m
GUIMetricPopupMenu.m
GUIResultsInformation.m
GUIRunTextReport.m
GUIShowStat.m
GUIShowState.m
GUIactiveMILP.m
GUIlegend.m
GUIresetMILP.m
GUIupdateStepAndStopStates.m
initializationMILPVariablesSc...
load_global.m
load_global_Dynamic.m
load_global_Multihour.m
load_global_WhatIf.m
load_global_traffGen.m
resetMILP.m
simulationState_continue.m
simulationState_step.m
simulationState_stop.m
startup.m
startup2.m
MatPlanWDM 0.5 - Help file
View all files

from MatPlanWDM v0.5 by Pablo Pavon Mariño
Educational network planning tool for the RWA problem in WDM networks (MILP and heuristic based)

cplexErrorMsg (Inform)

%  cplexErrorMsg
% 
%>> Usage: [exitMsg exitFlag] = cplexErrorMsg (Inform)
%
%>> Abstract: This function process the output message 'Inform' from CPLEX
%   to generate a 'exitMsg' and a 'exitFlag'.
%
%>> Arguments:
% o  In: 
%   Inform: Result of CPLEX run. Integer code which indicates the problem
%    feasibility. The most common output codes are:
%             -"101": Optimal integer solution found
%             -"102": Optimal sol. within epgap or epagap tolerance found
%             -"103": Solution is integer infeasible
%
% o Out:
%  . exitMsg: Exit Message according to the output message 'Inform' from
%    the CPLEX solver.
% 
%  . exitFlag: 
%          - 0, if it is possible to find a optimal solution.
%          - 1, if it is not possible to find a feasible solution
%          - 2, otherwise (a subpotimal solution)
%
%                                 Ramon Aparicio Pardo. 
%                                 Technical University of Cartagena, 2007.

function [exitMsg exitFlag] = cplexErrorMsg (Inform)

switch(Inform)
    case 0
        exitMsg = 'Failed to optimize problem';
        exitFlag=1;
        
    case 1
        exitMsg = 'Optimal solution is available ';
        exitFlag=0;
    case 2
        exitMsg = 'Model has an Unbounded ray';
        exitFlag=1;
        
    case 3
        exitMsg = 'Model is proved Infeasible';
        exitFlag=1;
        
    case 4
        exitMsg = 'Model is proved either Infeasible or Unbounded ';
        exitFlag=1;
        
    case 5
        exitMsg = 'Optimal solution is available, but with infeasibilities after unscaling';
        exitFlag=0;
        
    case 6
        exitMsg = 'Solution is available, but not proved optimal, due to numerical difficulties during optimization';
        exitFlag=2;
    case 10
        exitMsg = 'Aborted due to an iteration limit';
        exitFlag=1;
        
    case 11
        exitMsg = 'Aborted due to a time limit';
        exitFlag=1;
        
    case 12
        exitMsg = 'Aborted due to an objective limit';
        exitFlag=1;
        
    case 13
        exitMsg = 'Aborted on user request';
        exitFlag=1;
        
    case 20
        exitMsg = 'Model has Unbounded optimal face'; 
        exitFlag=1;
        
    case 21
        exitMsg = 'Aborted due to a primal obj limit'; 
        exitFlag=1;
        
    case 22
        exitMsg = 'Aborted due to a dual obj limit '; 
        exitFlag=1;
        
    case 101
        exitMsg = 'Optimal integer solution found';
        exitFlag=0;
    case 102
        exitMsg = 'Optimal sol. within epgap or epagap tolerance found';
        exitFlag=2;
    case 103
        exitMsg = 'Integer infeasible';
        exitFlag=1;
        
    case 104
        exitMsg = 'Mixed integer solutions limit exceeded';
        exitFlag=2;
        
    case 105
        exitMsg = 'Node limit exceeded, integer solution exists';
        exitFlag=2;
        
    case 106
        exitMsg = 'Node limit exceeded, no integer solution';
        exitFlag=2;
        
    case 107
        exitMsg = 'Time limit exceeded, integer solution exists';
        exitFlag=2;
        
    case 108
        exitMsg = 'Time limit exceeded, no integer solution';
        exitFlag=2;
        
    case 109
        exitMsg = 'Error termination, integer solution exists';
        exitFlag=2;
        
    case 110
        exitMsg = 'Error termination, no integer solution';
        exitFlag=1;
        
    case 111
        exitMsg = 'Treememory limit, integer solution exists';
        exitFlag=2;
        
    case 112
        exitMsg = 'Treememory limit, no integer solution exists';
        exitFlag=2;
        
    case 113
        exitMsg = 'Aborted, integer solution exists';
        exitFlag=2;
        
    case 114
        exitMsg = 'Aborted, no integer solution';
        exitFlag=2;
        
    case 115
        exitMsg = 'Problem optimal with unscaled infeasibilities';
        exitFlag=2;
        
    case 116
        exitMsg = 'Out of memory, no tree, integer solution exists';
        exitFlag=2;
        
    case 117
        exitMsg = 'Out of memory, no tree, no integer solution';
        exitFlag=2;
        
    case 118
        exitMsg = 'Model has an Unbounded ray';
        exitFlag=1;
    
    case 119
        exitMsg = 'Model has been proved either infeasible or unbounded';
        exitFlag=1;    
        
    % For latest TOMLAB versions:   
    case 120
        exitMsg = '(MIP) Feasible relaxed sum found (FEASOPTMODE)';
        exitFlag=2; 
             
    case 121 
        exitMsg = '(MIP) Optimal relaxed sum found (FEASOPTMODE)';
        exitFlag=2; 
        
    case 122 
        exitMsg = '(MIP) Feasible relaxed infeasibility found (FEASOPTMODE)';
        exitFlag=2; 
            
    case 123 
        exitMsg = '(MIP) Optimal relaxed infeasibility found (FEASOPTMODE)';
        exitFlag=2; 

    case 124 
        exitMsg = '(MIP) Feasible relaxed quad sum found (FEASOPTMODE)';
        exitFlag=2; 
        
    case 125 
        exitMsg = '(MIP) Optimal relaxed quad sum found (FEASOPTMODE)';
        exitFlag=2; 
            
    case 126 
        exitMsg = '(MIP) Relaxation aborted due to limit (FEASOPTMODE)';
        exitFlag=2; 

    case 127 
        exitMsg = '(MIP) Feasible solution found (FEASOPTMODE)';
        exitFlag=2; 
        
    case 1001 
        exitMsg = 'Insuficient memory available';
        exitFlag=1; 
            
    case 1014 
        exitMsg = 'CPLEX parameter is too small';
        exitFlag=1; 

    case 1015 
        exitMsg = '(CPLEX parameter is too big';
        exitFlag=1; 
        
    case 1100 
        exitMsg = 'Lower and upper bounds contradictory';
        exitFlag=1; 
            
    case 1101 
        exitMsg = 'The loaded problem contains blatant infeasibilities or unboundedness';
        exitFlag=1; 
                
    case 1106 
        exitMsg = 'The user halted preprocessing by means of a callback';
        exitFlag=1; 

    case 1117 
        exitMsg = 'The loaded problem contains blatant infeasibilities)';
        exitFlag=1; 
        
    case 1118 
        exitMsg = 'The loaded problem contains blatant unboundedness';
        exitFlag=1; 
            
    case 1123 
        exitMsg = 'Time limit exceeded during presolve.';
        exitFlag=2; 

    case 1225 
        exitMsg = 'Numeric entry is not a double precision number (NAN)';
        exitFlag=2; 
        
    case 1233 
        exitMsg = 'Data checking detected a number too large';
        exitFlag=2; 
            
    case 1256 
        exitMsg = 'CPLEX cannot factor a singular basis';
        exitFlag=1; 

    case 1261 
        exitMsg = 'No basic solution exists (use crossover)';
        exitFlag=2; 
        
    case 1262 
        exitMsg = 'No basis exists (use crossover)';
        exitFlag=2; 
            
    case 1719 
        exitMsg = 'No conflict is available';
        exitFlag=2; 

    case 3413 
        exitMsg = 'Tree memory limit exceeded';
        exitFlag=2; 
        
    case 5002 
        exitMsg = 'Non-positive semidefinite matrix in quadratic problem';
        exitFlag=2; 
            
    case 5012 
        exitMsg = 'Non-symmetric matrix in quadratic problem';
        exitFlag=2; 
                
    case 32201 
        exitMsg = 'A licensing error has occurred';
        exitFlag=1; 

    case 32024 
        exitMsg = 'Licensing problem: Optimization algorithm not licensed';
        exitFlag=1; 
            
    otherwise
        exitMsg = 'Unknown Error!!! See CPLEX v.11 Help';
        exitFlag=1; 
end

Highlights from MatPlanWDM v0.5

Highlights from
MatPlanWDM v0.5