|
Á¦ ¸ñ |
CPLEX Concert¿¡¼ cplex.log ÆÄÀÏ ¸¸µå´Â ¹ö |
|
ÀÛ¼ºÀÚ |
½Éº¸°æ |
ÀÛ¼ºÀÏ |
2005-09-10 |
Á¶È¸¼ö |
1030 ȸ |
|
÷ºÎÆÄÀÏ |
÷ºÎµÈ ÆÄÀϾøÀ½.
|
|
¾È³çÇϼ¼¿ä VB C++·Î MIP¹®Á¦¸¦ Ç®°í ÀÖ½À´Ï´Ù. cplex.log ÆÄÀÏ¿¡¼ º¼ ¼ö ÀÖ´Â Á¤º¸µéÀ» ÆÄÀÏ¿¡ ÀúÀåÇØ¼ º¸°í ½ÍÀºµ¥¿ä.. -------------------------------------------------------------- Read time = 0.00 sec. Tried aggregator 1 time. MIP Presolve eliminated 87 rows and 44 columns. MIP Presolve modified 38 coefficients. Reduced MIP has 32 rows, 17 columns, and 80 nonzeros. Presolve time = 0.01 sec. Clique table members: 2 MIP emphasis: balance optimality and feasibility Root relaxation solution time = 0.00 sec.
Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap Variable B Parent Depth
0 0 infeasible 6
Integer infeasible or unbounded. Current MIP best bound is infinite. Solution time = 0.01 sec. Iterations = 6 Nodes = 0 -------------------------------------------------------------- ÀÌ·± Á¤º¸µéÀ» º¸°í ½ÍÀºµ¥, ºñÁê¾ó ½ºÆ©µð¿À¿¡¼ ÀÛ¼ºÇÑ ¹®Á¦´Â ½ÇÇà½Ãų ¶§ ÁÖ·ç·è º¸¿©Áֱ⸸ ÇØ¼¿ä.. ÆÄÀÏ¿¡ ÀúÀåÇØ¼ ºÐ¼®ÇÏ·Á°í ÇÕ´Ï´Ù¸¸.. -------------------------------------------- IloNum start = Env.getTime(); if ( Cplex.solve() ) { Cplex_status = (IloCplex::Status) Cplex.getCplexStatus(); Sol_status = (IloAlgorithm::Status) Cplex.getStatus(); f << Cplex_status << "\n"; f << Sol_status << "\n"; f << "Obj: " << objVal << "\n"; } else { switch(Cplex.getStatus()) { case IloAlgorithm::Unbounded : f << ": Unbounded" << "\n"; break; case IloAlgorithm::Infeasible : f << ": Infeasible" << "\n"; break; case IloAlgorithm::InfeasibleOrUnbounded : f << ": Infeasible or Unbounded" << "\n"; break; case IloAlgorithm::Error : f << ": An Error occured" << "\n"; break; case IloAlgorithm::Unknown : f << ": Status Unknown" << "\n"; break; } } IloNum end = Env.getTime(); f << "°É¸° ½Ã°£ : " << start-end << "seconds" << "\n"; -------------------------------------------- ÀÌ·±½ÄÀ¸·Î ÇØ¼´Â °É¸° ½Ã°£ Á¶Â÷ ÆÄÀÏ Ãâ·ÂÀÌ µÇÁö ¾Ê´õ¶ó±¸¿ä.
¹æ¹ýÀ» ¾Ë·ÁÁÖ¼¼¿ä.
|
|
|
|