Linear optimisation problem, limitation problem

[LouiseS]

Hey,

I'm trying to optimise diets with the proc optmodel. So, my problem is composed of a quadratic objective function and many linear contrains. With the QP solver, I reached the limit of iterations even if I increased their numbers.

So, I have tried to use a IPNLP solver and now for some diets, I obtained the optimum and for others the best feasible solution. What is the difference? And how can I obtain the optimum?

Thank you

[RobPratt · Accepted solution]

Can you please share your data and code?