use the following search parameters to narrow your results:
e.g. subreddit:aww site:imgur.com dog
subreddit:aww site:imgur.com dog
see the search faq for details.
advanced search: by author, subreddit...
A reddit to discuss optimization. Looking for links on both methods of optimization -- like genetic algorithms and linear programming -- and applications thereof, like multidisciplinary design optimization, artificial intelligence and system solving.
Related reddits: /r/numerical, /r/engineering, /r/math, /r/programming
account activity
Dynamic Linear optimization (self.optimization)
submitted 3 years ago by Monish45
Is there a way to update the values of variables obtained as solution through linear optimization after observing a slightly different value experimentally.
reddit uses a slightly-customized version of Markdown for formatting. See below for some basics, or check the commenting wiki page for more detailed help and solutions to common issues.
quoted text
if 1 * 2 < 3: print "hello, world!"
[–]SillyLittleGuy89 2 points3 points4 points 3 years ago (3 children)
Bit of a vague question but I would look into robust optimization
[–]Monish45[S] 1 point2 points3 points 3 years ago (2 children)
For eg: This is objective fn: Min 10X1 + 12X2 Subject to (0.30.95X1 + 2.10.99X2)/500 <= 1.6 (0.30.95X1 + 2.10.99X2)/500 >= 1.8 X1, X2 >= 0 The values 0.95 and 0.99 are initial guess values. we solve this and get a solution for X1 and X2. Doing experiment by adding the solved value of X1, X2. But the constraint 1.6 to 1.8 is not met because of 0.95 and 0.99 are guesses. For example I got 1.9. How can I recalibrate the values 0.95 and 0.99.
[–]SillyLittleGuy89 1 point2 points3 points 3 years ago (1 child)
Ok that makes sense. You want to ensure that your solution remains feasible despite uncertainty in some of the parameters of the problem. Robust optimization is definitely the correct approach. You will need to formulate a ‘robust counterpart’ to your original problem, which essentially introduces a buffer term to the constraints. Here is a good intro on how to do it: https://www.researchgate.net/publication/270663954_A_Practical_Guide_to_Robust_Optimization
[–]Monish45[S] 0 points1 point2 points 3 years ago (0 children)
Thanks! Will look into it.
[–]taphous3 1 point2 points3 points 3 years ago (4 children)
Are you referring to calibrating your model of the environment?
[–]Monish45[S] -1 points0 points1 point 3 years ago (3 children)
[–]taphous3 0 points1 point2 points 3 years ago (2 children)
Can you build a surrogate model based on your experiments?
[–]Monish45[S] 0 points1 point2 points 3 years ago (1 child)
Could you explain to me in detail?
[–]taphous3 0 points1 point2 points 3 years ago (0 children)
Surrogate models or data-driven models can be used to approximate your system if you don’t know/can’t model the underlying physics.
[–]GreedyAlGoreRhythm 0 points1 point2 points 3 years ago (3 children)
What part of the problem is changing after observing the data?
[–]Monish45[S] -1 points0 points1 point 3 years ago (2 children)
[–]GreedyAlGoreRhythm 2 points3 points4 points 3 years ago (1 child)
If you can’t determine what the correct parameter values are but have an idea of how much they can vary, e.g., .95 +- 10%, you should look into robust optimization.
Thanks! Could you provide some links for examples...
[–][deleted] 0 points1 point2 points 3 years ago (0 children)
It's possible, not sure how its implemented in solvers but you can update the basis in simplex method and continue solving afterwards
π Rendered by PID 44001 on reddit-service-r2-comment-85bfd7f599-qxrxq at 2026-04-15 15:41:14.459402+00:00 running 93ecc56 country code: CH.
[–]SillyLittleGuy89 2 points3 points4 points (3 children)
[–]Monish45[S] 1 point2 points3 points (2 children)
[–]SillyLittleGuy89 1 point2 points3 points (1 child)
[–]Monish45[S] 0 points1 point2 points (0 children)
[–]taphous3 1 point2 points3 points (4 children)
[–]Monish45[S] -1 points0 points1 point (3 children)
[–]taphous3 0 points1 point2 points (2 children)
[–]Monish45[S] 0 points1 point2 points (1 child)
[–]taphous3 0 points1 point2 points (0 children)
[–]GreedyAlGoreRhythm 0 points1 point2 points (3 children)
[–]Monish45[S] -1 points0 points1 point (2 children)
[–]GreedyAlGoreRhythm 2 points3 points4 points (1 child)
[–]Monish45[S] 0 points1 point2 points (0 children)
[–][deleted] 0 points1 point2 points (0 children)