{"id":5232,"date":"2011-09-22T12:05:59","date_gmt":"2011-09-22T10:05:59","guid":{"rendered":"http:\/\/www.ehu.es\/sgi\/?p=5232"},"modified":"2016-09-05T10:27:06","modified_gmt":"2016-09-05T08:27:06","slug":"cplex","status":"publish","type":"post","link":"https:\/\/www.ehu.eus\/sgi\/software-de-calculo\/cplex","title":{"rendered":"CPLEX"},"content":{"rendered":"<h2>Informaci\u00f3n general<\/h2>\n<p>CPLEX proporciona algoritmos matem\u00e1ticos robustos, permite resolver problemas con millones de variables y restricciones. Versi\u00f3n 12.6.3.<\/p>\n<h4>Caracter\u00edsticas<\/h4>\n<ul>\n<li><strong>Automatic and dynamic algorithm parameter control<\/strong><br \/>\nIBM ILOG CPLEX Optimizer automatically determines \u00absmart\u00bb settings for a wide range of algorithm parameters, usually resulting in optimal linear programming solution performance. However, for a more hands-on approach, dozens of parameters may be manually adjusted, including algorithmic strategy controls, output information controls, optimization duration limits, and numerical tolerances.<\/li>\n<li><strong>Fast, automatic restarts from an advanced basis<\/strong><br \/>\nLarge problems can be modified, and then solved again in a fraction of the original solution time.<\/li>\n<li><strong>A variety of problem modification options, such as:<\/strong><br \/>\n&#8211; The ability to add and delete variables<br \/>\n&#8211; The ability to add and delete constraints<br \/>\n&#8211; The ability to modify objective, right-hand side, bound and matrix coefficients<br \/>\n&#8211; The ability to change constraint types<\/li>\n<li><strong>A wide variety of input\/output options, such as:<\/strong><br \/>\n&#8211; Problem files: read\/write MPS files, IBM ILOG CPLEX Optimizer LP files, MPS basis and revise files, binary problem\/basis files<br \/>\n&#8211; Log files: session information and various solution reports<br \/>\n&#8211; Solution files: ASCII and binary solution files<br \/>\n&#8211; IBM ILOG CPLEX Optimizer messages: Each message type (such as RESULTS, WARNINGS or ERRORS) can be directed to specified files, or completely suppressed.<\/li>\n<li><strong>Post solution information and analysis, including: <\/strong><br \/>\n&#8211; Objective function value<br \/>\n&#8211; Solution variable and slack values<br \/>\n&#8211; Constraint dual values (shadow prices)<br \/>\n&#8211; Variable reduced costs<br \/>\n&#8211; Right-hand side, objective function, and bound sensitivity ranges<br \/>\n&#8211; Basic variables and constraints<br \/>\n&#8211; Solution infeasibilities (if any exist)<br \/>\n&#8211; Iteration\/node count, solution time, process data<br \/>\n&#8211; Infeasibility (IIS) finder for diagnosing problem infeasibilities<br \/>\n&#8211; Feasibility optimizer for automatic correction of infeasible models<\/li>\n<\/ul>\n<h2>C\u00f3mo usar<\/h2>\n<p>Para usar CPLEX ejecutar:<\/p>\n<pre>\/software\/bin\/cplex\/cplex<\/pre>\n<h2>Benchmark<\/h2>\n<p>Hemos realizado un peque\u00f1o benchmark usando COIN-OR, ver la [intlink id=\u00bb1397&#8243; type=\u00bbpost\u00bb]p\u00e1gina de COIN-OR[\/intlink].<\/p>\n<h2>M\u00e1s informaci\u00f3n<\/h2>\n<p><a href=\"http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/about\/?S_CMP=rnav\" target=\"_blank\">P\u00e1gina web de CPLEX<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Informaci\u00f3n general CPLEX proporciona algoritmos matem\u00e1ticos robustos, permite resolver problemas con millones de variables y restricciones. Versi\u00f3n 12.6.3. Caracter\u00edsticas Automatic and dynamic algorithm parameter control IBM ILOG CPLEX Optimizer automatically determines \u00absmart\u00bb settings for a wide range of algorithm parameters, usually resulting in optimal linear programming solution performance. However, for a more hands-on approach, dozens &hellip; <a href=\"https:\/\/www.ehu.eus\/sgi\/software-de-calculo\/cplex\" class=\"more-link\">Seguir leyendo <span class=\"screen-reader-text\">CPLEX<\/span> <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_links_to":"","_links_to_target":""},"categories":[166,3],"tags":[],"_links":{"self":[{"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/posts\/5232"}],"collection":[{"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/comments?post=5232"}],"version-history":[{"count":10,"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/posts\/5232\/revisions"}],"predecessor-version":[{"id":8595,"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/posts\/5232\/revisions\/8595"}],"wp:attachment":[{"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/media?parent=5232"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/categories?post=5232"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.ehu.eus\/sgi\/wp-json\/wp\/v2\/tags?post=5232"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}