ILOG logo
KSTEC ȸ¿øÀ¸·Î °¡ÀÔÇϼ¼¿ä¤Ó»õ¼Ò½Ä | ·Î±×ÀÎ
 
title element1
License
- ¶óÀ̼¾½º
- ¶óÀ̼¾½º °ü¸®
Maintenance
Training
FAQ
Q&A

Q & A ... °Ô½ÃÆÇ  (Optimization)


¡Ø ¾È³çÇϽʴϱî..?
    ÀúÈñ KSTECÀÇ Á¦Ç°À̳ª ¼­ºñ½º¿¡ ´ëÇØ ±Ã±ÝÇϽŠÁ¡À̳ª ±â¼úÁö¿øÀ» ¿øÇϽô °í°´´ÔÀº ȸ»ç¸í,
    ºÎ¼­¸í, ¼º¸í, »ç¿ëÁ¦Ç°¸í, Á¦Ç° VERSIONÀ» ¸í½ÃÇÏ¿© Áֽñ⠹ٶø´Ï´Ù.

¡Ø °Ô½ÃÇϽг»¿ë¿¡ ´ëÇØ¼­´Â ½Å¼ÓÇÏ°Ô ´äº¯ÇØ µå¸®°Ú½À´Ï´Ù.
¡Ø ÇØ´çµÇ´Â Á¦Ç°±ºÀ» ¼±ÅÃÇϽŠÈÄ ÇÏ°í ½ÍÀ¸½Å ¸»¾¸À» Àû¾î ÁֽʽÿÀ.

Á¦ ¸ñ
[RE]cplex.getStatus()¸¦ »ç¿ëÇØº¸¼¼¿ä
ÀÛ¼ºÀÚ
±Ç¼ºÈ­
ÀÛ¼ºÀÏ
2003-02-26
Á¶È¸¼ö 952 È¸
÷ºÎÆÄÀÏ Ã·ºÎµÈ ÆÄÀϾøÀ½.

·Î±× ³»¿ëÀº ´ÙÀ½°ú °°½À´Ï´Ù.
¾Æ·¡ÀÇ ·Î±×´Â,
cplex.setParam(IloCplex::TreLim, 10);
cplex.setParam(IloCplex::NodeFileLim, 10);
·Î ¼ÂÆÃÀ» ÇÑ ÈÄ Ç®¾úÀ» ¶§ ³ª¿Â ·Î±×ÀÔ´Ï´Ù.

------------------------------------------------------------------
Tried aggregator 1 time.
MIP Presolve eliminated 250 rows and 5 columns.
Aggregator did 5 substitutions.
Reduced MIP has 666 rows, 11810 columns, and 68875 nonzeros.
Presolve time = 0.26 sec.
Dual steepest-edge pricing selected.
Clique table members: 14
MIP emphasis: optimality
Root relaxation solution time = 0.82 sec.
Objective is integral.

Nodes Cuts/
Node Left Objective IInf Best Integer Best Node ItCnt Gap Variable B Parent Depth

0 0 221.5000 86 221.5000 1930
* 30+ 30 225.0000 0 225.0000 221.5000 2360 1.56%
* 81 67 224.0000 0 224.0000 221.5000 3107 1.12%D_P_ U 80 31
100 84 222.0000 74 224.0000 221.5000 3402 1.12%D_P_ U 99 29
200 182 223.0000 107 224.0000 221.5000 4928 1.12%D_P_ U 199 56
300 280 222.2500 103 224.0000 221.5000 6652 1.12%D_P_ D 299 21
400 378 221.7917 95 224.0000 221.6250 7830 1.06%D_P_ D 399 29
500 478 222.1667 79 224.0000 221.6667 9058 1.04%D_P_ D 499 31
600 578 222.1111 112 224.0000 221.6667 10226 1.04%S_ U 554 28
700 674 221.9167 106 224.0000 221.7500 11326 1.00%D_P_ U 243 46
800 774 222.0000 75 224.0000 221.7500 12622 1.00%D_P_ D 799 34
900 874 222.5000 32 224.0000 221.7500 13255 1.00%D_P_ D 899 61
1000 971 222.0000 53 224.0000 221.7500 14293 1.00%D_P_ D 999 40
Elapsed b&b time = 41.90 sec. (tree size = 11.82 MB)
Nodefile size = 1.99 MB (0.72 MB after compression)
1100 1068 222.0000 92 224.0000 221.7500 15652 1.00%D_P_ D 1099 31
1200 1168 222.0000 56 224.0000 221.7500 16778 1.00%D_P_ D 1199 49
1300 1268 222.0000 65 224.0000 221.7500 17616 1.00%D_P_ D 1299 53
1400 1367 223.0000 67 224.0000 221.7500 18626 1.00%D_P_ D 1399 52
1500 1465 222.5000 99 224.0000 221.8000 19737 0.98%D_P_ U 1499 40
1600 1565 222.1000 44 224.0000 221.8214 20476 0.97%D_P_ U 1599 40
1700 1665 222.1667 75 224.0000 221.8333 21520 0.97%D_P_ U 581 28
1800 1765 223.0000 50 224.0000 221.8500 23033 0.96%D_P_ U 1799 46
1900 1863 222.5000 55 224.0000 221.9167 24675 0.93%D_P_ D 1899 42
2000 1961 222.2895 60 224.0000 221.9167 25734 0.93%D_P_ U 1999 38
Elapsed b&b time = 66.18 sec. (tree size = 23.97 MB)
Nodefile size = 14.92 MB (5.19 MB after compression)
2100 2059 222.3000 90 224.0000 221.9667 27116 0.91%D_P_ U 1455 42
2200 2158 222.5000 83 224.0000 222.0000 28979 0.89%D_P_ D 2199 72
2300 2255 222.5000 63 224.0000 222.0000 30725 0.89%D_P_ D 2299 27
2400 2353 222.0000 126 224.0000 222.0000 31980 0.89%D_P_ D 2399 14
2500 2449 222.5000 93 224.0000 222.0000 33180 0.89%D_P_ U 202 6
2600 2549 222.5000 51 224.0000 222.0000 34209 0.89%D_P_ D 2599 44
2700 2647 222.0000 58 224.0000 222.0000 35094 0.89%D_P_ D 2659 38
2800 2744 222.1667 63 224.0000 222.0000 36646 0.89%D_P_ U 2772 54
2900 2840 223.0000 20 224.0000 222.0000 38266 0.89%D_P_ U 2899 67
3000 2936 223.0000 53 224.0000 222.0000 39605 0.89%D_P_ D 2999 118
Elapsed b&b time = 90.11 sec. (tree size = 36.14 MB)
Nodefile size = 26.84 MB (9.24 MB after compression)
3100 3033 222.6400 58 224.0000 222.0000 41341 0.89%D_P_ D 3099 90
3200 3131 222.6667 74 224.0000 222.0000 42328 0.89%D_P_ D 3199 63
oh...no!! Not Solved...
Error
CplexStatus: NodeFileLimFeas
Node file size limit, integer solution exists

