|
Á¦ ¸ñ |
¾È³çÇϼ¼¿ä? quadratic problem°ú cplex¿¡ ´ëÇØ ±Ã±ÝÇÑ°Ô ÀÖ½À´Ï´Ù. |
|
ÀÛ¼ºÀÚ |
¼Ûº´´ö |
ÀÛ¼ºÀÏ |
2012-04-02 |
Á¶È¸¼ö |
1250 ȸ |
|
÷ºÎÆÄÀÏ |
÷ºÎµÈ ÆÄÀϾøÀ½.
|
|
¼ö°í ¸¹À¸½Ê´Ï´Ù.
cplex 12.4°¡ ³ª¿Ô´Ù°í ÇÏ¿© ¸Þ´º¾óÀ» º¸´ø Áß quadratic ºÎºÐ¿¡ ±Ã±ÝÁõÀÌ ÀÖ¾î¼ Áú¹®µå¸³´Ï´Ù.
¸Þ´º¾ó¿¡´Â °£´ÜÇÑ ÇüÅÂÀÇ quadratic problemÀ» Á¦½ÃÇϰí(¿¹¸¦ µé¾î ¸ñÀûÇÔ¼ö ¶Ç´Â Á¦¾à½Ä¿¡ ¾ÆÁÖ °£´ÜÇÑ quadratic ¼ö½ÄÀÌ µé¾î°£ ¹®Á¦µé) ÀÌ·±°ÍµéÀ» Ç® ¼ö ÀÖ´Ù°í Çϴµ¥..(¿¹Á¦ Âü°í)
This example shows you how to build and solve a QP. The problem being created and solved is:
Maximize x1 + 2x2 + 3x3 - 0.5(33x12 + 22x22 + 11x32 - 12x1x2 - 23x2x3) subject to -x1 + x2 + x3 ¡Â 20 x1 - 3x2 + x3 ¡Â 30 with these bounds 0 ¡Â x1 ¡Â 40 0 ¡Â x2 ¡Â +¡Ä 0 ¡Â x3 ¡Â +¡Ä
ÀÌ·± °£´ÜÇÑ ÇüÅÂµé ¸»°í ½ÇÁ¦¹®Á¦¸¦(º¯¼ö ¼öõ°³, Á¦¾à½Ä ¼ö¸¸~½Ê¼ö¸¸°³) cplex·Î Ǫ´Âµ¥ ÀÖ¾î¼ cplex°¡ ¾î´ÀÁ¤µµÀÇ quadratic ¹®Á¦¸¦ Ä¿¹öÇØ ÁÙ ¼ö ÀÖ´ÂÁö ±Ã±ÝÇÕ´Ï´Ù.
Ȥ½Ã ÀÌÁ¦ ´ëÇÑ ´ë·«ÀûÀÎ ´äº¯À̳ª, Âü°íÇÒ ¸¸ÇÑ ÀÚ·á°¡ ÀÖÀ¸¸é ²ÀÁ» ºÎʵ右´Ï´Ù!
±×·³,, ¼ö°íÇϼ¼¿ä :D |
|
|
|