About LogMIP

LogMIP 2.0 is a program for solving linear and nonlinear disjunctive programming problems, involving binary variables and disjunction definitions for modeling discrete choices. While the modeling and solution of these disjunctive optimization problemas has not yect reached the stage of maturity and reliability as LP, MIP and NLP modeling, these problems have a rich area of applications.

LogMIP 2.0 has been developed by Dr. Aldo Vecchietti from INGAR (Santa Fe, Argentina), Professor Ignacion E. Grossmann from Carnegie Mellon University (Pittsburgh, USA), and becomes a progress since its previous version, LogMIP 1.0.

Please, note:

• LogMIP 1.0 vorks for 22.6 (December 2007) until 23.6 (December 2010) GAMS releases.
• LogMIP 2.0 is included from 23.7 GAMS release. LogMIP 1.0 does not work anymore from this release.
• Changes in version 2.0 are at the level of language, where LogMIP now uses the EMP syntax and modeltype, and at the level of solvers, where Imbigm and Imchull are combined in the new solver logmip.
• Big-M and convex-hull relaxations algorithms solvers for non-linear models, are now included and can be used from LogMIP 2.0.