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. (Source: http://plato.asu.edu)

References in zbMATH (referenced in 22 articles )

Showing results 1 to 20 of 22.
Sorted by year (citations)

1 2 next

  1. Sebastiani, Roberto; Trentin, Patrick: \textscOptiMathSAT: a tool for optimization modulo theories (2020)
  2. Lyu, Yinrun; Chen, Li; Zhang, Changyou; Qu, Dacheng; Min-Allah, Nasro; Wang, Yongji: An interleaved depth-first search method for the linear optimization problem with disjunctive constraints (2018)
  3. Chen, Li; Lyu, Yinrun; Wang, Chong; Wu, Jingzheng; Zhang, Changyou; Min-Allah, Nasro; Alhiyafi, Jamal; Wang, Yongji: Solving linear optimization over arithmetic constraint formula (2017)
  4. Kılınç, Mustafa R.; Linderoth, Jeff; Luedtke, James: Lift-and-project cuts for convex mixed integer nonlinear programs (2017)
  5. Kirst, Peter; Rigterink, Fabian; Stein, Oliver: Global optimization of disjunctive programs (2017)
  6. Sebastiani, Roberto; Tomasi, Silvia: Optimization modulo theories with linear rational costs (2015)
  7. Hamzeei, Mahdi; Luedtke, James: Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (2014)
  8. Hijazi, Hassan; Bonami, Pierre; Ouorou, Adam: An outer-inner approximation for separable mixed-integer nonlinear programs (2014)
  9. Kılınç, Mustafa; Linderoth, Jeff; Luedtke, James; Miller, Andrew: Strong-branching inequalities for convex mixed integer nonlinear programs (2014)
  10. Patil, Bhagyesh V.; Nataraj, P. S. V.: An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (2014)
  11. Gleixner, Ambros M.; Weltge, Stefan: Learning and propagating Lagrangian variable bounds for mixed-integer nonlinear programming (2013)
  12. Bonami, Pierre; Kilinç, Mustafa; Linderoth, Jeff: Algorithms and software for convex mixed integer nonlinear programs (2012)
  13. Grossmann, Ignacio E.; Ruiz, Juan P.: Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization (2012)
  14. Patil, Bhagyesh V.; Nataraj, P. S. V.; Bhartiya, Sharad: Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach (2012)
  15. Ruiz, Juan P.; Jagla, Jan-H.; Grossmann, Ignacio E.; Meeraus, Alex; Vecchietti, Aldo: Generalized disjunctive programming: solution strategies (2012)
  16. Floudas, C. A.; Gounaris, C. E.: A review of recent advances in global optimization (2009)
  17. Kallrath, Josef: Solving planning and design problems in the process industry using mixed integer and global optimization (2005)
  18. Lee, Sangbum; Grossmann, Ignacio E.: Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (2005)
  19. Nowak, Ivo: Relaxation and decomposition methods for mixed integer nonlinear programming. (2005)
  20. Grossmann, Ignacio E.; Lee, Sangbum: Generalized convex disjunctive programming: Nonlinear convex hull relaxation (2003)

1 2 next