LINDOGlobal

LINDO Global employs branch-and-cut methods to break an nonlinearly constrained optimization problem model down into a list of subproblems. Each subproblem is analyzed and either a) is shown to not have a feasible or optimal solution, or b) an optimal solution to the subproblem is found, e.g., because the subproblem is shown to be convex, or c) the subproblem is further split into two or more subproblems which are then placed on the list. Given appropriate tolerances, after a finite, though possibly large number of steps a solution provably global optimal to tolerances is returned.


References in zbMATH (referenced in 24 articles , 1 standard article )

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

1 2 next

  1. Birgin, E.G.; Lobato, R.D.; Martínez, J.M.: Packing ellipsoids by nonlinear optimization (2016)
  2. Grimstad, Bjarne; Sandnes, Anders: Global optimization with spline constraints: a new branch-and-bound method based on B-splines (2016)
  3. Zhang, Yan; Sahinidis, Nikolaos V.: Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment (2016)
  4. Bao, Xiaowei; Khajavirad, Aida; Sahinidis, Nikolaos V.; Tawarmalani, Mohit: Global optimization of nonconvex problems with multilinear intermediates (2015)
  5. Frank, Stephen M.; Rebennack, Steffen: Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach (2015)
  6. Berthold, Timo: RENS. The optimal rounding (2014)
  7. Berthold, Timo; Gleixner, Ambros M.: Undercover: a primal MINLP heuristic exploring a largest sub-MIP (2014)
  8. Khazaei, Javad; Downward, Anthony; Zakeri, Golbon: Modelling counter-intuitive effects on cost and air pollution from intermittent generation (2014)
  9. Misener, Ruth; Floudas, Christodoulos A.: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (2014)
  10. Misener, Ruth; Floudas, Christodoulos A.: A framework for globally optimizing mixed-integer signomial programs (2014)
  11. Newby, Eric; Ali, M.M.: A note on convex reformulation schemes for mixed integer quadratic programs (2014)
  12. Zorn, Keith; Sahinidis, Nikolaos V.: Global optimization of general nonconvex problems with intermediate polynomial substructures (2014)
  13. Belotti, Pietro: Bound reduction using pairs of linear inequalities (2013)
  14. Janes, Pete P.; Rendell, Alistair P.: Deterministic global optimization in ab-initio quantum chemistry (2013)
  15. Misener, Ruth; Floudas, Christodoulos A.: GLOMIQO: global mixed-integer quadratic optimizer (2013)
  16. Rios, Luis Miguel; Sahinidis, Nikolaos V.: Derivative-free optimization: a review of algorithms and comparison of software implementations (2013)
  17. Zhang, Jian; Yang, Wensheng; Tu, Yiliu: Scheduling with compressible and stochastic release dates (2013)
  18. Berthold, Timo; Gleixner, Ambros M.; Heinz, Stefan; Vigerske, Stefan: Analyzing the computational impact of MIQCP solver components (2012)
  19. Berthold, Timo; Heinz, Stefan; Vigerske, Stefan: Extending a CIP framework to solve MIQCPs (2012)
  20. Gleixner, Ambros M.; Held, Harald; Huang, Wei; Vigerske, Stefan: Towards globally optimal operation of water supply networks (2012)

1 2 next