--------------------------------------------------------------------

À§ÀÇ ·Î±×¿¡¼­,
oh...no!! Not Solved... Àº cplex.solve()°¡ IloFalse¸¦ ¸®ÅÏÇÏ´Â °æ¿ì
¿¡¸¸ Âïµµ·Ï ÇÑ ³»¿ëÀ̰í,
Error´Â cplex.getStatus()ÀÇ ³»¿ëÀ» ÂïÀº ºÎºÐÀÔ´Ï´Ù.
(Áï, cplex.getStatus()ÀÇ ¸®ÅϰªÀÌ IloAlgorithm::Error ÀÔ´Ï´Ù.)
±× ¾Æ·¡¿¡ ÀÖ´Â, CplexStatus: NodeFileLimFeas´Â
cplex.getCplexStatus()ÀÇ ¸®ÅϰªÀ» Âïµµ·Ï ÇÑ ºÎºÐÀÔ´Ï´Ù.
±× ¾Æ·¡¿¡ ÀÖ´Â, Node file size limit, integer solution exists´Â
cplex.getCplexStatusÀÇ ¸®Åϰª¿¡ ÇØ´çÇÏ´Â ¼³¸íÀ» ·¹ÆÛ·±½º ¸Þ´º¾ó¿¡¼­
ã¾Æ Âïµµ·Ï ÇÑ ³»¿ëÀÔ´Ï´Ù.

À§ÀÇ ³»¿ë´ë·Î¶ó¸é, feasible solutionÀ» ã¾Ò´Â Áö¸¦ È®ÀÎÇÏ°í ½ÍÀ» ¶§
cplex.solve()ÀÇ °ª¸¸À» º¸°í ÆÇ´ÜÇÒ ¼ö ¾øÀ» °Í °°Àºµ¥...
feasible solutionÀ» ã¾Ò´Â Áö¸¦ È®ÀÎÇÏ°í ½ÍÀ» ¶§ ½±°Ô ¾Ë¾Æ³¾ ¼ö ÀÖ´Â
¹æ¹ýÀ» ¾Ë·ÁÁÖ½Ã¸é °¨»çÇϰڽÀ´Ï´Ù.

ÁÁÀº Á¶¾ð ±â´Ù¸®°Ú½À´Ï´Ù.
°ü·Ã±Û º¸±â
"[RE]cplex.getStatus()¸¦ »ç¿ëÇØº¸¼¼¿ä"¿Í(°ú) °ü·ÃµÈ ±ÛÀÌ  8°Ç ÀÖ½À´Ï´Ù.
cplex.getCplexStatus() ¿¡¼­ ±Ç¼ºÈ­ 2003-02-25
cplex.getStatus()¸¦ »ç¿ëÇØº¸¼¼¿ä ¼Ò°æÃ¶ 2003-02-26
   [RE]cplex.getStatus()¸¦ »ç¿ëÇØº¸¼¼¿ä ±Ç¼ºÈ­ 2003-02-26
    NodeFileLim ÀÌ ¹®Á¦ÀÎ °Í °°³×¿ä.. ¼Ò°æÃ¶ 2003-02-27
     [RE]NodeFileLim ÀÌ ¹®Á¦ÀÎ °Í °°³×¿ä.. ±Ç¼ºÈ­ 2003-02-27
      ÀûÀýÇÑ Á¾°áÁ¶°ÇÀ» »ç¿ëÇϽñ⠹ٶø´Ï´Ù. ¼Ò°æÃ¶ 2003-02-28
       [RE]ÀûÀýÇÑ Á¾°áÁ¶°ÇÀ» »ç¿ëÇϽñ⠹ٶø´Ï´Ù. ±Ç¼ºÈ­ 2003-02-28
       ´äº¯ Àǵµ¿¡ ´ëÇÑ ¼³¸í... ¼Ò°æÃ¶ 2003-03-03
       [RE]´äº¯ Àǵµ¿¡ ´ëÇÑ ¼³¸í... ±Ç¼ºÈ­ 2003-03-04