How can I find the global optimal solution for the following MINLP problem.
Posted: Fri Jul 30, 2021 4:04 am
Hi,
I have attached at MINLP problem. I am using license version of LINDO and LINDO GLOBAL to solve the problem. However, I got the local solutions every time. It also shows the following message "*** could not allocate enough memory". For better understanding I have also attached a screenshot of the output (attached figure 1).
How can I allocate enough memory?
How can I get the global optimum solution? Please suggest based on the LINDO and LINDO GLOBAL solver as I only have the license of these solvers.
Is there any way to minimize the computational time?
What is the lower bound and UPPER BOUND of the objective function (attached figure 2)?
Thanks in advance.
Regards
Asadujjaman
I have attached at MINLP problem. I am using license version of LINDO and LINDO GLOBAL to solve the problem. However, I got the local solutions every time. It also shows the following message "*** could not allocate enough memory". For better understanding I have also attached a screenshot of the output (attached figure 1).
How can I allocate enough memory?
How can I get the global optimum solution? Please suggest based on the LINDO and LINDO GLOBAL solver as I only have the license of these solvers.
Is there any way to minimize the computational time?
What is the lower bound and UPPER BOUND of the objective function (attached figure 2)?
Thanks in advance.
Regards
Asadujjaman