00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011 #include "BonOAMessages.hpp"
00012 #include <cstring>
00013 #include "BonMsgUtils.hpp"
00014
00015 namespace Bonmin
00016 {
00017
00018 OaMessages::OaMessages():
00019 CoinMessages(DUMMY_END)
00020 {
00021 strcpy(source_,"OA");
00022 ADD_MSG(FEASIBLE_NLP, std_m, 2,"Solved NLP in %d iterations, found a feasible solution of value %f.");
00023 ADD_MSG(INFEASIBLE_NLP, std_m,2,"Solved NLP in %d iterations, problem is infeasible in subspace.");
00024 ADD_MSG(UPDATE_UB, std_m,1,"New best feasible of %g found after %g sec and %i iterations.");
00025 ADD_MSG(SOLVED_LOCAL_SEARCH, std_m,2,"Local search solved to optimality in %d nodes and %d lp iterations.");
00026 ADD_MSG(LOCAL_SEARCH_ABORT, std_m,2,"Local search aborted : %d nodes and %d lp iterations.");
00027 ADD_MSG(UPDATE_LB, std_m ,2,"Updating lower bound to %g elapsed time %g sec");
00028 ADD_MSG(ABORT,std_m,1,"%s aborted on %s limit, time spent %g has solution of value %g");
00029 ADD_MSG(OASUCCESS, std_m,1,"%s converged in %g seconds found solution of value %g");
00030 ADD_MSG(OA_STATS, std_m,1,"Performed %i iterations, explored %i branch-and-bound nodes in total");
00031 ADD_MSG(LP_ERROR,std_m,2,"Error of LP approximation %g");
00032 ADD_MSG(PERIODIC_MSG, std_m,1,"After %7.1f seconds, %i iterations upper bound %10g, lower bound %10g");
00033 ADD_MSG(FP_DISTANCE, std_m,2,"NLP solution is %g from MILP sol");
00034 ADD_MSG(FP_MILP_VAL, std_m,2,"MILP solution has value w.r.t original objective: %10g");
00035 ADD_MSG(FP_MAJOR_ITERATION, std_m,1,"Major iteration %i ub: %g");
00036 ADD_MSG(FP_MINOR_ITERATION, std_m,1,"Minor iteration %i ub: %g");
00037 }
00038
00039 }