Sugarcane in Minecraft only grows next to water, so farm layout is really a 2D coverage problem: where do you place water to maximize adjacent plantable tiles?
Each water tile can cover up to 4 neighbors, which caps theoretical max coverage at 80% regardless of arrangement. I modeled this as an integer program (CP-SAT via OR-Tools) to find the actual optimal layout for a given terrain shape.
Results for a 9x9 square plot:
Community-standard pattern: 66.7% coverage
Optimal (CP-SAT): 75.3% coverage (94% of theoretical max)
The symmetric square case is the easy comparison point against human intuition. What's more interesting is irregular terrain with obstacles, where there's no established heuristic and the exact solver is the only way to get a real answer - including one case (unconstrained/open terrain) where the solver converges to a hexagonal-ish pattern and actually hits the 80% theoretical ceiling.
I was sweeping floors at a supermarket and decided to over-engineer it.
Instead of just… sweeping… I turned the supermarket into a grid graph and wrote a C++ optimizer using simulated annealing to find the “optimal” sweeping path.
It worked perfectly.
It also produced a path that no human could ever walk without losing their sanity. Way too many turns. Look at this:
Turns out optimizing for distance gives you a solution that’s technically correct and practically useless.
Adding a penalty each time it made a sharp turn made it actually walkable:
But, this led me down a rabbit hole about how many systems optimize the wrong thing (social media, recommender systems, even LLMs).
If you like algorithms, overthinking, or watching optimization go wrong, you might enjoy this little experiment. More visualizations and gifs included! Check comments.
I'm working through MIT OCW 6.7220 Nonlinear Optimization (Spring 2025) and looking for 2–5 people who want to follow the course together.
The goal would be:
watch lectures according to the course schedule
independently attempt each problem set
meet online once/twice a week
discuss difficult problems and compare approaches
explain proofs/optimization theory to each other
work through the material over ~8–12 weeks
Topics include convex optimization, optimality conditions, Lagrange multipliers, KKT, duality, gradient/Newton methods, etc.
I'm particularly interested in people doing mathematical optimization / numerical optimization / operations research / ML / control.
If interested, comment or DM me and we can create a Discord/WhatsApp/Telegram group.
Edit : This course does not have any videos or you won't find much material else where to watch . You have to be okay putting your time to read and analyse and think and do some arguments.
Edit 2 : surprising number of people want to join my discord server which is nice , that is why I will post the link here just click it and join https://discord.gg/rMqqj2GmY
The library lets users formulate and solve optimization problems in Rust using a high-level modeling API, similar to tools like Pyomo (Python), JuMP (Julia), or GAMS.
oximo supports modeling and solving:
Linear Programming (LP)
Mixed-Integer Linear Programming (MILP)
Quadratic Programming (QP)
Nonlinear Programming (NLP)
Mixed-Integer Nonlinear Programming (MINLP)
Example:
let m = Model::new("transport");
let x = m.var("x").lb(0.0).build();
let y = m.var("y").lb(0.0).ub(4.0).build();
m.constraint("c1", (x + 2.0 * y).le(14.0));
m.constraint("c2", (3.0 * x).ge(y));
m.constraint("c3", x.le(y + 2.0));
m.maximize(3.0 * x + 4.0 * y);
let result = Highs.solve(&m, &HighsOptions::default())?;
I'd like to get feedback on the API design, modeling ergonomics and solver integrations you'd like to see. Future releases will have integration with more solvers, autodiff, GDP, Polars integration, and better docs.
Contributions, bug reports, and feature requests are welcome.
So, I have recently found that there is a serious issue with benchmarking evolutionary computation (EC) methods. The ''standard'' benchmark set used for their evaluation has many functions that have the optimum at the center of the feasible set, and there are EC methods that exploit this feature to appear competitive. I managed to publish a paper showing the problem and identified 7 methods that have this problem:
Now, I performed additional analysis on a much bigger set of EC methods (90 considered), and have found that the center-bias issue is extremely prevalent (47 confirmed, most of them in the last 5 years):
Maybe some of you will find it useful when trying out EC methods for black-box problems (IMHO they are still the best tools available for such problems).
With our passion for mathematical Optimization, we want to give you easy access to theoretical knowledge and potential applications for these approaches. It all started when I started to optimize and realized that the theoretical knowledge was there in papers but was hard to process. That’s why I started to do videos to easily explain how optimizers work (i.e. NGSA-II).
Stop by and give feedback or ask me your questions - and never forget, keep optimizing!!
If you are interested in applications of mixed-integer programming in industry, then you will enjoy this new article I wrote on the DoorDash engineering blog “Using ML and Optimization to Solve DoorDash’s Dispatch Problem.” The article takes a deep dive under the hood of DoorDash’s logistics platform. We discuss the unique factors we have to consider in our dispatch problem and how we optimize over a variety of data inputs, including predictions from our ML models, to ensure speedy deliveries and maximize opportunities for Dashers. Check it out! https://doordash.engineering/2021/08/17/using-ml-and-optimization-to-solve-doordashs-dispatch-problem/
I contribute to SciPy and kept running into a class of bug that annoys me: the outputs look plausible, the tests pass, but the equation the code implements is subtly wrong. So I've been building a tracer that runs Python/NumPy code and hands back whatever mathematics it actually computed, as a SymPy expression you can simplify or differentiate like anything else.
It's been more useful than I expected. Comparing an implementation against the formula in a paper, catching two functions that agree on my test data but turn out to compute different things, digging up the inputs my tests never hit (ties, zero denominators). It traces real library code too, most of numpy and a good chunk of scipy, scikit-learn, statsmodels, cvxpy.
So I have this problem where i want to make a pattern of LEDs such that the most uniform light is achieved within an area on a plane 5cm away. I can't change the power of the LEDs individually and I can't change the radiation pattern of the LEDs. So all I can do is distribute the LEDs within a 40×40 cm area to achieve the most uniform distribution within a 20×20 cm area 5 cm away from the LED plane. I havr tried different methods but havent found a good way still, the closest I have gotten is the picture below but that was not with my real radiation pattern. I want to use between 100-200 LEDs which also makes it a fairly computationally large problem atleast with the things I have tried. Does anyone know of this having been solved somewhere else or have a good idea for it?
We (Cristina Radu, PhD,Carlos Armando Zetina, Ph.D., and I -Borja Menéndez-) are a lively group of Operations Research professionals who 🫶 love connecting with fellow OR enthusiasts through LinkedIn discussions or our online optimization courses.
To add some excitement, we are launching a series of 5 events designed to showcase OR from various viewpoints while creating a fun, competitive atmosphere with a chance to win one of ten prizes 🏆 adding up to $1000!
We recognize a disconnect between academic theory and real-world optimization challenges. There is a need for greater visibility regarding practical applications of OR. And we believe that engaging with one another will enhance our collective knowledge and professional skills.
We warmly invite you to join us from September 30th to October 4th for a lively exploration of the world of Operations Research!
🌯 Monday, September 30th: Kick off the week with the Burrito Optimization Game, a hands-on activity designed to challenge your problem-solving abilities and introduce you to the fun world of optimization.
🎤 Tuesday, October 1st: Get inspired by a video interview featuring a leader in Operations Research from Amazon. Gain valuable insights into the complexities of implementing optimization on a large scale.
📗 Wednesday, October 2nd: Explore the Playbook of Practical Operations Research, a detailed guide that will provide you with a robust toolkit of strategies, methodologies, and best practices for addressing complex challenges in your optimization projects.
🔄 Thursday, October 3rd: Participate in a live Zoom session where we discuss end-to-end OR project management. Share your experiences in scoping, formulating, solving, and deploying optimization solutions, and receive feedback from the organizers of the optimization sprint.
💼 Friday, October 4th: Conclude the week with a live Career Panel on Zoom. We will share personal insights about our operations research journey, industry trends, and strategies for thriving in this dynamic field.
Moreover, by actively engaging in the sprint, you can earn points and have the opportunity to win one of our ten prizes:
You win points starting NOW by sharing this announcement on LinkedIn (repost with your thoughts) and leaving comments (check out the welcome email).
For further information about the points system, please visit our website. Remember to sign up previously!
I’m currently working as an optimization engineer at a logistics company, and I really enjoy my job. But I think there’s a limit to how much we can optimize problems at this company—at some point, there won’t be any more optimization projects left for us there. Am I wrong? In other words, if OR projects come to an end at one company, should we look for OR positions at another company, or do you think we should transition to different job titles? What do those who have worked in optimization in the private sector for a long time think?
I’ve been working on KAIROS, a university course timetabling system written in Python.
It takes course and room data and builds a weekly schedule while enforcing constraints such as room capacity, instructor availability, lab requirements, fixed sessions, and double-booking. Once it finds a feasible timetable, it tries to improve practical details such as student idle gaps, late classes, room stability, and instructor schedules.
The solver uses OR-Tools CP-SAT, followed by repair and local-search stages. The final timetable is checked by a separate validator rather than being accepted directly from the solver.
There is a bilingual web interface, a command-line version, sample data, and CSV, JSON, and PDF export. The optimization model is also documented in the repository.
The project is MIT-licensed. I’d be interested in feedback from anyone working on timetabling, constraint programming, or university scheduling, particularly regarding missing real-world constraints.
Our friends at PyMC Labs and colleagues at FICO hosted a free online webinar to accompany the blog post and open-source repo that bridges Bayesian Forecasting and Optimization through an energy planning use case.
If you were unable to catch it, we have now uploaded it to YouTube so you can view it on your time.
In the webinar, we discuss the strengths and weaknesses of two approaches to combining these frameworks.
Chance-Constrained: Meet the 95th percentile demand. Simple. Deterministic. But ignore what happens in the tail.
CVaR (Conditional Value-at-Risk): Minimize cost in the worst 5% of scenarios. Explicitly controls tail risk.
I would like to learn about real-world problems that no one has yet taken up, or could be solved better. Or even mathematical problems (like np hard ones) that have good applications.