BookmarkSubscribeRSS Feed
🔒 This topic is solved and locked. Need further help from the community? Please sign in and ask a new question.
Lida
Obsidian | Level 7

Hello, I use proc optmodel to solve a QP problem using QP solver. I minimize the sum of squared differences between a current diet and an optimal diet given a set of linear constraints. My understanding is that  I am dealing with a strictly convex objective function and the set of linear constraints is also a convex space. Does it mean that the global optimal solution is guaranteed providing that there is a solution or I can have set of local optimal? I am wondering what the community think about that? Any response is greatly appreciated! Thank you!

1 ACCEPTED SOLUTION

Accepted Solutions
Lida
Obsidian | Level 7

Thank you Rob for the confirmation. Much appreciated!

 

View solution in original post

2 REPLIES 2
RobPratt
SAS Super FREQ

Yes, the resulting solution should be globally optimal in this case.

Lida
Obsidian | Level 7

Thank you Rob for the confirmation. Much appreciated!

 

sas-innovate-2026-white.png



April 27 – 30 | Gaylord Texan | Grapevine, Texas

Registration is open

Walk in ready to learn. Walk out ready to deliver. This is the data and AI conference you can't afford to miss.
Register now and lock in 2025 pricing—just $495!

Register now

Discussion stats
  • 2 replies
  • 1573 views
  • 0 likes
  • 2 in conversation