Abstract

Due to the rapid development of algorithms and techniques that are used to deal with mixed integer nonlinear programming (MINLP) problems, many global MINLP solvers were introduced. In this paper, computational experiments were done to compare between the performances of five of these solvers. Some of these solvers do not support trigonometric functions. Therefore, piecewise linear approximation (PLA) is applied to problems having these function so the solvers can deal with these problems. Additional computational tests were performed on to show how PLA can be useful, even to some powerful global solvers.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call