LOGMIP

Top  Previous  Next

LogMIP solves linear and nonlinear disjunctive programming problems involving binary variables and disjunction definitions for models involving discrete choices. LogMIP was been developed by A. Vecchietti, J.J. Gil and L. Catania at INGAR (Santa Fe-Argentina) and

Ignacio E. Grossmann at Carnegie Mellon University (Pittsburgh-USA).  LogMIP comes free of charge with any licensed GAMS system but needs a subsolver to solve the generated MIP/MINLP models.

 

For more information see the solver manuals or http://www.logmip.ceride.gov.ar/eng/about/about.htm.