|
Á¦ ¸ñ |
CPLEX 11.0 MIP »ç¿ë½Ã optimalÀ» ãÁö ¸øÇÏ´Â Çö»ó |
|
ÀÛ¼ºÀÚ |
ÀÓ¼ºÈÆ |
ÀÛ¼ºÀÏ |
2008-10-07 |
Á¶È¸¼ö |
1447 ȸ |
|
÷ºÎÆÄÀÏ |
questions_12.zip(174826 Byte)
|
|
¾È³çÇϼ¼¿ä ¿À´Ã ¿ÀÈÄ 4½ÃÂë Àüȵå·È´ø KAIST »ê¾÷°øÇаú ¼®»ç°úÁ¤ ÀÓ¼ºÈÆ ÀÔ´Ï´Ù.
CPLEX 11.0¿¡¼ MIP¸¦ solution timeÀÌ ±æ¾îÁö´õ¶óµµ optimalÇÑ °á°ú°ªÀ» ¾ò±â À§ÇØ »ç¿ëÇÏ¿´´Âµ¥ ¿ÀÈ÷·Á ¹®Á¦ size°¡ Å« °æ¿ì solution timeÀº ªÀº ¹Ý¸é optimal °ªÀ» ÁÖÁö ¾Ê´Â °æ¿ì°¡ ¹ß»ýÇÕ´Ï´Ù. (Á¦°¡ ¸¸µç branch-and-boundº¸´Ù ¿ÀÈ÷·Á solution timeÀº ª°í °á°ú°ªÀÇ ¼º´ÉÀº ÁÁÁö ¾Ê°Ô ³ª¿É´Ï´Ù.) ¸Þ´º¾ó¿¡ ³ª¿ÍÀÖ´Â ¿É¼Ç(emphasis)À» »ç¿ëÇØ º¸¾Ò´Âµ¥µµ ´äÀÌ ±×´ë·Î³×¿ä
¶Ç, ¾î¶² °æ¿ì¿¡´Â(5_5_9.mps) branch-and-bound°¡ solutionÀ» ã´Â ¹Ý¸é MIP´Â ãÁö ¸øÇÏ´Â °æ¿ì(infeasible)µµ ÀÖ°í ¾î´À °æ¿ì¿¡¼´Â solution timeµµ ´À¸®°í, °á°ú°ªÀÇ ¼º´Éµµ ³·Àº °ÍÀÌ ÀÖ½À´Ï´Ù.
¾Æ±î ¸»¾¸ÇϽŠ´ë·Î mps ÆÄÀϰú data¿øº»ÆÄÀÏ Ã·ºÎÇÕ´Ï´Ù.(mpsDatagenration.cpp¿¡ÀÇÇØ »ý¼ºµË´Ï´Ù) |
|
|
|