GAMS World Forum

Okay, I see. By current feasibility, I meant simply something like the output of IPOPT or FMINCON (if you are familiar with either) where you could see the infeasibility with regards to the constraints decreases gradually with the number of iterations until it meets the stopping criteria.

Currently, I am using BARON through GAMS. The ususal output printed during solving is like the following. It only shows the upper and lower bound on the objective at every iteration Iteration Open nodes Time (s) Lower bound Upper bound 1 1 86.10 0.00000 0.100000E+52 5 3 127.89 0.00000 0.100000E+52 6...

Hello I am solving a NLP problem with around 300 constraints (linear and nonlinear) in BARON. The problem is that BARON seems to get stuck when I ask for tighter constraint tolerance ( AbsConFeasTol ). After 24 hrs of running, no improvement in the upper and lower bounds. Nothing in the problem form...

I see. Thanks a lot!

It seems that even Baron uses cplex as a subsolver. However, I couldn't tell based on Baron documentation if you can pass cplex option file. Can we do that?

Thanks. I just checked my workstation. The only global solver available to me is ANTIGONE. I was also advised about a choice in the Cplex option file called "LP method" and I can set it to be "concurrent optimization". I looked that up but couldn't find anything related 1- Lookin...

Good to know thanks a lot!

Do you have a suggestion for another global solver with parallelization capability?

Hello, Totally new to GAMS and the solver Baron. I am currently running my problem through this Julia interface to GAMS: https://juliahub.com/ui/Packages/GAMS/TiMGh/0.3.3 I am solving a large-scale feasibility optimization problem on a computational node with multiple cores. My problem (seemingly) i...